Search Results for author: Alexander Kolesov

Found 6 papers, 4 papers with code

Estimating Barycenters of Distributions with Neural Optimal Transport

no code implementations6 Feb 2024 Alexander Kolesov, Petr Mokrov, Igor Udovichenko, Milena Gazdieva, Gudmund Pammer, Evgeny Burnaev, Alexander Korotin

Given a collection of probability measures, a practitioner sometimes needs to find an "average" distribution which adequately aggregates reference distributions.

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.

Entropic Neural Optimal Transport via Diffusion Processes

1 code implementation NeurIPS 2023 Nikita Gushchin, Alexander Kolesov, Alexander Korotin, Dmitry Vetrov, Evgeny Burnaev

We propose a novel neural algorithm for the fundamental problem of computing the entropic optimal transport (EOT) plan between continuous probability distributions which are accessible by samples.

Kantorovich Strikes Back! Wasserstein GANs are not Optimal Transport?

2 code implementations15 Jun 2022 Alexander Korotin, Alexander Kolesov, Evgeny Burnaev

Despite the success of WGANs, it is still unclear how well the underlying OT dual solvers approximate the OT cost (Wasserstein-1 distance, $\mathbb{W}_{1}$) and the OT gradient needed to update the generator.

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