Imagen de Portada

Almost-sharp $O(k^{-1} \log k)$ convergence rate for the Sinkhorn algorithm in the asymptotically scalable case

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Wang, Guillaume
Formato:	Preprint
Publicado:	2026
Materias:	Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Hilbert's projective metric for functions of bounded growth and exponential convergence of Sinkhorn's algorithm
por: Eckstein, Stephan
Publicado: (2023)

On the convergence rate of the Douglas-Rachford splitting algorithm
por: Abbaszadehpeivasti, Hadi, et al.
Publicado: (2025)

Improved convergence rates for the Difference-of-Convex algorithm
por: Rotaru, Teodor, et al.
Publicado: (2024)

Inexact subgradient algorithm with a non-asymptotic convergence guarantee for copositive programming problems
por: Nishijima, Mitsuhiro, et al.
Publicado: (2025)

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

Almost sure convergence of stochastic Hamiltonian descent methods
por: Williamson, Måns, et al.
Publicado: (2024)

Almost sure convergence rates of stochastic gradient methods under gradient domination
por: Weissmann, Simon, et al.
Publicado: (2024)

Sinkhorn algorithms and linear programming solvers for optimal partial transport problems
por: Bai, Yikun
Publicado: (2024)

Global non-asymptotic super-linear convergence rates of regularized proximal quasi-Newton methods on non-smooth composite problems
por: Wang, Shida, et al.
Publicado: (2024)

On the sequential convergence of Lloyd's algorithms
por: Portales, Léo, et al.
Publicado: (2024)

Non-ergodic convergence rate of an inertial accelerated primal-dual algorithm for saddle point problems
por: He, X., et al.
Publicado: (2023)

Sinkhorn Distributionally Robust Optimization
por: Wang, Jie, et al.
Publicado: (2021)

Almost Sure Convergence and Non-asymptotic Concentration Bounds for Stochastic Mirror Descent Algorithm
por: Paul, Anik Kumar, et al.
Publicado: (2024)

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

Symmetric Rank-$k$ Methods
por: Liu, Chengchang, et al.
Publicado: (2023)

Exact worst-case convergence rates for Douglas--Rachford and Davis--Yin splitting methods
por: Nguyen, Edward Duc Hien, et al.
Publicado: (2025)

The Nesterov-Spokoiny Acceleration Achieves Strict $o(1/k^2)$ Convergence
por: Peng, Weibin, et al.
Publicado: (2023)

k-Dimensional Agreement in Multiagent Systems
por: Bianchin, Gianluca, et al.
Publicado: (2022)

A scalable sequential adaptive cubic regularization algorithm for optimization with general equality constraints
por: Pei, Yonggang, et al.
Publicado: (2025)

Qualitative Properties of $k-$Center Problems
por: Long, Vo Si Trong, et al.
Publicado: (2024)

Nonlinear conjugate gradient methods: worst-case convergence rates via computer-assisted analyses
por: Gupta, Shuvomoy Das, et al.
Publicado: (2023)

On the optimal control problem for the k-FORQ/MCH equation with viscosity
por: Wang, Zhao, et al.
Publicado: (2024)

Fast solution to the fair ranking problem using the Sinkhorn algorithm
por: Uehara, Yuki, et al.
Publicado: (2024)

An inexact inertial projective splitting algorithm with strong convergence
por: Alves, M. Marques, et al.
Publicado: (2025)

Sharper Exponential Convergence Rates for Sinkhorn's Algorithm in Continuous Settings
por: Chizat, Lénaïc, et al.
Publicado: (2024)

On diffusion-based generative models and their error bounds: The log-concave case with full convergence estimates
por: Bruno, Stefano, et al.
Publicado: (2023)

Adaptive Softassign via Hadamard-Equipped Sinkhorn
por: Shen, Binrui, et al.
Publicado: (2023)

Primal-dual algorithm for weakly convex functions under sharpness conditions
por: Bednarczuk, Ewa, et al.
Publicado: (2024)

Sinkhorn Distributionally Robust State Estimation via System Level Synthesis
por: Feng, Yulin, et al.
Publicado: (2026)

Uniform exponential convergence of SAA with AMIS and asymptotics of its optimal value
por: Zhang, Wenjin, et al.
Publicado: (2024)

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

On the geometry of sharp minima
por: Corella, Alberto Domínguez
Publicado: (2026)

Alternatives with stronger convergence than coordinate-descent iterative LMI algorithms
por: Simon, Emile, et al.
Publicado: (2011)

Accelerating operator Sinkhorn iteration with overrelaxation
por: Soma, Tasuku, et al.
Publicado: (2024)

On the Global Optimality of Linear Policies for Sinkhorn Distributionally Robust Linear Quadratic Control
por: Cescon, Riccardo, et al.
Publicado: (2025)

Nonconvex weighted variational metal artifacts removal via convergent primal-dual algorithms
por: Wang, Lianfang, et al.
Publicado: (2024)

On the convergence of fictitious play algorithm in repeated games via the geometrical approach
por: Wu, Zhouming, et al.
Publicado: (2024)

Practical prescribed-time prescribed performance control with asymptotic convergence -- A vanishing sigma-modification approach
por: Golestani, Mehdi, et al.
Publicado: (2026)

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

Tradeoffs between convergence rate and noise amplification for momentum-based accelerated optimization algorithms
por: Mohammadi, Hesameddin, et al.
Publicado: (2022)