Learning to Generate Wasserstein Barycenters
نویسندگان
چکیده
Optimal transport is a notoriously difficult problem to solve numerically, with current approaches often remaining intractable for very large-scale applications such as those encountered in machine learning. Wasserstein barycenters—the of finding measures in-between given input the optimal sense—are even more computationally demanding it requires an optimization involving distances. By training deep convolutional neural network, we improve by factor 80 computational speed barycenters over fastest state-of-the-art approach on GPU, resulting milliseconds times $$512\times 512$$ regular grids. We show that our trained pairs measures, generalizes well than two measures. demonstrate efficiency computing sketches and transferring colors between multiple images.
منابع مشابه
Stochastic Wasserstein Barycenters
We present a stochastic algorithm to compute the barycenter of a set of probability distributions under the Wasserstein metric from optimal transport. Unlike previous approaches, our method extends to continuous input distributions and allows the support of the barycenter to be adjusted in each iteration. We tackle the problem without regularization, allowing us to recover a sharp output whose ...
متن کاملParallel Streaming Wasserstein Barycenters
Efficiently aggregating data from different sources is a challenging problem, particularly when samples from each source are distributed differently. These differences can be inherent to the inference task or present for other reasons: sensors in a sensor network may be placed far apart, affecting their individual measurements. Conversely, it is computationally advantageous to split Bayesian in...
متن کاملFast Computation of Wasserstein Barycenters
We present new algorithms to compute the mean of a set of empirical probability measures under the optimal transport metric. This mean, known as the Wasserstein barycenter, is the measure that minimizes the sum of its Wasserstein distances to each element in that set. We propose two original algorithms to compute Wasserstein barycenters that build upon the subgradient method. A direct implement...
متن کاملBarycenters in the Wasserstein Space
In this paper, we introduce a notion of barycenter in the Wasserstein space which generalizes McCann’s interpolation to the case of more than two measures. We provide existence, uniqueness, characterizations and regularity of the barycenter, and relate it to the multimarginal optimal transport problem considered by Gangbo and Świȩch in [8]. We also consider some examples and in particular rigor...
متن کاملExistence and Consistency of Wasserstein Barycenters
Based on the Fréchet mean, we define a notion of barycenter corresponding to a usual notion of statistical mean. We prove the existence of Wasserstein barycenters of random probabilities defined on a geodesic space (E, d). We also prove the consistency of this barycenter in a general setting, that includes taking barycenters of empirical versions of the probability measures or of a growing set ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Imaging and Vision
سال: 2022
ISSN: ['0924-9907', '1573-7683']
DOI: https://doi.org/10.1007/s10851-022-01121-y