Statistics > Machine Learning
Title:Scalable Learning from Probability Measures with Mean Measure Quantization
Abstract:We consider statistical learning problems in which data are observed as a set of probability measures. Optimal transport (OT) is a popular tool to compare and manipulate such objects, but its computational cost becomes prohibitive when the measures have large support. We study a quantization-based approach in which all input measures are approximated by $K$-point discrete measures sharing a common support. We establish consistency of the resulting quantized measures. We further derive convergence guarantees for several OT-based downstream tasks computed from the quantized measures. Numerical experiments on synthetic and real datasets demonstrate that the proposed approach achieves performance comparable to individual quantization while substantially reducing runtime.
| Subjects: | Machine Learning (stat.ML) ; Machine Learning (cs.LG) |
|---|---|
| Cite as: | arXiv:2502.04907 [stat.ML] |
| (or arXiv:2502.04907v5 [stat.ML] for this version) | |
| https://doi.org/10.48550/arXiv.2502.04907 arXiv-issued DOI via DataCite | |
| Journal reference: | Transactions on Machine Learning Research, 2026 |
Submission history
Access Paper:
- HTML (experimental)
Current browse context:
References & Citations
- Google Scholar
- Semantic Scholar
BibTeX formatted citation
Bookmark
Bibliographic and Citation Tools
Code, Data and Media Associated with this Article
Demos
Recommenders and Search Tools
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.