A review of matrix scaling and Sinkhorn's normal form for matrices and positive maps
arXiv:1609.06349
Abstract
Given a nonnegative matrix , can you find diagonal matrices such that 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.
Maybe this helps somebody. Comments, corrections or suggestions for improving the review most welcome
References in corpus (1)
Cited by in corpus (9)
- Optimal Transport losses and Sinkhorn algorithm with general convex regularization
- On the Variance of Unbiased Online Recurrent Optimization
- The unreasonable effectiveness of optimal transport in economics
- Optimal Approximation of Doubly Stochastic Matrices
- An essay on copula modelling for discrete random vectors; or how to pour new wine into old bottles
- Mosaic: A Sample-Based Database System for Open World Query Processing
- Quantum algorithms for matrix scaling and matrix balancing
- Sample Debiasing in the Themis Open World Database System (Extended Version)
- Matrix scaling, explicit Sinkhorn limits, and arithmetic