A note on overrelaxation in the Sinkhorn algorithm

加速运算符Sinkhorn迭代的过松弛方法

Accelerating operator Sinkhorn iteration with overrelaxation

本文提出加速运算符Sinkhorn迭代的过松弛方法，通过线性化分析局部收敛速度，并基于Young的SOR定理确定最优松弛参数，同时利用正定锥的Hilbert度量获得全局收敛性结果，实验表明方法在某些应用中优于原始运算符Sinkhorn迭代。

数值稳定的过松弛变种用于算子Sinkhorn迭代

Numerically stable variants of overrelaxation for operator Sinkhorn iteration

本文提出数值稳定的过松弛变种用于算子Sinkhorn迭代，通过在线应用预条件效应提升计算稳定性，验证了在病态情况下加速效果。

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 propose 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 propose a new algorithm with convergence guarantees. The idea is to overrelax the Bregman projection operators, allowing for faster convergence. We propose a simple method …

用于最优部分输运问题的Sinkhorn算法与线性规划求解器

Sinkhorn algorithms and linear programming solvers for optimal partial transport problems

该研究推广经典最优部分输运问题，提出基于函数项的广义最优部分输运问题，推导其对偶形式与对应Sinkhorn求解器，还分析了其与经典最优输运的关系并设计了专用线性规划求解器。

推导一些流行最优传输算法的梯度

Deriving the Gradients of Some Popular Optimal Transport Algorithms

本文推导了计算最优传输中几种流行算法的梯度，包括Sinkhorn算法、Wasserstein均值算法和Wasserstein字典学习算法。