Search Results for author: Petr Mokrov

Found 9 papers, 7 papers with code

Robust Barycenter Estimation using Semi-Unbalanced Neural Optimal Transport

no code implementations4 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.

Optimal Flow Matching: Learning Straight Trajectories in Just One Step

1 code implementation19 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.

Estimating Barycenters of Distributions with Neural Optimal Transport

1 code implementation6 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.

Energy-Guided Continuous Entropic Barycenter Estimation for General Costs

no code implementations2 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.

Building the Bridge of Schrödinger: A Continuous Entropic Optimal Transport Benchmark

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.

Neural Optimal Transport with General Cost Functionals

1 code implementation30 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.

Large-Scale Wasserstein Gradient Flows

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.

Cannot find the paper you are looking for? You can Submit a new open access paper.