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.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Image Generation | CelebA | FID52.85 | 110 | |
| Barycenter Computation | Location-scatter population (Gaussian P0 = N(0, ID)) (test) | BW2-UVP0.38 | 21 | |
| Barycenter Computation | Location-scatter population Uniform P0 = Uniform([-sqrt(3), +sqrt(3)]^D) (test) | BW2-UVP0.46 | 21 | |
| Generative Modeling | CelebA 64x64 (test) | FID15.7 | 6 | |
| Inverse Optimal Transport Map Recovery | CelebA n=1 | FID49.3 | 3 | |
| Inverse Optimal Transport Map Recovery | CelebA n=2 | FID46.9 | 3 | |
| Inverse Optimal Transport Map Recovery | CelebA n=3 | FID61.5 | 3 |