ru
ru
Source
ICLR
DATE OF PUBLICATION
05/04/2023
Authors
Share

NEURAL OPTIMAL TRANSPORT

Abstract

We present a novel neural-networks-based algorithm to compute optimal transport maps and plans for strong and weak transport costs. To justify the usage of neural networks, we prove that they are universal approximators of transport plans between probability distributions. We evaluate the performance of our optimal transport algorithm on toy examples and on the unpaired image-to-image translation.

Full text

Similar publications

NeurIPS
Kantorovich Strikes Back! Wasserstein GANs are not Optimal Transport?
Evgeny Burnaev, Alexander Korotin, Alexander Kolesov
SOURCE
NeurIPS
BABILong: Testing the Limits of LLMs with Long Context Reasoning-in-a-Haystack
Yuri Kuratov, Aydar Bulatov, Petr Anokhin, Ivan Rodkin, Dmitry Sorokin, Artyom Sorokin, Mikhail Burtsev
SOURCE
ICLR
A3D: Does Diffusion Dream about 3D Alignment?
Savva Ignatyev, Nina Konovalova, Daniil Selikhanovych, Oleg Voynov , Nikolay Patakin, Ilya Olkov, Dmitry Senushkin, Alexey Artemov, Anton Konushin, Alexander Filippov, Peter Wonka, Evgeny Burnaev
SOURCE
ICLR
Robust Barycenter Estimation using Semi-Unbalanced Neural Optimal Transport
Milena Gazdieva, Jaemoo Choi, Alexander Kolesov, Jaewoong Choi, Petr Mokrov, Alexander Korotin
SOURCE
Doklady Mathematics
Rethinking graph classification problem in presence of isomorphism
Sergei Ivanov, Sergei Sviridov, Evgeny Burnaev
SOURCE
Doklady Mathematics
Deforming implicit neural representation generative adversarial network for unsupervised appearence editing
Savva Ignatyev, Vage Egiazarian, Ruslan Rakhimov, Evgeny Burnaev
SOURCE
IEEE Access
NeuSD: Surface Completion with Multi-View Text-to-Image Diffusion
Savva Ignatyev, Daniil Selikhanovych, Oleg Voynov , Yiqun Wang, Peter Wonka, Stamatios Lefkimmiatis, Evgeny Burnaev
SOURCE
Contact us
Join AIRI
You can ask us a question or suggest a joint project in the field of AI

Message sent.

Thank you!

Something went wrong. Try again