Measure Estimation in the Barycentric Coding Model
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 18 of its 55 references that are in the map. First posted on arXiv 28 Jan 2022.
Builds on
18 of 55 references.
References · 18
- 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,462
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2018Computational Optimal Transportcited by 765
- 2013Fast Computation of Wasserstein Barycenterscited by 216
- 2021Entropic estimation of optimal transport mapscited by 87
- 2020Faster Wasserstein Distance Estimation with the Sinkhorn Divergencecited by 73
- 2018Optimal Transport for Multi-source Domain Adaptation under Target Shiftcited by 67
- 2021Plugin Estimation of Smooth Optimal Transport Mapscited by 67
- 2021Rates of Estimation of Optimal Transport Maps using Plug-in Estimators via Barycentric Projectionscited by 52
- 2021Automatic Text Evaluation through the Lens of Wasserstein Barycenterscited by 38
- 2017Wasserstein Dictionary Learning: Optimal Transport-based unsupervised non-linear dictionary learningcited by 34
- 2021Averaging on the Bures-Wasserstein manifold: dimension-free convergence of gradient descentcited by 32
6 more
- 2018Stochastic Wasserstein Barycenterscited by 25
- 2018Distilled Wasserstein Learning for Word Embedding and Topic Modelingcited by 18
- 2021Near-optimal estimation of smooth transport maps with kernel sums-of-squarescited by 12
- 2018Context Mover's Distance & Barycenters: Optimal Transport of Contexts for Building Representationscited by 11
- 2021Dynamical Wasserstein Barycenters for Time-series Modelingcited by 10
- 2018A Fast Globally Linearly Convergent Algorithm for the Computation of Wasserstein Barycenterscited by 8
Built on by
Citing papers per year: 2022: 3; 2023: 2; 2024: 2; 2025: 1; 2026: 1.
9 papers.
- 2023Algorithms for mean-field variational inference via polyhedral optimization in the Wasserstein spacecited by 20
- 2022Acceptability Judgements via Examining the Topology of Attention Mapscited by 19
- 2023Linearized Wasserstein dimensionality reduction with approximation guaranteescited by 12
- 2022Tangential Wasserstein Projectionscited by 4
- 2022Geometric Sparse Coding in Wasserstein Spacecited by 3
- 2024Linearized Wasserstein Barycenters: Synthesis, Analysis, Representational Capacity, and Applicationscited by 1
- 2024Locality Regularized Reconstruction: Structured Sparsity and Delaunay Triangulationscited by 0
- 2025A primer on optimal transport for causal inference with observational datacited by 0
- 2026Static and Dynamic Approaches to Computing Barycenters of Probability Measures on Graphscited by 0
- 2026Static and Dynamic Approaches to Computing Barycenters of Probability Measures on Graphs27 Mar 2026
- 2025A primer on optimal transport for causal inference with observational data10 Mar 2025
- 2024Linearized Wasserstein Barycenters: Synthesis, Analysis, Representational Capacity, and Applications31 Oct 2024
- 2024Locality Regularized Reconstruction: Structured Sparsity and Delaunay Triangulations1 May 2024
- 2023Algorithms for mean-field variational inference via polyhedral optimization in the Wasserstein space5 Dec 2023
- 2023Linearized Wasserstein dimensionality reduction with approximation guarantees14 Feb 2023
- 2022Geometric Sparse Coding in Wasserstein Space21 Oct 2022
- 2022Tangential Wasserstein Projections29 Jul 2022
- 2022Acceptability Judgements via Examining the Topology of Attention Maps19 May 2022