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
Australia's full national topographic library at your fingertips
0Hacker News
Codeberg seems to have vanished from DNS
0Hacker News New
Codeberg.org Is Down
0Hacker News New
Torrent Infra Needs to Modernize Immediately for Open Models to Survive
0Hacker News New
What if we tried to eat the sun? [video]
0Hacker News New
My Dog Ate a Kitchen Sponge – What to Do Now (Call Your Vet) – PetToxCheck
0Hacker News New