Wasserstein Iterative Networks for Barycenter Estimation
Alexander Korotin, Vage Egiazarian, Lingxiao Li, Evgeny Burnaev
Abstract
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. 36th Conference on Neural Information Processing Systems (NeurIPS 2022).
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 6c39cdfd-3195-4639-9128-147d0f8fab0aCited by top-tier papers20
- Neural Optimal TransportAlexander Korotin, Daniil Selikhanovych, Evgeny BurnaevICLR 2023 · 151 citations
- Optimal Flow Matching: Learning Straight Trajectories in Just One StepNikita Kornilov, Petr Mokrov, Alexander V. Gasnikov, Alexander KorotinNeurIPS 2024 · 93 citations
- Neural Optimal Transport with General Cost FunctionalsArip Asadulaev, Alexander Korotin, Vage Egiazarian, Petr Mokrov et al.ICLR 2024 · 43 citations
- Energy-guided Entropic Neural Optimal TransportPetr Mokrov, Alexander Korotin, Alexander Kolesov, Nikita Gushchin et al.ICLR 2024 · 30 citations
- Tree-Based Diffusion Schrödinger Bridge with Applications to Wasserstein BarycentersMaxence Noble, Valentin De Bortoli, Arnaud Doucet, Alain DurmusNeurIPS 2023 · 19 citations
Builds on15
- Optimal transport mapping via input convex neural networksAshok Vardhan Makkuva, Amirhossein Taghvaei, Sewoong Oh, Jason D. LeeICML 2020 · 254 citations
- Wasserstein-2 Generative NetworksAlexander Korotin, Vage Egiazarian, Arip Asadulaev, Alexander Safin et al.ICLR 2021 · 128 citations
- Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 BenchmarkAlexander Korotin, Lingxiao Li, Aude Genevay, Justin M. Solomon et al.NeurIPS 2021 · 124 citations
- Large-Scale Wasserstein Gradient FlowsPetr Mokrov, Alexander Korotin, Lingxiao Li, Aude Genevay et al.NeurIPS 2021 · 112 citations
- Wasserstein GAN With Quadratic Transport CostHuidong Liu, Xianfeng Gu, Dimitris SamarasICCV 2019 · 104 citations
Related papers
- Continuous Wasserstein-2 Barycenter Estimation without Minimax OptimizationAlexander Korotin, Lingxiao Li, Justin Solomon, Evgeny BurnaevICLR 2021 · 58 citations
- Scalable Computations of Wasserstein Barycenter via Input Convex Neural NetworksYongxin Chen, Jiaojiao Fan, Amirhossein TaghvaeiICML 2021 · 66 citations
- Continuous Regularized Wasserstein BarycentersLingxiao Li, Aude Genevay, Mikhail Yurochkin, Justin M. SolomonNeurIPS 2020 · 61 citations
- Estimating Barycenters of Distributions with Neural Optimal TransportAlexander Kolesov, Petr Mokrov, Igor Udovichenko, Milena Gazdieva et al.ICML 2024 · 13 citations
- Optimal Transport Barycenter via Nonconvex-Concave Minimax OptimizationKaheon Kim, Rentian Yao, Changbo Zhu, Xiaohui ChenICML 2025
