The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance
Open accessAbstract
The Wasserstein distance between two probability measures on a metric space is a measure of closeness with applications in statistics, probability, and machine learning. In this work, we consider the fundamental question of how quickly the empirical measure obtained from $n$ independent samples from $\mu$ approaches $\mu$ in the Wasserstein distance of any order. We prove sharp asymptotic and finite-sample results for this rate of convergence for general measures on general compact metric spaces. Our finite-sample results show the existence of multi-scale behavior, where measures can exhibit radically different rates of convergence as $n$ grows.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
Fractal Geometry: Mathematical Foundations and Applications.
Falconer, K. (1990) · Biometrics · doi:10.2307/2532125 · Cited by 5,823
The Earth Mover's Distance as a Metric for Image Retrieval
Rubner, Y., Tomasi, C., & Guibas, L. J. (2000) · International Journal of Computer Vision · doi:10.1023/a:1026543900054 · Cited by 4,568
Villani, C. (2009) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-540-71050-9 · Cited by 3,669
Adaptive Control Processes: A Guided Tour
Bellman, R. E. (1961) · doi:10.1515/9781400874668 · Cited by 2,802
Sinkhorn Distances: Lightspeed Computation of Optimal TransportPreprint
Cuturi, M. (2013) · Cited by 2,385
Adaptive Control Processes: A Guided Tour.
Page, E. S., & Bellman, R. (1962) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2343225 · Cited by 2,185
Fractal Geometry: Mathematical Foundations and Applications
Falconer, K. (2003) · Wiley eBooks · doi:10.1002/0470013850 · Cited by 1,740
The Concentration of Measure Phenomenon
Ledoux, M. (2005) · Mathematical Surveys and Monographs · doi:10.1090/surv/089 · Cited by 1,700
From Word Embeddings To Document Distances
Kusner, M. J., Sun, Y., Kolkin, N., & Weinberger, K. Q. (2015) · PolyPublie (École Polytechnique de Montréal) · Cited by 1,695
Optimal Transport for Applied Mathematicians: Calculus of Variations, PDEs, and Modeling
Santambrogio, F. (2015) · Progress in Nonlinear Differential Equations and Their Applications · doi:10.1007/978-3-319-20828-2 · Cited by 1,339
Adaptive estimation of a quadratic functional by model selection
Laurent, B., & Massart, P. (2000) · The Annals of Statistics · doi:10.1214/aos/1015957395 · Cited by 995
Concentration of measure and isoperimetric inequalities in product spaces
Talagrand, M. (1995) · Publications Mathématiques de l'IHÉS · doi:10.1007/bf02699376 · Cited by 829
On the Translocation of Masses
Kantorovich, L. V. (2006) · Journal of Mathematical Sciences · doi:10.1007/s10958-006-0049-2 · Cited by 744
Dimension, entropy and Lyapunov exponents
Young, L.-S. (1982) · Ergodic Theory and Dynamical Systems · doi:10.1017/s0143385700009615 · Cited by 633
Image Processing and Data Analysis: The Multiscale Approach
Starck, J.-L., Murtagh, F. D., & Bijaoui, A. (1998) · Cambridge University Press eBooks · doi:10.1017/cbo9780511564352 · Cited by 538
Introduction to Rare Event Simulation
Bucklew, J. A. (2004) · Springer Series in Statistics · doi:10.1007/978-1-4757-4078-3 · Cited by 518
Convolutional wasserstein distances: efficient optimal transportation on geometric domains
Solomon, J., de Goes, F., Peyré, G., Cuturi, M., Butscher, A., Nguyen, A., Du, T., & Guibas, L. (2015) · ACM Transactions on Graphics · doi:10.1145/2766963 · Cited by 481
Deterministic and Stochastic Error Bounds in Numerical Analysis
Novak, E. (1988) · Lecture Notes in Mathematics · doi:10.1007/bfb0079792 · Cited by 361
The Speed of Mean Glivenko-Cantelli Convergence
Dudley, R. M. (1969) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177697802 · Cited by 253
Quantitative Concentration Inequalities for Empirical Measures on Non-compact Spaces
Bolley, F., Guillin, A., & Villani, C. (2007) · Probability Theory and Related Fields · doi:10.1007/s00440-006-0004-7 · Cited by 248
Convergence de la répartition empirique vers la répartition théorique
Fortet, R., & Mourier, E. (1953) · Annales scientifiques de l'École normale supérieure · doi:10.24033/asens.1013 · Cited by 188
Convergence of Entropic Schemes for Optimal Transport and Gradient Flows
Carlier, G., Duval, V., Gabriel Peyré, A., & Schmitzer, B. (2017) · SIAM Journal on Mathematical Analysis · doi:10.1137/15m1050264 · Cited by 171
Some relations between dimension and Lyapounov exponents
Ledrappier, F. (1981) · Communications in Mathematical Physics · doi:10.1007/bf01208896 · Cited by 163
Nonnegative Matrix Factorization with Earth Mover's Distance Metric for Image Analysis
Sandler, R., & Lindenbaum, M. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.18 · Cited by 153
A review of learning vector quantization classifiers
Nova, D., & Estévez, P. A. (2013) · Neural Computing and Applications · doi:10.1007/s00521-013-1535-3 · Cited by 142
Asymptotics for transportation cost in high dimensions
Dobrić, V., & Yukich, J. E. (1995) · Journal of Theoretical Probability · doi:10.1007/bf02213456 · Cited by 94
Long History of the Monge-Kantorovich Transportation Problem
Вершик, А. М. (2013) · The Mathematical Intelligencer · doi:10.1007/s00283-013-9380-x · Cited by 93
FréChet-Bounds and Their Applications
Rüschendorf, L. (1991) · Springer eBooks · doi:10.1007/978-94-011-3466-8_9 · Cited by 74
Multiscale geometric methods for data sets I: Multiscale SVD, noise and curvature
Little, A. V., Maggioni, M., & Rosasco, L. (2016) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2015.09.009 · Cited by 67
Simple Bounds for the Convergence of Empirical and Occupation Measures in 1-Wasserstein Distance
Boissard, E. (2011) · Electronic Journal of Probability · doi:10.1214/ejp.v16-958 · Cited by 63
The multiscale structure of non-differentiable image manifolds
Wakin, M. B., Donoho, D. L., Choi, H., & Baraniuk, R. G. (2005) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.617822 · Cited by 59
Sublinear Time Algorithms for Earth Mover’s Distance
Ba, K. D., Nguyễn, H. L., Nguyen, H. N., et al. (2010) · Theory of Computing Systems · doi:10.1007/s00224-010-9265-8 · Cited by 34
Building Earth Mover's Distance on Bilingual Word Embeddings for Machine Translation
Zhang, M., Liu, Y., Luan, H., Sun, M., Izuha, T., & Hao, J. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10351 · Cited by 31
Cited by
Computational Optimal Transport
Peyré, G., & Cuturi, M. (2019) · now publishers, Inc. eBooks · doi:10.1561/9781680835519 · Cited by 847
The Born supremacy: quantum advantage and training of an Ising Born machine
Coyle, B., Mills, D., Danos, V., & Kashefi, E. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00288-9 · Cited by 155
Metadata
- Authors
- Weed, J., & Bach, F.
- Venue
- Bernoulli
- Published
- 2019-11-01
- Volume
- 25
- Issue
- 4A
- Pages
- 2620-2648
- ISSN
- 1350-7265 (ISSN-L)
- OpenAlex
- W2727413762
- Cited by
- 275
- References
- 35
- FWCI
- 47.94
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.