entropic regularization

Online Convex Optimization in Adversarial Markov Decision Processes ICML 2019 On the Complexity of Approximating Wasserstein Barycenters ICML 2019 Optimal Transport: Fast Probabilistic Approximation with Exact Solvers JMLR 2019 Subspace Robust Wasserstein Distances ICML 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 Learning Generative Models with Sinkhorn Divergences AISTATS 2018 Smooth and Sparse Optimal Transport AISTATS 2018 Stochastic algorithms for entropy-regularized optimal transport problems AISTATS 2018 Fast Dictionary Learning with a Smoothed Wasserstein Loss AISTATS 2016 Stochastic Optimization for Large-scale Optimal Transport NeurIPS 2016 Sinkhorn Distances: Lightspeed Computation of Optimal Transport NeurIPS 2013