General
Scalable Learning from Probability Measures with Mean Measure Quantization
arXiv stat.ML0 views
arXiv:2502.04907v5 Announce Type: replace 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.
Source:https://arxiv.org/abs/2502.04907PreviousHigh-Dimensional Tail Index RegressionNextA Cherry-Picking Approach to Large Load Shaping for More Effective Carbon Reduction
Related posts
Best Early Black Friday Phone Deals (2026)
0Wired
The "shameful" measles data that lost the US its elimination status
0Ars Technica
Trump admin orders Kalshi to halt wagers on what words Trump will say
0Ars Technica

The leaked Lenovo Legion Go Beam could be the affordable handheld we need
0The Verge
Pikuma: Fundamentals of Computer Science and Mathematics
0Hacker News
Forking TuxGuitar into a 17-EDO tab editor
0Hacker News