Momentum Particle Maximum Likelihood
Not on the map. Why?
Abstract (arXiv)
Maximum likelihood estimation (MLE) of latent variable models is often recast as the minimization of a free energy functional over an extended space of parameters and probability distributions. This perspective was recently combined with insights from optimal transport to obtain novel particle-based algorithms for fitting latent variable models to data. Drawing inspiration from prior works which interpret `momentum-enriched' optimization algorithms as discretizations of ordinary differential equations, we propose an analogous dynamical-systems-inspired approach to minimizing the free energy functional. The result is a dynamical system that blends elements of Nesterov's Accelerated Gradient method, the underdamped Langevin diffusion, and particle methods. Under suitable assumptions, we prove that the continuous-time system minimizes the functional. By discretizing the system, we obtain a practical algorithm for MLE in latent variable models. The algorithm outperforms existing particle methods in numerical experiments and compares favourably with other MLE algorithms.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 21 of its 68 references that are in the map. First posted on arXiv 12 Dec 2023.
Builds on
21 of 68 references.
References · 21
- 2021Score-Based Generative Modeling with Critically-Damped Langevin Diffusioncited by 230
- 2017GANs Trained by a Two Time-Scale Update Rule Converge to a Local Nash Equilibriumcited by 208
- 2017Underdamped Langevin MCMC: A non-asymptotic analysiscited by 131
- 2020Learning Latent Space Energy-Based Prior Modelcited by 104
- 2022Variational inference via Wasserstein gradient flowscited by 84
- 2019On the geometry of Stein variational gradient descentcited by 82
- 2018Understanding the Acceleration Phenomenon via High-Resolution Differential Equationscited by 68
- 2022Mean-Field Langevin Dynamics: Exponential Convergence and Annealingcited by 60
- 2022Convex Analysis of the Mean Field Langevin Dynamicscited by 53
- 2017Stochastic Particle Gradient Descent for Infinite Ensemblescited by 52
- 2019Mean-Field Langevin Dynamics and Energy Landscape of Neural Networkscited by 49
- 2023Forward-backward Gaussian variational inference via JKO in the Bures-Wasserstein Spacecited by 36
9 more
- 2019Escaping Saddle Points with Adaptive Gradient Methodscited by 34
- 2016A Lyapunov Analysis of Momentum Methods in Optimizationcited by 28
- 2022Particle algorithms for maximum likelihood training of latent variable modelscited by 26
- 2022Uniform-in-time propagation of chaos for mean field Langevin dynamicscited by 23
- 2022Mean-field Variational Inference via Wasserstein Gradient Flowcited by 19
- 2023Convergence of mean-field Langevin dynamics: Time and space discretization, stochastic gradient, and variance reductioncited by 19
- 2021Wasserstein distance estimates for the distributions of numerical approximations to ergodic stochastic differential equationscited by 8
- 2023Coin Sampling: Gradient-Based Bayesian Inference without Learning Ratescited by 8
- 2018Hamiltonian Descent Methodscited by 1
Built on by
Citing papers per year: 2024: 6; 2025: 4; 2026: 2.
12 papers.
- 2024Error bounds for particle gradient descent, and extensions of the log-Sobolev and Talagrand inequalitiescited by 13
- 2024Proximal Interacting Particle Langevin Algorithmscited by 8
- 2024Particle Semi-Implicit Variational Inferencecited by 7
- 2024Kinetic Interacting Particle Langevin Monte Carlocited by 7
- 2024Fast Summation of Radial Kernels via QMC Slicingcited by 7
- 2025Training Latent Diffusion Models with Interacting Particle Algorithmscited by 4
- 2025Learning Latent Variable Models via Jarzynski-adjusted Langevin Algorithmcited by 3
- 2025Learning Latent Energy-Based Models via Interacting Particle Langevin Dynamicscited by 3
- 2024Fast convergence of the Expectation Maximization algorithm under a logarithmic Sobolev inequalitycited by 1
- 2025A Gradient Flow Approach to Solving Inverse Problems with Latent Diffusion Modelscited by 0
- 2026Momentum SVGD-EM for Accelerated Maximum Marginal Likelihood Estimationcited by 0
- 2026Particle-based Generalised Stochastic Optimisationcited by 0
- 2026Particle-based Generalised Stochastic Optimisation3 Aug 2026
- 2026Momentum SVGD-EM for Accelerated Maximum Marginal Likelihood Estimation9 Mar 2026
- 2025Learning Latent Energy-Based Models via Interacting Particle Langevin Dynamics14 Oct 2025
- 2025A Gradient Flow Approach to Solving Inverse Problems with Latent Diffusion Models23 Sep 2025
- 2025Learning Latent Variable Models via Jarzynski-adjusted Langevin Algorithm23 May 2025
- 2025Training Latent Diffusion Models with Interacting Particle Algorithms18 May 2025
- 2024Fast Summation of Radial Kernels via QMC Slicing2 Oct 2024
- 2024Fast convergence of the Expectation Maximization algorithm under a logarithmic Sobolev inequality25 Jul 2024
- 2024Kinetic Interacting Particle Langevin Monte Carlo8 Jul 2024
- 2024Particle Semi-Implicit Variational Inference30 Jun 2024
- 2024Proximal Interacting Particle Langevin Algorithms20 Jun 2024
- 2024Error bounds for particle gradient descent, and extensions of the log-Sobolev and Talagrand inequalities4 Mar 2024