Computational Optimal Transport VIII: Sinkhorn's Scalings Contract by λ(K)² per Iteration in Hilbert's Projective MetricTextbook
Sinkhorn's algorithm is the standard method for computing entropically regularized optimal transport between two histograms. It is used throughout machine learning, statistics, imaging and graphics because each iteration is two matrix–vector products followed by entrywise divisions, which parallelize on GPUs and differentiate easily. The same iteration,…