Measure Estimation in the Barycentric Coding Model
Matthew Werenski, Ruijie Jiang, Abiy Tasissa, Shuchin Aeron, James M. Murphy
Abstract
This paper considers the problem of measure estimation under the barycentric coding model (BCM), in which an unknown measure is assumed to belong to the set of Wasserstein-2 barycenters of a finite set of known measures. Estimating a measure under this model is equivalent to estimating the unknown barycentric coordinates. We provide novel geometrical, statistical, and computational insights for measure estimation under the BCM, consisting of three main results. Our first main result leverages the Riemannian geometry of Wasserstein-2 space to provide a procedure for recovering the barycentric coordinates as the solution to a quadratic optimization problem assuming access to the true reference measures. The essential geometric insight is that the parameters of this quadratic problem are determined by inner products between the optimal displacement maps from the given measure to the reference measures defining the BCM. Our second main result then establishes an algorithm for solving for the coordinates in the BCM when all the measures are observed empirically via i.i.d. samples. We prove precise rates of convergence for this algorithm -- determined by the smoothness of the underlying measures and their dimensionality -- thereby guaranteeing its statistical consistency. Finally, we demonstrate the utility of the BCM and associated estimation procedures in three application areas: (i) covariance estimation for Gaussian measures; (ii) image processing; and (iii) natural language processing.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 0a95a230-beab-4ebd-8597-bbd6e9071ea6Builds on6
- Faster Wasserstein Distance Estimation with the Sinkhorn DivergenceLénaïc Chizat, Pierre Roussillon, Flavien Léger, François-Xavier Vialard et al.NeurIPS 2020 · 164 citations
- Rates of Estimation of Optimal Transport Maps using Plug-in Estimators via Barycentric ProjectionsNabarun Deb, Promit Ghosal, Bodhisattva SenNeurIPS 2021 · 96 citations
- Averaging on the Bures-Wasserstein manifold: dimension-free convergence of gradient descentJason M. Altschuler, Sinho Chewi, Patrik Gerber, Austin J. StrommeNeurIPS 2021 · 60 citations
- Automatic Text Evaluation through the Lens of Wasserstein BarycentersPierre Colombo, Guillaume Staerman, Chloé Clavel, Pablo PiantanidaEMNLP 2021 · 21 citations
- Dynamical Wasserstein Barycenters for Time-series ModelingKevin C. Cheng, Shuchin Aeron, Michael C. Hughes, Eric L. MillerNeurIPS 2021 · 17 citations
Related papers
- Continuous Wasserstein-2 Barycenter Estimation without Minimax OptimizationAlexander Korotin, Lingxiao Li, Justin Solomon, Evgeny BurnaevICLR 2021 · 58 citations
- Variational inference via Gaussian interacting particles in the Bures-Wasserstein geometryGiacomo Borghi, Jose CarrilloICML 2026 · 2 citations
- Wasserstein Iterative Networks for Barycenter EstimationAlexander Korotin, Vage Egiazarian, Lingxiao Li, Evgeny BurnaevNeurIPS 2022 · 34 citations
- Fast PCA in 1-D Wasserstein Spaces via B-splines Representation and Metric ProjectionMatteo Pegoraro, Mario BerahaAAAI 2021 · 2 citations
- Projection Robust Wasserstein BarycentersMinhui Huang, Shiqian Ma, Lifeng LaiICML 2021 · 14 citations
