Dimensionality Reduction for Wasserstein Barycenter
Zachary Izzo, Sandeep Silwal, Samson Zhou

TL;DR
This paper introduces a dimensionality reduction approach for Wasserstein barycenters that preserves solution quality while significantly reducing computational complexity, addressing the curse of dimensionality in high-dimensional probability distribution analysis.
Contribution
The paper develops randomized dimensionality reduction techniques for Wasserstein barycenters, providing optimal bounds and a coreset construction to improve efficiency and scalability.
Findings
Dimensionality reduction preserves barycenter cost with small error.
Methods are optimal up to constant factors.
Experimental results show significant speedup with maintained accuracy.
Abstract
The Wasserstein barycenter is a geometric construct which captures the notion of centrality among probability distributions, and which has found many applications in machine learning. However, most algorithms for finding even an approximate barycenter suffer an exponential dependence on the dimension of the underlying space of the distributions. In order to cope with this "curse of dimensionality," we study dimensionality reduction techniques for the Wasserstein barycenter problem. When the barycenter is restricted to support of size , we show that randomized dimensionality reduction can be used to map the problem to a space of dimension independent of both and , and that \emph{any} solution found in the reduced dimension will have its cost preserved up to arbitrary small error in the original space. We provide matching upper and lower bounds on the size of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsTopological and Geometric Data Analysis · Geometric Analysis and Curvature Flows · Point processes and geometric inequalities
MethodsCoresets
