entropic regularization

Batch Greenkhorn Algorithm for Entropic-Regularized Multimarginal Optimal Transport: Linear Rate of Convergence and Iteration Complexity ICML 2022 Entropic Gromov-Wasserstein between Gaussian Distributions ICML 2022 Low-rank Optimal Transport: Approximation, Statistics and Debiasing NeurIPS 2022 Nearly Tight Convergence Bounds for Semi-discrete Entropic Optimal Transport AISTATS 2022 On Multimarginal Partial Optimal Transport: Equivalent Forms and Computational Complexity AISTATS 2022 On the Complexity of Approximating Multimarginal Optimal Transport JMLR 2022 On the Efficiency of Entropic Regularized Algorithms for Optimal Transport JMLR 2022 On Transportation of Mini-batches: A Hierarchical Approach ICML 2022 Optimal transport with f-divergence regularization and generalized Sinkhorn algorithm AISTATS 2022 Parameter tuning and model selection in Optimal Transport with semi-dual Brenier formulation NeurIPS 2022 Robust computation of optimal transport by $β$-potential regularization ACML 2022 Differentiable Divergences Between Time Series AISTATS 2021 Equitable and Optimal Transport with Multiple Agents AISTATS 2021 Low-Rank Sinkhorn Factorization ICML 2021 Regularized Policies are Reward Robust AISTATS 2021 Batch norm with entropic regularization turns deterministic autoencoders into generative models UAI 2020 Chaining Meets Chain Rule: Multilevel Entropic Regularization and Training of Neural Networks JMLR 2020 Entropic Optimal Transport between Unbalanced Gaussian Measures has a Closed Form NeurIPS 2020 Faster Wasserstein Distance Estimation with the Sinkhorn Divergence NeurIPS 2020 Gaussian-Smoothed Optimal Transport: Metric Structure and Statistical Efficiency AISTATS 2020 Linear Time Sinkhorn Divergences using Positive Features NeurIPS 2020 On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithm ICML 2020 Differentiable Ranking and Sorting using Optimal Transport NeurIPS 2019 Massively scalable Sinkhorn distances via the Nyström method NeurIPS 2019 On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithms ICML 2019