Skip to content
conftrace_

sinkhorn algorithm

72 papers

SINKHORN

Papers

Entropic Optimal Transport between Unbalanced Gaussian Measures has a Closed Form NeurIPS 2020 Learning transport cost from subset correspondence ICLR 2020 Online Sinkhorn: Optimal Transport distances from sample streams NeurIPS 2020 On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithm ICML 2020 Rationalizing Text Matching: Learning Sparse Alignments via Optimal Transport ACL 2020 Regularized Optimal Transport is Ground Cost Adversarial ICML 2020 RPM-Net: Robust Point Matching Using Learned Features CVPR 2020 Differentiable Ranking and Sorting using Optimal Transport NeurIPS 2019 Linear-Complexity Data-Parallel Earth Mover’s Distance Approximations ICML 2019 On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithms ICML 2019 Screening Sinkhorn Algorithm for Regularized Optimal Transport NeurIPS 2019 Sinkhorn AutoEncoders UAI 2019 Wasserstein regularization for sparse multi-task regression AISTATS 2019 Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn’s Algorithm ICML 2018 Differential Properties of Sinkhorn Approximation for Learning with Wasserstein Distance NeurIPS 2018 Large Scale computation of Means and Clusters for Persistence Diagrams using Optimal Transport NeurIPS 2018 Regularized Optimal Transport and the Rot Mover's Distance JMLR 2018 Smooth and Sparse Optimal Transport AISTATS 2018 Stochastic algorithms for entropy-regularized optimal transport problems AISTATS 2018 Stochastic Optimization for Large-scale Optimal Transport NeurIPS 2016 Fast Computation of Wasserstein Barycenters ICML 2014 Sinkhorn Distances: Lightspeed Computation of Optimal Transport NeurIPS 2013