2025/05/27 by Zonghao Chen, Chen, Zonghao, Toni Karvonen +7 · 1 citation
Engineering · #Human Motion and Animation #Advanced Numerical Analysis Techniques #Manufacturing Process and Optimization
paper · pdf · doi:10.48550/arxiv.2505.20754
Approximation of a target probability distribution using a finite set of points is a problem of fundamental importance in numerical integration. Several authors have proposed to select points by minimising a maximum mean discrepancy (MMD), but the non-convexity of this objective typically precludes global minimisation. Instead, we consider the concept of stationary points of the MMD which, in contrast to points globally minimising the MMD, can be accurately computed. Our main contributions are two-fold and theoretical in nature. We first prove the (perhaps surprising) result that, for integrands in the associated reproducing kernel Hilbert space, the numerical integration error of stationary MMD points vanishes faster than the MMD. Motivated by this super-convergence property, we consider MMD gradient flows as a practical strategy for computing stationary points of the MMD. We then prove that MMD gradient flow can indeed compute stationary MMD points, based on a refined convergence analysis that establishes a novel non-asymptotic finite-particle error bound.