Optimization over probability measures
I develop accelerated dynamics for optimization problems in the space of probability measures.
Hamiltonian flows and acceleration
Many problems in machine learning seek a probability distribution that minimizes an objective functional. Wasserstein gradient flow extends gradient descent to this setting, but incorporating momentum requires accounting for the geometry of the space of measures.
In our work on Hamiltonian flows for accelerated optimization, we introduce a momentum coordinate and evolve probability measures in phase space. This gives counterparts of heavy-ball, Nesterov, and variational acceleration methods. Using optimal transport and Lyapunov analysis, we establish accelerated continuous-time convergence rates under suitable convexity and regularity assumptions, supported by numerical experiments.
For papers, preprints, and related work, see Publications. Research code is available on GitHub ↗.