no code implementations • 4 Oct 2024 • Milena Gazdieva, Jaemoo Choi, Alexander Kolesov, Jaewoong Choi, Petr Mokrov, Alexander Korotin
To the best of our knowledge, this paper is the first attempt to develop an algorithm for robust barycenters under the continuous distribution setup.
1 code implementation • 19 Mar 2024 • Nikita Kornilov, Petr Mokrov, Alexander Gasnikov, Alexander Korotin
Over the several recent years, there has been a boom in development of Flow Matching (FM) methods for generative modeling.
1 code implementation • 6 Feb 2024 • Alexander Kolesov, Petr Mokrov, Igor Udovichenko, Milena Gazdieva, Gudmund Pammer, Evgeny Burnaev, Alexander Korotin
A theoretically appealing notion of such an average is the Wasserstein barycenter, which is the primal focus of our work.
no code implementations • 2 Oct 2023 • Alexander Kolesov, Petr Mokrov, Igor Udovichenko, Milena Gazdieva, Gudmund Pammer, Anastasis Kratsios, Evgeny Burnaev, Alexander Korotin
Optimal transport (OT) barycenters are a mathematically grounded way of averaging probability distributions while capturing their geometric properties.
1 code implementation • NeurIPS 2023 • Nikita Gushchin, Alexander Kolesov, Petr Mokrov, Polina Karpikova, Andrey Spiridonov, Evgeny Burnaev, Alexander Korotin
We fill this gap and propose a novel way to create pairs of probability distributions for which the ground truth OT solution is known by the construction.
1 code implementation • 12 Apr 2023 • Petr Mokrov, Alexander Korotin, Alexander Kolesov, Nikita Gushchin, Evgeny Burnaev
Energy-based models (EBMs) are known in the Machine Learning community for decades.
1 code implementation • 10 Mar 2023 • Xavier Aramayo Carrasco, Maksim Nekrashevich, Petr Mokrov, Evgeny Burnaev, Alexander Korotin
In the discrete variant of GWOT, the task is to learn an assignment between given discrete sets of points.
1 code implementation • 30 May 2022 • Arip Asadulaev, Alexander Korotin, Vage Egiazarian, Petr Mokrov, Evgeny Burnaev
We introduce a novel neural network-based algorithm to compute optimal transport (OT) plans for general cost functionals.
3 code implementations • NeurIPS 2021 • Petr Mokrov, Alexander Korotin, Lingxiao Li, Aude Genevay, Justin Solomon, Evgeny Burnaev
Specifically, Fokker-Planck equations, which model the diffusion of probability measures, can be understood as gradient descent over entropy functionals in Wasserstein space.