mlsanityData to 14 Oct 2026

Scalable Bayes via Barycenter in Wasserstein Space

arXiv 1508.05880 ↗First posted 24 Aug 2015stat.MEcited by 44

Not on the map. Why?

Abstract (arXiv)

Divide-and-conquer based methods for Bayesian inference provide a general approach for tractable posterior inference when the sample size is large. These methods divide the data into smaller subsets, sample from the posterior distribution of parameters in parallel on all the subsets, and combine posterior samples from all the subsets to approximate the full data posterior distribution. The smaller size of any subset compared to the full data implies that posterior sampling on any subset is computationally more efficient than sampling from the true posterior distribution. Since the combination step takes negligible time relative to sampling, posterior computations can be scaled to massive data by dividing the full data into a sufficiently large number of data subsets. One such approach relies on the geometry of posterior distributions estimated across different subsets and combines them through their barycenter in a Wasserstein space of probability measures. We provide theoretical guarantees on the accuracy of approximation that are valid in many applications. We show that the geometric method approximates the full data posterior distribution better than its competitors across diverse simulations and reproduces known results when applied to a movie ratings database.

Key facts. Cited by 44 papers in the map (data through 14 Oct 2026). First posted on arXiv 24 Aug 2015.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 10; 2022: 8; 2023: 10; 2024: 4; 2025: 10; 2026: 2.

44 papers.

Sort:

  1. 2021Rates of Estimation of Optimal Transport Maps using Plug-in Estimators via Barycentric Projectionscited by 53
  2. 2021Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimizationcited by 51
  3. 2021Averaging on the Bures-Wasserstein manifold: dimension-free convergence of gradient descentcited by 32
  4. 2021Wasserstein barycenters are NP-hard to computecited by 28
  5. 2021On Robust Optimal Transport: Computational Complexity and Barycenter Computationcited by 27
  6. 2022Wasserstein Iterative Networks for Barycenter Estimationcited by 23
  7. 2022The Multimarginal Optimal Transport Formulation of Adversarial Multiclass Classificationcited by 21
  8. 2023Tree-Based Diffusion Schr"odinger Bridge with Applications to Wasserstein Barycenterscited by 16
  9. 2022Wasserstein Barycenter-based Model Fusion and Linear Mode Connectivity of Neural Networkscited by 15
  10. 2024Estimating Barycenters of Distributions with Neural Optimal Transportcited by 14
  11. 2021Dimensionality Reduction for Wasserstein Barycentercited by 13
  12. 2023Energy-Guided Continuous Entropic Barycenter Estimation for General Costscited by 12
32 more
  1. 2023Doubly Regularized Entropic Wasserstein Barycenterscited by 10
  2. 2022Many processors, little time: MCMC for partitions via optimal transport couplingscited by 6
  3. 2022SwISS: A Scalable Markov chain Monte Carlo Divide-and-Conquer Strategycited by 6
  4. 2021Sliced Multi-Marginal Optimal Transportcited by 5
  5. 2021Sampling From the Wasserstein Barycentercited by 5
  6. 2023Generating Synthetic Datasets by Interpolating along Generalized Geodesicscited by 5
  7. 2023Wasserstein Geodesic Generator for Conditional Distributionscited by 5
  8. 2023Federated Variational Inference Methods for Structured Latent Variable Modelscited by 4
  9. 2023Machine Learning and the Future of Bayesian Computationcited by 4
  10. 2022Wasserstein Distributionally Robust Optimization with Wasserstein Barycenterscited by 3
  11. 2024Approximate Algorithms For k-Sparse Wasserstein Barycenter With Outlierscited by 3
  12. 2021Asynchronous and Distributed Data Augmentation for Massive Data Settingscited by 2
  13. 2025Sobolev Gradient Ascent for Optimal Transport: Barycenter Optimization and Convergence Analysiscited by 2
  14. 2025Neural Estimation for Scaling Entropic Multimarginal Optimal Transportcited by 2
  15. 2025Schr"odinger Bridge Matching for Tree-Structured Costs and Entropic Wasserstein Barycentrescited by 2
  16. 2022Stability of Entropic Wasserstein Barycenters and application to random geometric graphscited by 1
  17. 2023Improved learning theory for kernel distribution regression with two-stage samplingcited by 1
  18. 2025Robust and Scalable Variational Bayescited by 1
  19. 2025Personalized Bayesian Federated Learning with Wasserstein Barycenter Aggregationcited by 1
  20. 2025Wasserstein Gradient Flows for Scalable and Regularized Barycenter Computationcited by 1
  21. 2026Vertical Consensus Inference for High-Dimensional Random Partitioncited by 1
  22. 2021Divide-and-conquer methods for big data analysiscited by 0
  23. 2022Approximative Algorithms for Multi-Marginal Optimal Transport and Free-Support Wasserstein Barycenterscited by 0
  24. 2023An Asynchronous Decentralized Algorithm for Wasserstein Barycenter Problemcited by 0
  25. 2023Bayesian Analysis for Over-parameterized Linear Model via Effective Spectracited by 0
  26. 2024Scaling up Dynamic Edge Partition Models via Stochastic Gradient MCMCcited by 0
  27. 2024Deep Generalized Schr"odinger Bridges: From Image Generation to Solving Mean-Field Gamescited by 0
  28. 2025Measuring the right thing: justifying metrics in AI impact assessmentscited by 0
  29. 2025Streaming Sliced Optimal Transportcited by 0
  30. 2025A Particle-Flow Algorithm for Free-Support Wasserstein Barycenterscited by 0
  31. 2025Robust Variational Bayes by Min-Max Median Aggregationcited by 0
  32. 2026Neural composite likelihood estimation: simulation based inference for time seriescited by 0