mlsanityData to 7 Oct 2026

Quantitative Convergence of Wasserstein Gradient Flows of Kernel Mean Discrepancies

arXiv 2603.01977 ↗First posted 2 Mar 2026math.AP cs.LG math.OCcited by 8

Not on the map. Why?

Abstract (arXiv)

We study the quantitative convergence of Wasserstein gradient flows of Kernel Mean Discrepancy (KMD) (also known as Maximum Mean Discrepancy (MMD)) functionals. Our setting covers in particular the training dynamics of shallow neural networks in the infinite-width and continuous time limit, as well as interacting particle systems with pairwise Riesz kernel interaction in the mean-field and overdamped limit. Our main analysis concerns the model case of KMD functionals given by the squared Sobolev distance mathscrEnus(μ)= frac12lVert μ-nurVert_dot H-s2 for any s≥ 1 and nu a fixed probability measure on the d-dimensional torus. First, inspired by Yudovich theory for the 2d-Euler equation, we establish existence and uniqueness in natural weak regularity classes. Next, we show that for s=1 the flow converges globally at an exponential rate under minimal assumptions, while for s>1 we prove local convergence at polynomial rates that depend explicitly on s and on the Sobolev regularity of μ and nu. These rates hold both at the energy level and in higher regularity classes and are tight for nu uniform. We then consider the gradient flow of the population loss for shallow neural networks with ReLU activation, which can be cast as a Wasserstein--Fisher--Rao gradient flow on the space of nonnegative measures on the sphere mathbbSd. Exploiting a correspondence with the Sobolev energy case with s=(d+3)/2, we derive an explicit polynomial local convergence rate for this dynamics. Except for the special case s=1, even non-quantitative convergence was previously open in all these settings. We also include numerical experiments in dimension d=1 using both PDE and particle methods which illustrate our analysis.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 2 Mar 2026.

Builds on

0 of 0 references.

No references here yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 8.

8 papers.