Continuous Regularized Wasserstein Barycenters

• URL: http://arxiv.org/abs/2008.12534v2
• Date: Sun, 25 Oct 2020 01:09:18 GMT
• Title: Continuous Regularized Wasserstein Barycenters
• Authors: Lingxiao Li, Aude Genevay, Mikhail Yurochkin, Justin Solomon
• Abstract summary: We introduce a new dual formulation for the regularized Wasserstein barycenter problem. We establish strong duality and use the corresponding primal-dual relationship to parametrize the barycenter implicitly using the dual potentials of regularized transport problems.
• Score: 51.620781112674024
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Wasserstein barycenters provide a geometrically meaningful way to aggregate probability distributions, built on the theory of optimal transport. They are difficult to compute in practice, however, leading previous work to restrict their supports to finite sets of points. Leveraging a new dual formulation for the regularized Wasserstein barycenter problem, we introduce a stochastic algorithm that constructs a continuous approximation of the barycenter. We establish strong duality and use the corresponding primal-dual relationship to parametrize the barycenter implicitly using the dual potentials of regularized transport problems. The resulting problem can be solved with stochastic gradient descent, which yields an efficient online algorithm to approximate the barycenter of continuous distributions given sample access. We demonstrate the effectiveness of our approach and compare against previous work on synthetic examples and real-world applications.

Related papers

• Robust Barycenter Estimation using Semi-Unbalanced Neural Optimal Transport [84.51977664336056]
  We propose a novel, scalable approach for estimating the textitrobust continuous barycenter. Our method is framed as a $min$-$max$ optimization problem and is adaptable to textitgeneral cost function.
  arXiv  Detail & Related papers  (2024-10-04T23:27:33Z)
• Estimating Barycenters of Distributions with Neural Optimal Transport [93.28746685008093]
  We propose a new scalable approach for solving the Wasserstein barycenter problem. Our methodology is based on the recent Neural OT solver. We also establish theoretical error bounds for our proposed approach.
  arXiv  Detail & Related papers  (2024-02-06T09:17:07Z)
• Energy-Guided Continuous Entropic Barycenter Estimation for General Costs [95.33926437521046]
  We propose a novel algorithm for approximating the continuous Entropic OT (EOT) barycenter for arbitrary OT cost functions. Our approach is built upon the dual reformulation of the EOT problem based on weak OT.
  arXiv  Detail & Related papers  (2023-10-02T11:24:36Z)
• Computational Guarantees for Doubly Entropic Wasserstein Barycenters via Damped Sinkhorn Iterations [0.0]
  We propose and analyze an algorithm for computing doubly regularized Wasserstein barycenters. An inexact variant of our algorithm, implementable using approximate Monte Carlo sampling, offers the first non-asymptotic convergence guarantees.
  arXiv  Detail & Related papers  (2023-07-25T09:42:31Z)
• Variational Wasserstein Barycenters with c-Cyclical Monotonicity [17.26436842450489]
  We develop a novel continuous approximation method for the Wasserstein barycenters problem given sample access to the input distributions. We provide theoretical analysis on convergence and demonstrate the practical effectiveness of our method on real applications of posterior aggregation and synthetic data.
  arXiv  Detail & Related papers  (2021-10-22T11:06:50Z)
• Streaming computation of optimal weak transport barycenters [13.664682865991255]
  We provide a theoretical analysis of the weak barycenter and its relationship to the classic Wasserstein barycenter. We provide iterative algorithms to compute a weak barycenter for either finite or infinite families of arbitrary measures.
  arXiv  Detail & Related papers  (2021-02-26T10:08:02Z)
• Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization [94.18714844247766]
  Wasserstein barycenters provide a geometric notion of the weighted average of probability measures based on optimal transport. We present a scalable algorithm to compute Wasserstein-2 barycenters given sample access to the input measures.
  arXiv  Detail & Related papers  (2021-02-02T21:01:13Z)
• Scalable Computations of Wasserstein Barycenter via Input Convex Neural Networks [15.171726731041055]
  Wasserstein Barycenter is a principled approach to represent the weighted mean of a given set of probability distributions. We present a novel scalable algorithm to approximate the Wasserstein Barycenters aiming at high-dimensional applications in machine learning.
  arXiv  Detail & Related papers  (2020-07-08T22:41:18Z)
• Distributed Averaging Methods for Randomized Second Order Optimization [54.51566432934556]
  We consider distributed optimization problems where forming the Hessian is computationally challenging and communication is a bottleneck. We develop unbiased parameter averaging methods for randomized second order optimization that employ sampling and sketching of the Hessian. We also extend the framework of second order averaging methods to introduce an unbiased distributed optimization framework for heterogeneous computing systems.
  arXiv  Detail & Related papers  (2020-02-16T09:01:18Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.