A review of matrix scaling and Sinkhorn's normal form for matrices and positive maps
read the original abstract
Given a nonnegative matrix $A$, can you find diagonal matrices $D_1,~D_2$ such that $D_1AD_2$ is doubly stochastic? The answer to this question is known as Sinkhorn's theorem. It has been proved with a wide variety of methods, each presenting a variety of possible generalisations. Recently, generalisations such as to positive maps between matrix algebras have become more and more interesting for applications. This text gives a review of over 70 years of matrix scaling. The focus lies on the mathematical landscape surrounding the problem and its solution as well as the generalisation to positive maps and contains hardly any nontrivial unpublished results.
This paper has not been read by Pith yet.
Forward citations
Cited by 7 Pith papers
-
On the Efficiency of Sinkhorn-Knopp for Entropically Regularized Optimal Transport
SK converges in O(log n - log ε) iterations for well-bounded EOT independent of η||C||_∞, O(log(1/ε)) with pre-scaling; general scaling has a sharp density phase transition for ν-independence.
-
Almost-sharp $O(k^{-1} \log k)$ convergence rate for the Sinkhorn algorithm in the asymptotically scalable case
Sinkhorn algorithm achieves O(k^{-1} log k) convergence in l1-norm marginal error for asymptotically scalable cases, nearly closing the gap to the Omega(k^{-1}) lower bound.
-
Almost-sharp $O(k^{-1} \log k)$ convergence rate for the Sinkhorn algorithm in the asymptotically scalable case
Sinkhorn algorithm converges at O(k^{-1} log k) rate in l1-norm marginal error for asymptotically scalable instances, nearly matching the Omega(k^{-1}) lower bound.
-
Scaling limit of Sinkhorn-rescaled Random Matrices via Stability of Static Schr\"odinger Bridges
Sinkhorn-rescaled random matrices converge to the continuous static Schrödinger bridge with explicit non-asymptotic rates and new stability theory for the bridge.
-
Generalised Entanglement Entropies from Unit-Invariant Singular Value Decomposition
Generalized entanglement entropies are constructed via left-, right-, and bi-invariant unit-invariant singular value decompositions to ensure scale invariance for non-Hermitian and rectangular operators in quantum mec...
-
Accelerating operator Sinkhorn iteration with overrelaxation
Accelerated operator Sinkhorn iterations via overrelaxation achieve faster local and global convergence, generalizing matrix scaling results with supporting numerical experiments.
-
Network-Based Epidemic Control Through Optimal Travel and Quarantine Management
The work proposes two optimization approaches for network epidemic control: travel rate reduction whose convergence depends on network structure, and quarantine optimization that reduces to matrix balancing with expon...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.