Overrelaxed Sinkhorn-Knopp Algorithm for Regularized Optimal Transport - Archive ouverte HAL Access content directly
Journal Articles Algorithms Year : 2021

Overrelaxed Sinkhorn-Knopp Algorithm for Regularized Optimal Transport


This article describes a set of methods for quickly computing the solution to the regularized optimal transport problem. It generalizes and improves upon the widely used iterative Bregman projections algorithm (or Sinkhorn-Knopp algorithm). We first proposed to rely on regularized nonlinear acceleration schemes. In practice, such approaches lead to fast algorithms, but their global convergence is not ensured. Hence, we next proposed a new algorithm with convergence guarantees. The idea is to overrelax the Bregman projection operators, allowing for faster convergence. We proposed a simple method for establishing global convergence by ensuring the decrease of a Lyapunov function at each step. An adaptive choice of the overrelaxation parameter based on the Lyapunov function was constructed. We also suggested a heuristic to choose a suitable asymptotic overrelaxation parameter, based on a local convergence analysis. Our numerical experiments showed a gain in convergence speed by an order of magnitude in certain regimes.
Fichier principal
Vignette du fichier
hal.pdf (706.23 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03212175 , version 1 (29-04-2021)



Alexis Thibault, Lénaïc Chizat, Charles Dossal, Nicolas Papadakis. Overrelaxed Sinkhorn-Knopp Algorithm for Regularized Optimal Transport. Algorithms, 2021, Optimal Transport: Algorithms and Applications, 14 (5), ⟨10.3390/a14050143⟩. ⟨hal-03212175⟩
127 View
463 Download



Gmail Mastodon Facebook X LinkedIn More