aiqbench analysis
This paper is theoretical machine learning work on overparameterisation. It shows that with enough weighted particles, the MMD optimisation landscape for a one-dimensional Gaussian kernel has no bad local minima, and that bad stationary points are unstable under gradient flow. The guarantees are proven for finite particle counts and cover both simplex-constrained and unconstrained weights. Readers should note that the results concern a specific kernel and dimension, so they are not yet a general account of training dynamics in deep networks.
On the Optimisation Landscape of Overparameterised Weighted MMD
arXiv:2610.19861v1 Announce Type: cross Abstract: We study the optimisation landscape of the maximum mean discrepancy (MMD) over weighted atomic measures. For the one-dimensional Gaussian kernel, we show that, for any compactly supported target distribution, sufficiently many particles ensure that every local minimum has arbitrarily small MMD. Moreover, any stationary point whose MMD remains bounded away from zero is unstable under an unweighted gradient flow over the particle locations. These results hold both when the weights are constrained to the simplex, and when they are unconstrained but optimised at each step. When the target is itself finitely supported, we further strengthen this result: beyond an explicit particle threshold, there are no spurious local minima, and every spurious stationary point is unstable. To our knowledge, these are the first finite-particle overparameterisation guarantees of their kind for weighted MMD optimisation.
Abstract:We study the optimisation landscape of the maximum mean discrepancy (MMD) over weighted atomic measures. For the one-dimensional Gaussian kernel, we show that, for any compactly supported target distribution, sufficiently many particles ensure that every local minimum has arbitrarily small MMD. Moreover, any stationary point whose MMD remains bounded away from zero is unstable under an unweighted gradient flow over the particle locations. These results hold both when the weights are constrained to the simplex, and when they are unconstrained but optimised at each step. When the target is itself finitely supported, we further strengthen this result: beyond an explicit particle threshold, there are no spurious local minima, and every spurious stationary point is unstable. To our knowledge, these are the first finite-particle overparameterisation guarantees of their kind for weighted MMD optimisation.
Machine Learning (stat.ML); Machine Learning (cs.LG); Optimization and Control (math.OC)
arXiv:2610.19861 [stat.ML]
(or arXiv:2610.19861v1 [stat.ML] for this version)
https://doi.org/10.48550/arXiv.2610.19861 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 233 words
Related coverage

New Quantum Simulations Respect Fundamental Symmetries with Remarkable Precision
Quantum Zeitgeist · Jun 11, 2026

Braida and Colleagues Models Log-Concavity Framework for Discrete Schrödinger Operators
Quantum Zeitgeist · Jul 15, 2026
Mycelial Search: A Graph-Structured Metaheuristic for Continuous Optimisation
arXiv · Aug 25, 2026

Edward Farhi, The Physicist Behind QAOA
Quantum Zeitgeist · Aug 30, 2026