conftrace_

entropic regularization

53 papers

Explore in graph

Co-occurring keywords

optimal transport (948) sinkhorn algorithm (64) wasserstein distance (417) entropy regularization (132) unbalanced optimal transport (18) sinkhorn divergence (19) complexity bound (50) computational complexity (399) wasserstein barycenter (46) linear programming (227)

Papers

On Multimarginal Partial Optimal Transport: Equivalent Forms and Computational Complexity AISTATS 2022
Robust computation of optimal transport by $β$-potential regularization ACML 2022
Equitable and Optimal Transport with Multiple Agents AISTATS 2021
Low-Rank Sinkhorn Factorization ICML 2021
Regularized Policies are Reward Robust AISTATS 2021
Differentiable Divergences Between Time Series AISTATS 2021
Linear Time Sinkhorn Divergences using Positive Features NIPS 2020
Faster Wasserstein Distance Estimation with the Sinkhorn Divergence NIPS 2020
Gaussian-Smoothed Optimal Transport: Metric Structure and Statistical Efficiency AISTATS 2020
Chaining Meets Chain Rule: Multilevel Entropic Regularization and Training of Neural Networks JMLR 2020
Batch norm with entropic regularization turns deterministic autoencoders into generative models UAI 2020
On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithm ICML 2020
Entropic Optimal Transport between Unbalanced Gaussian Measures has a Closed Form NIPS 2020
Optimal Transport: Fast Probabilistic Approximation with Exact Solvers JMLR 2019
Subspace Robust Wasserstein Distances ICML 2019
Differentiable Ranking and Sorting using Optimal Transport NIPS 2019
Massively scalable Sinkhorn distances via the Nyström method NIPS 2019
On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithms ICML 2019
On the Complexity of Approximating Wasserstein Barycenters ICML 2019
Online Convex Optimization in Adversarial Markov Decision Processes ICML 2019
Stochastic algorithms for entropy-regularized optimal transport problems AISTATS 2018
Learning Generative Models with Sinkhorn Divergences AISTATS 2018
Smooth and Sparse Optimal Transport AISTATS 2018
Differential Properties of Sinkhorn Approximation for Learning with Wasserstein Distance NIPS 2018
Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn’s Algorithm ICML 2018