Our new X account is live! Follow @wizwand_team for updates
WorkDL logo mark

Wasserstein Iterative Networks for Barycenter Estimation

About

Wasserstein barycenters have become popular due to their ability to represent the average of probability measures in a geometrically meaningful way. In this paper, we present an algorithm to approximate the Wasserstein-2 barycenters of continuous measures via a generative model. Previous approaches rely on regularization (entropic/quadratic) which introduces bias or on input convex neural networks which are not expressive enough for large-scale tasks. In contrast, our algorithm does not introduce bias and allows using arbitrary neural networks. In addition, based on the celebrity faces dataset, we construct Ave, celeba! dataset which can be used for quantitative evaluation of barycenter algorithms by using standard metrics of generative models such as FID.

Alexander Korotin, Vage Egiazarian, Lingxiao Li, Evgeny Burnaev• 2022

Related benchmarks

TaskDatasetResultRank
Image GenerationCelebA
FID52.85
110
Barycenter ComputationLocation-scatter population (Gaussian P0 = N(0, ID)) (test)
BW2-UVP0.38
21
Barycenter ComputationLocation-scatter population Uniform P0 = Uniform([-sqrt(3), +sqrt(3)]^D) (test)
BW2-UVP0.46
21
Generative ModelingCelebA 64x64 (test)
FID15.7
6
Inverse Optimal Transport Map RecoveryCelebA n=1
FID49.3
3
Inverse Optimal Transport Map RecoveryCelebA n=2
FID46.9
3
Inverse Optimal Transport Map RecoveryCelebA n=3
FID61.5
3
Showing 7 of 7 rows

Other info

Code

Follow for update