Unbalanced optimal transport, from theory to numerics

T Séjourné, G Peyré, FX Vialard - Handbook of Numerical Analysis, 2023 - Elsevier
Optimal Transport (OT) has recently emerged as a central tool in data sciences to compare
in a geometrically faithful way point clouds and more generally probability distributions. The …

Diff-instruct: A universal approach for transferring knowledge from pre-trained diffusion models

W Luo, T Hu, S Zhang, J Sun, Z Li… - Advances in Neural …, 2024 - proceedings.neurips.cc
Due to the ease of training, ability to scale, and high sample quality, diffusion models (DMs)
have become the preferred option for generative modeling, with numerous pre-trained …

Scalable Gromov-Wasserstein learning for graph partitioning and matching

H Xu, D Luo, L Carin - Advances in neural information …, 2019 - proceedings.neurips.cc
We propose a scalable Gromov-Wasserstein learning (S-GWL) method and establish a
novel and theoretically-supported paradigm for large-scale graph analysis. The proposed …

Semantic correspondence as an optimal transport problem

Y Liu, L Zhu, M Yamada… - Proceedings of the IEEE …, 2020 - openaccess.thecvf.com
Establishing dense correspondences across semantically similar images is a challenging
task. Due to the large intra-class variation and background clutter, two common issues occur …

Distributional sliced-Wasserstein and applications to generative modeling

K Nguyen, N Ho, T Pham, H Bui - arxiv preprint arxiv:2002.07367, 2020 - arxiv.org
Sliced-Wasserstein distance (SW) and its variant, Max Sliced-Wasserstein distance (Max-
SW), have been used widely in the recent years due to their fast computation and scalability …

Linear-time gromov wasserstein distances using low rank couplings and costs

M Scetbon, G Peyré, M Cuturi - International Conference on …, 2022 - proceedings.mlr.press
The ability to align points across two related yet incomparable point clouds (eg living in
different spaces) plays an important role in machine learning. The Gromov-Wasserstein …

The unbalanced gromov wasserstein distance: Conic formulation and relaxation

T Séjourné, FX Vialard, G Peyré - Advances in Neural …, 2021 - proceedings.neurips.cc
Comparing metric measure spaces (ie a metric space endowed with a probability
distribution) is at the heart of many machine learning problems. The most popular distance …

Fused Gromov-Wasserstein distance for structured objects

T Vayer, L Chapel, R Flamary, R Tavenard, N Courty - Algorithms, 2020 - mdpi.com
Optimal transport theory has recently found many applications in machine learning thanks to
its capacity to meaningfully compare various machine learning objects that are viewed as …

Phase stability through machine learning

R Arróyave - Journal of Phase Equilibria and Diffusion, 2022 - Springer
Understanding the phase stability of a chemical system constitutes the foundation of
materials science. Knowledge of the equilibrium state of a system under arbitrary …

Learning with minibatch Wasserstein: asymptotic and gradient properties

K Fatras, Y Zine, R Flamary, R Gribonval… - arxiv preprint arxiv …, 2019 - arxiv.org
Optimal transport distances are powerful tools to compare probability distributions and have
found many applications in machine learning. Yet their algorithmic complexity prevents their …