Alexander Korotin
Alexander Korotin
Home
Publications
Team
CV
Light
Dark
Automatic
paper-conference
Wasserstein Iterative Networks for Barycenter Estimation
We present an algorithm to approximate the Wasserstein-2 barycenters of continuous measures via a generative model and construct Ave, celeba! dataset which can be used for quantitative evaluation of barycenter algorithms.
Alexander Korotin
,
Vage Egiazarian
,
Lingxiao Li
,
Evgeny Burnaev
PDF
Cite
Code
Video
OpenReview
Generative Modeling with Optimal Transport Maps
While optimal transport cost serves as the loss for popular generative models, we demonstrate that the optimal transport map can be used as the generative model itself.
Litu Rout
,
Alexander Korotin
,
Evgeny Burnaev
PDF
Cite
Code
Video
OpenReview
Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmark
We construct pairs of continuous measures with analytically-known optimal transport (OT) solutions for the quadratic cost to test existing parametric OT solvers including those used in implicit generative modeling.
Alexander Korotin
,
Lingxiao Li
,
Aude Genevay
,
Justin Solomon
,
Alexander Filippov
,
Evgeny Burnaev
PDF
Cite
Code
Poster
Video
OpenReview
Large-Scale Wasserstein Gradient Flows
We propose a scalable method to approximate diffusion processes via Wasserstein-2 gradient flows empowered by input-convex neural networks and Jordan-Kinderlehrer-Otto time discretization.
Petr Mokrov
,
Alexander Korotin
,
Lingxiao Li
,
Aude Genevay
,
Justin Solomon
,
Evgeny Burnaev
PDF
Cite
Code
Poster
Video
OpenReview
Manifold Topology Divergence: a Framework for Comparing Data Manifolds
We introduce a topology-based domain agnostic methodology for comparing data manifolds.
Serguei Barannikov
,
Ilya Trofimov
,
Grigorii Sotnikov
,
Ekaterina Trimbach
,
Alexander Korotin
,
Alexander Filippov
,
Evgeny Burnaev
PDF
Cite
Code
Video
OpenReview
Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization
We present a new algorithm to compute Wasserstein-2 barycenters of continuous distributions powered by a straightforward optimization procedure without introducing bias or a generative model.
Alexander Korotin
,
Lingxiao Li
,
Justin Solomon
,
Evgeny Burnaev
PDF
Cite
Code
Poster
Video
OpenReview
Wasserstein-2 Generative Networks
We present a new end-to-end algorithm to compute optimal transport maps between continuous distributions without introducing bias or resorting to minimax optimization.
Alexander Korotin
,
Vage Egiazarian
,
Arip Asadulaev
,
Alexander Safin
,
Evgeny Burnaev
PDF
Cite
Code
Poster
Video
OpenReview
«
Cite
×