mlsanityData to 7 Oct 2026

Doubly Regularized Entropic Wasserstein Barycenters

arXiv 2303.11844 ↗First posted 21 Mar 2023math.OC cs.LG stat.MLcited by 10

Not on the map. Why?

Abstract (arXiv)

We study a general formulation of regularized Wasserstein barycenters that enjoys favorable regularity, approximation, stability and (grid-free) optimization properties. This barycenter is defined as the unique probability measure that minimizes the sum of entropic optimal transport (EOT) costs with respect to a family of given probability measures, plus an entropy term. We denote it (λ,τ)-barycenter, where λ is the inner regularization strength and τ the outer one. This formulation recovers several previously proposed EOT barycenters for various choices of λ,τ ≥ 0 and generalizes them. First, in spite of -- and in fact owing to -- being doubly regularized, we show that our formulation is debiased for τ=λ/2: the suboptimality in the (unregularized) Wasserstein barycenter objective is, for smooth densities, of the order of the strength λ2 of entropic regularization, instead of maxλ,τ in general. We discuss this phenomenon for isotropic Gaussians where all (λ,τ)-barycenters have closed form. Second, we show that for λ,τ>0, this barycenter has a smooth density and is strongly stable under perturbation of the marginals. In particular, it can be estimated efficiently: given n samples from each of the probability measures, it converges in relative entropy to the population barycenter at a rate n-1/2. And finally, this formulation lends itself naturally to a grid-free optimization algorithm: we propose a simple noisy particle gradient descent which, in the mean-field limit, converges globally at an exponential rate to the barycenter.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 42 of its 94 references that are in the map. First posted on arXiv 21 Mar 2023.

Builds on

42 of 94 references.

References · 42

  1. 2021Convex optimizationcited by 2,479
  2. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  3. 2018Computational Optimal Transportcited by 765
  4. 2018A Mean Field View of the Landscape of Two-Layers Neural Networkscited by 463
  5. 2017Learning Generative Models with Sinkhorn Divergencescited by 310
  6. 2013Fast Computation of Wasserstein Barycenterscited by 216
  7. 2018Statistical Aspects of Wasserstein Distancescited by 202
  8. 2015On Wasserstein Two Sample Testing and Related Families of Nonparametric Testscited by 165
  9. 2014On the relation between optimal transport and Schr"odinger bridges: A stochastic control viewpointcited by 99
  10. 2020Faster Wasserstein Distance Estimation with the Sinkhorn Divergencecited by 73
  11. 2022Mean-Field Langevin Dynamics: Exponential Convergence and Annealingcited by 60
  12. 2022Convex Analysis of the Mean Field Langevin Dynamicscited by 53
30 more
  1. 2021Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimizationcited by 50
  2. 2019Mean-Field Langevin Dynamics and Energy Landscape of Neural Networkscited by 49
  3. 2020Scalable Computations of Wasserstein Barycenter via Input Convex Neural Networkscited by 49
  4. 2015Scalable Bayes via Barycenter in Wasserstein Spacecited by 44
  5. 2019An Optimal Transport approach for the Schr"odinger bridge problem and convergence of Sinkhorn algorithmcited by 38
  6. 2020Debiased Sinkhorn barycenterscited by 34
  7. 2020Entropy-Regularized 2-Wasserstein Distance between Gaussian Measurescited by 32
  8. 2020Continuous Regularized Wasserstein Barycenterscited by 32
  9. 2021Wasserstein barycenters are NP-hard to computecited by 28
  10. 2019Analysis of a Two-Layer Neural Network via Displacement Convexitycited by 27
  11. 2019Sinkhorn Barycenters with Free Support via Frank-Wolfe Algorithmcited by 27
  12. 2018Semi-dual Regularized Optimal Transportcited by 26
  13. 2018Stochastic Wasserstein Barycenterscited by 25
  14. 2020Wasserstein barycenters can be computed in polynomial time in fixed dimensioncited by 23
  15. 2018Decentralize and Randomize: Faster Algorithm for Wasserstein Barycenterscited by 21
  16. 2020Particle Dual Averaging: Optimization of Mean Field Neural Networks with Global Convergence Rate Analysiscited by 21
  17. 2015Discrete Wasserstein Barycenters: Optimal Transport for Discrete Datacited by 20
  18. 2020Estimating Barycenters of Measures in High Dimensionscited by 18
  19. 2017Parallel Streaming Wasserstein Barycenterscited by 14
  20. 2020The statistical effect of entropic regularization in optimal transportationcited by 14
  21. 2022Displacement smoothness of entropic optimal transportcited by 13
  22. 2018Bayesian Learning with Wasserstein Barycenterscited by 12
  23. 2019Interior-Point Methods Strike Back: Solving the Wasserstein Barycenter Problemcited by 9
  24. 2020Stochastic Optimization for Regularized Wasserstein Estimatorscited by 9
  25. 2018Data-driven regularization of Wasserstein barycenters with an application to multivariate density registrationcited by 8
  26. 2020Randomised Wasserstein Barycenter Computation: Resampling with Statistical Guaranteescited by 8
  27. 2021Sampling From the Wasserstein Barycentercited by 5
  28. 2021Kantorovich-Rubinstein distance and barycenter for finitely supported measures: Foundations and Algorithmscited by 4
  29. 2022Quantitative Stability of Barycenters in the Wasserstein Spacecited by 3
  30. 2022Stability of Entropic Wasserstein Barycenters and application to random geometric graphscited by 1

Built on by

Cited by year

Citing papers per year: 2023: 3; 2024: 3; 2025: 4.

10 papers.