Cover Image

Sharper Exponential Convergence Rates for Sinkhorn's Algorithm in Continuous Settings

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chizat, Lénaïc, Delalande, Alex, Vaškevičius, Tomas
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Annealed Sinkhorn for Optimal Transport: convergence, regularization path and debiasing
by: Chizat, Lénaïc
Published: (2024)

An Exponentially Converging Particle Method for the Mixed Nash Equilibrium of Continuous Games
by: Wang, Guillaume, et al.
Published: (2022)

Local convergence of mean-field Langevin dynamics: from gradient flows to linearly monotone games
by: Wang, Guillaume, et al.
Published: (2026)

Doubly Regularized Entropic Wasserstein Barycenters
by: Chizat, Lénaïc
Published: (2023)

Mean-Field Langevin Dynamics for Signed Measures via a Bilevel Approach
by: Wang, Guillaume, et al.
Published: (2024)

Convergence of drift-diffusion PDEs arising as Wasserstein gradient flows of convex functions
by: Chizat, Lénaïc, et al.
Published: (2025)

On the Convergence Rate of Sinkhorn's Algorithm
by: Ghosal, Promit, et al.
Published: (2022)

Sharper Convergence Rates for Nonconvex Optimisation via Reduction Mappings
by: Markou, Evan, et al.
Published: (2025)

Displacement smoothness of entropic optimal transport
by: Carlier, Guillaume, et al.
Published: (2022)

Quantitative Convergence of Wasserstein Gradient Flows of Kernel Mean Discrepancies
by: Chizat, Lénaïc, et al.
Published: (2026)

A Bregman-Sinkhorn Algorithm for the Maximum Weight Independent Set Problem
by: Haller, Stefan, et al.
Published: (2024)

Quantitative Local Convergence of Mean-Field Stein Variational Gradient Flow
by: Chizat, Lénaïc, et al.
Published: (2026)

Quantitative Stability of the Pushforward Operation by an Optimal Transport Map
by: Carlier, Guillaume, et al.
Published: (2024)

Explicit Convergence Rate of The Proximal Point Algorithm under R-Continuity
by: Le, Ba Khiet, et al.
Published: (2024)

Distributed Nonconvex Optimization with Exponential Convergence Rate via Hybrid Systems Methods
by: Hendrickson, Katherine R., et al.
Published: (2025)

A Fundamental Convergence Rate Bound for Gradient Based Online Optimization Algorithms with Exact Tracking
by: Wu, Alex Xinting, et al.
Published: (2025)

On Sinkhorn's Algorithm and Choice Modeling
by: Qu, Zhaonan, et al.
Published: (2023)

Distributed Optimization Algorithm with Superlinear Convergence Rate
by: Xu, Yeming, et al.
Published: (2024)

On the Convergence Rate of the One-Hop Transfer Algorithm
by: Jiang, Ruichao, et al.
Published: (2026)

Accelerating Sinkhorn Algorithm with Sparse Newton Iterations
by: Tang, Xun, et al.
Published: (2024)

Exponential Convergence of Augmented Primal-dual Gradient Algorithms for Partially Strongly Convex Functions
by: Li, Mengmou, et al.
Published: (2024)

A Sinkhorn-type Algorithm for Constrained Optimal Transport
by: Tang, Xun, et al.
Published: (2024)

Importance Sparsification for Sinkhorn Algorithm
by: Li, Mengyu, et al.
Published: (2023)

On Exponential Convergence of Random Variables
by: Tarłowski, Dawid
Published: (2024)

Non-Convex Robust Hypothesis Testing using Sinkhorn Uncertainty Sets
by: Wang, Jie, et al.
Published: (2024)

On the Convergence of the Sinkhorn-Knopp Algorithm with Sparse Cost Matrices
by: Mena, Jose Rafael Espinosa
Published: (2024)

Compact R-Continuity with Applications to Solving Inclusions and Convergence of Algorithms
by: Le, Ba Khiet, et al.
Published: (2025)

Exponential and Prescribed-Time Extremum Seeking with Unbiased Convergence
by: Yilmaz, Cemal Tugrul, et al.
Published: (2023)

Sharper Guarantees for Misspecified Kernelized Bandit Optimization
by: Maran, Davide, et al.
Published: (2026)

A Generalized Sinkhorn Algorithm for Mean-Field Schrödinger Bridge
by: Eldesoukey, Asmaa, et al.
Published: (2026)

Accelerating Sinkhorn for Entropy-Regularized Optimal Transport
by: Xu, Zeyi, et al.
Published: (2026)

Convergence Rate of the Last Iterate of Stochastic Proximal Algorithms
by: Vaidyan, Kevin Kurian Thomas, et al.
Published: (2026)

First-Order Projected Algorithms With the Same Linear Convergence Rate Bounds as Their Unconstrained Counterparts
by: Li, Mengmou, et al.
Published: (2025)

Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm
by: Wirth, Elias, et al.
Published: (2025)

Information Geometry of Exponentiated Gradient: Convergence beyond L-Smoothness
by: Elshiaty, Yara, et al.
Published: (2025)

Multifractal Analysis of the Sinkhorn Algorithm: Unveiling the Intricate Structure of Optimal Transport Maps
by: Mena, Jose Rafael Espinosa
Published: (2024)

Nested Stochastic Algorithm for Generalized Sinkhorn distance-Regularized Distributionally Robust Optimization
by: Yang, Yufeng, et al.
Published: (2025)

On the (almost) Global Exponential Convergence of the Overparameterized Policy Optimization for the LQR Problem
by: Wafi, Moh Kamalul, et al.
Published: (2025)

Tight Analysis of Difference-of-Convex Algorithm (DCA) Improves Convergence Rates for Proximal Gradient Descent
by: Rotaru, Teodor, et al.
Published: (2025)

Accelerated Affine-Invariant Convergence Rates of the Frank-Wolfe Algorithm with Open-Loop Step-Sizes
by: Wirth, Elias, et al.
Published: (2023)