Florida State University
FSUMATH
search
Department of Mathematics
People
Administration
Faculty
Staff
Graduate Students
Research
Research Areas
Seminars
Colloquium and Special Lectures
Electronic Publications
Undergraduate
Undergraduate Overview
Advising Help
AWM - Undergraduate
DRP - Mentees
Graduate
General Information and Guidelines
Admission
Pure Mathematics
Applied and Computational Mathematics
Financial Mathematics
Biomathematics
Data Science
Recent PhDs
Graduate Student Council
AWM - Graduate
DRP - Mentors
Community
Outreach
Newsletter
Donations
Resources
Undergraduate
Graduate
Faculty
Tech Support
Map of Campus
University Center
People
Administration
Faculty
Staff
Graduate Students
Research
Research Areas
Seminars
Colloquium and Special Lectures
Electronic Publications
Undergraduate
Undergraduate Overview
Advising Help
AWM - Undergraduate
DRP - Mentees
Graduate
General Information and Guidelines
Admission
Pure Mathematics
Applied and Computational Mathematics
Financial Mathematics
Biomathematics
Data Science
Recent PhDs
Graduate Student Council
AWM - Graduate
DRP - Mentors
Community
Outreach
Newsletter
Donations
Resources
Undergraduate
Graduate
Faculty
Tech Support
Map of Campus
University Center
This Week in Mathematics
<<
Back to Current Week [2026-04-12 - 2026-04-18]
>>
Beyond Next Week [2026-04-25+]
<<
View Previously Scheduled Events
Next Week
[Apr 19, 2026 - Apr 25, 2026]
April
S
M
T
W
R
F
S
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
Entries for this week: 1
Friday April 24, 2026
Mathematics Colloquium
[
url
]
Designing dynamic measure transport for sampling and quantization
- Youssef M Marzouk, MIT
Time:
3:05
Room:
Lov 101
Abstract/Desc: Sampling or otherwise summarizing complex probability distributions is a central task in applied mathematics, statistics, and machine learning. Many modern algorithms for this task introduce dynamics in the space of probability measures and design these dynamics to achieve good computational performance. We will discuss several aspects of this broad design endeavor. First is the problem of optimal scheduling of dynamic transport, i.e., with what speed should one proceed along a prescribed path of probability measures? Though many popular methods seek “straight line” trajectories, i.e., trajectories with zero acceleration in a Lagrangian frame, we show how a specific class of “curved” trajectories can improve approximation and learning. We then present extensions of this idea which seek not only schedules but paths that improve spatial regularity of the underlying velocity. Second, we discuss the problem of weighted quantization, i.e., summarizing a complex distribution with a small set of weighted samples. We study this problem from the perspective of minimizing maximum mean discrepancy via gradient flow in the Wasserstein–Fisher–Rao geometry. This perspective motivates a new fixed-point algorithm, called mean shift interacting particles (MSIP), which outperforms state-of-the-art methods for quantization. We describe how MSIP can be used not only to quantize an empirical distribution, but to sample given an unnormalized density.
Problems? Email
webmaster@math.fsu.edu
.