Computational optimal transport: With applications to data science

G Peyré, M Cuturi - Foundations and Trends® in Machine …, 2019 - nowpublishers.com
Optimal transport (OT) theory can be informally described using the words of the French
mathematician Gaspard Monge (1746–1818): A worker with a shovel in hand has to move a …

Optimal transport with proximal splitting

N Papadakis, G Peyré, E Oudet - SIAM Journal on Imaging Sciences, 2014 - SIAM
This article reviews the use of first order convex optimization schemes to solve the
discretized dynamic optimal transport problem, initially proposed by Benamou and Brenier …

Pot: Python optimal transport

R Flamary, N Courty, A Gramfort, MZ Alaya… - Journal of Machine …, 2021 - jmlr.org
Optimal transport has recently been reintroduced to the machine learning community thanks
in part to novel efficient optimization procedures allowing for medium to large scale …

Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration

J Altschuler, J Niles-Weed… - Advances in neural …, 2017 - proceedings.neurips.cc
Computing optimal transport distances such as the earth mover's distance is a fundamental
problem in machine learning, statistics, and computer vision. Despite the recent introduction …

Optimal transport for treatment effect estimation

H Wang, J Fan, Z Chen, H Li, W Liu… - Advances in …, 2024 - proceedings.neurips.cc
Estimating individual treatment effects from observational data is challenging due to
treatment selection bias. Prevalent methods mainly mitigate this issue by aligning different …

Optimal transport for domain adaptation

N Courty, R Flamary, D Tuia… - IEEE transactions on …, 2016 - ieeexplore.ieee.org
Domain adaptation is one of the most challenging tasks of modern data analytics. If the
adaptation is done correctly, models built on a specific data representation become more …

Iterative Bregman projections for regularized transportation problems

JD Benamou, G Carlier, M Cuturi, L Nenna… - SIAM Journal on Scientific …, 2015 - SIAM
This paper details a general numerical framework to approximate solutions to linear
programs related to optimal transport. The general idea is to introduce an entropic …

Convolutional wasserstein distances: Efficient optimal transportation on geometric domains

J Solomon, F De Goes, G Peyré, M Cuturi… - ACM Transactions on …, 2015 - dl.acm.org
This paper introduces a new class of algorithms for optimization problems involving optimal
transportation over geometric domains. Our main contribution is to show that optimal …

Neural conservation laws: A divergence-free perspective

J Richter-Powell, Y Lipman… - Advances in Neural …, 2022 - proceedings.neurips.cc
We investigate the parameterization of deep neural networks that by design satisfy the
continuity equation, a fundamental conservation law. This is enabled by the observation that …

Scaling algorithms for unbalanced optimal transport problems

L Chizat, G Peyré, B Schmitzer, FX Vialard - Mathematics of Computation, 2018 - ams.org
This article introduces a new class of fast algorithms to approximate variational problems
involving unbalanced optimal transport. While classical optimal transport considers only …