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
House Democrats Are Officially Coming for Trump’s Orbit
0Wired
Best Smart Bed of 2026: Bryte and Tempur-Pedic
0Wired
Codeberg.org Not Reachable
0Hacker News
Value and Policy Calibration from Execution Feedback for Socially Compatible Driving
0arXiv cs.RO
Men are more politically open-minded than women
0Hacker News New
What's Left of Europe's Technological Sovereignty
0Hacker News New