mlsanityData to 7 Oct 2026

A Class of Dimension-free Metrics for the Convergence of Empirical Measures

arXiv 2104.12036 ↗First posted 24 Apr 2021math.PR cs.LG stat.MLcited by 5

Not on the map. Why?

Abstract (arXiv)

This paper concerns the convergence of empirical measures in high dimensions. We propose a new class of probability metrics and show that under such metrics, the convergence is free of the curse of dimensionality (CoD). Such a feature is critical for high-dimensional analysis and stands in contrast to classical metrics (it e.g., the Wasserstein metric). The proposed metrics fall into the category of integral probability metrics, for which we specify criteria of test function spaces to guarantee the property of being free of CoD. Examples of the selected test function spaces include the reproducing kernel Hilbert spaces, Barron space, and flow-induced function spaces. Three applications of the proposed metrics are presented: 1. The convergence of empirical measure in the case of random variables; 2. The convergence of n-particle system to the solution to McKean-Vlasov stochastic differential equation; 3. The construction of an varepsilon-Nash equilibrium for a homogeneous n-player game by its mean-field limit. As a byproduct, we prove that, given a distribution close to the target distribution measured by our metric and a certain representation of the target distribution, we can generate a distribution close to the target one in terms of the Wasserstein metric and relative entropy. Overall, we show that the proposed class of metrics is a powerful tool to analyze the convergence of empirical measures in high dimensions without CoD.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 14 of its 77 references that are in the map. First posted on arXiv 24 Apr 2021.

Builds on

14 of 77 references.

References · 14

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2018Large Scale GAN Training for High Fidelity Natural Image Synthesiscited by 2,609
  3. 2018A Mean Field View of the Landscape of Two-Layers Neural Networkscited by 463
  4. 2018On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transportcited by 422
  5. 2019Large Scale Adversarial Representation Learningcited by 238
  6. 2018A Priori Estimates of the Population Risk for Two-layer Neural Networkscited by 76
  7. 2020On the Banach spaces associated with multi-layer ReLU networks: Function representation, approximation theory and gradient descent dynamicscited by 39
  8. 2016Risk Bounds for High-dimensional Ridge Function Combinations Including Neural Networkscited by 26
  9. 2020Kolmogorov Width Decay and Poor Approximators in Machine Learning: Shallow Neural Networks, Random Feature Models and Neural Tangent Kernelscited by 19
  10. 2019Deep Fictitious Play for Finding Markovian Nash Equilibrium in Multi-Agent Gamescited by 16
  11. 2019Deep Fictitious Play for Stochastic Differential Gamescited by 13
  12. 2020Convergence of Deep Fictitious Play for Stochastic Differential Gamescited by 10
2 more
  1. 2020Generalization and Memorization: The Bias Potential Modelcited by 9
  2. 2020Optimal Policies for a Pandemic: A Stochastic Game Approach and a Deep Learning Algorithmcited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 2; 2024: 0; 2025: 0; 2026: 2.

5 papers.