← Search

Khang Le

4 accepted papers

2022

Entropic Gromov-Wasserstein between Gaussian Distributions

ICML 2022spotlight

We study the entropic Gromov-Wasserstein and its unbalanced version between (unbalanced) Gaussian distributions with different dimensions. When the metric is the inner product, which we refer to as inner product Gromov-Wasserstein (IGW), we demonstrate that the optimal transportation plans of entrop…

2022

On Multimarginal Partial Optimal Transport: Equivalent Forms and Computational Complexity

AISTATS 2022poster

We study the multi-marginal partial optimal transport (POT) problem between $m$ discrete (unbalanced) measures with at most $n$ supports. We first prove that we can obtain two equivalent forms of the multimarginal POT problem in terms of the multimarginal optimal transport problem via novel extensio…

Cited by 13SourcePDFScholar
2021

On Robust Optimal Transport: Computational Complexity and Barycenter Computation

NeurIPS 2021poster

We consider robust variants of the standard optimal transport, named robust optimal transport, where marginal constraints are relaxed via Kullback-Leibler divergence. We show that Sinkhorn-based algorithms can approximate the optimal cost of robust optimal transport in $\widetilde{\mathcal{O}}(\frac…

Cited by 48SourcePDFScholar
2020

On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithm

ICML 2020poster

We provide a computational complexity analysis for the Sinkhorn algorithm that solves the entropic regularized Unbalanced Optimal Transport (UOT) problem between two measures of possibly different masses with at most $n$ components. We show that the complexity of the Sinkhorn algorithm for finding a…

Cited by 112SourcePDFScholar