Search Results for author: Khang Le

Found 5 papers, 2 papers with code

Entropic Gromov-Wasserstein between Gaussian Distributions

no code implementations24 Aug 2021 Khang Le, Dung Le, Huy Nguyen, Dat Do, Tung Pham, Nhat Ho

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 entropic IGW and its unbalanced variant are (unbalanced) Gaussian distributions.

On Multimarginal Partial Optimal Transport: Equivalent Forms and Computational Complexity

no code implementations18 Aug 2021 Khang Le, Huy Nguyen, Tung Pham, Nhat Ho

We demonstrate that the ApproxMPOT algorithm can approximate the optimal value of multimarginal POT problem with a computational complexity upper bound of the order $\tilde{\mathcal{O}}(m^3(n+1)^{m}/ \varepsilon^2)$ where $\varepsilon > 0$ stands for the desired tolerance.

On Robust Optimal Transport: Computational Complexity and Barycenter Computation

no code implementations NeurIPS 2021 Khang Le, Huy Nguyen, Quang Nguyen, Tung Pham, Hung Bui, Nhat Ho

We consider robust variants of the standard optimal transport, named robust optimal transport, where marginal constraints are relaxed via Kullback-Leibler divergence.

On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithm

1 code implementation ICML 2020 Khiem Pham, Khang Le, Nhat Ho, Tung Pham, Hung Bui

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.

Cannot find the paper you are looking for? You can Submit a new open access paper.