English

Mirror Mean-Field Langevin Dynamics

Machine Learning 2026-05-19 v2 Optimization and Control Machine Learning

Abstract

The mean-field Langevin dynamics (MFLD) minimizes an entropy-regularized nonlinear convex functional on the Wasserstein space over Rd\mathbb{R}^d, and has gained attention recently as a model for the gradient descent dynamics of interacting particle systems such as infinite-width two-layer neural networks. However, many problems of interest have constrained domains, which are not solved by existing mean-field algorithms due to the global diffusion term. We study the optimization of probability measures constrained to a convex subset of Rd\mathbb{R}^d by proposing the \emph{mirror mean-field Langevin dynamics} (MMFLD), an extension of MFLD to the mirror Langevin framework. We obtain linear convergence guarantees for the continuous MMFLD via a uniform log-Sobolev inequality, and uniform-in-time propagation of chaos results for its time- and particle-discretized counterpart.

Keywords

Cite

@article{arxiv.2505.02621,
  title  = {Mirror Mean-Field Langevin Dynamics},
  author = {Anming Gu and Juno Kim},
  journal= {arXiv preprint arXiv:2505.02621},
  year   = {2026}
}

Comments

ICML 2026

R2 v1 2026-06-28T23:21:27.213Z