Mathematics > Probability
[Submitted on 4 Aug 2025
]
Title: Optimality of empirical measures as quantizers
Title: 经验测度作为量化器的最优性
Abstract: A common way to discretize a probability measure is to use an empirical measure as a discrete approximation. But how far from being optimal is this approximation in the p-Wasserstein distance? In this paper, we study this question in two contexts: (1) optimality among all uniform quantizers and (2) optimality among all (non-uniform) quantizers. In the first context, for p=1, we provide a complete answer to this question up to a polylog(n) factor. From the probabilistic point of view, this resolves, up to a polylog(n) factor, the problem of characterizing the expected 1-Wasserstein distance between a probability measure and its empirical measure in terms of non-random quantities. We also obtain some partial results for p>1 in the first context and for p>=1 in the second context.
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender
(What is IArxiv?)
arXivLabs: experimental projects with community collaborators
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.