Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling
type: Item
instance of: scholarly article
title: Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling
author: Deeparnab Chakrabarty
author: Sanjeev Khanna
published in: Mathematical Programming. Series A. Series B
publication date: 2021-07-02T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 7367266
zbMATH Keywords: matrix scaling
zbMATH Keywords: alternate minimization
zbMATH Keywords: KL divergence
zbMATH Keywords: matchings
MaRDI profile type: MaRDI publication profile
full work available at URL: s10107-020-01503-3
OpenAlex ID: W3016365586
cites work: Quantum computing and hidden variables
cites work: Using optimization to break the epsilon barrier: a faster and simpler width-independent algorithm for solving positive linear programs in parallel
cites work: Estimating Nonnegative Matrices from Marginal Data
cites work: An extension of a theorem of Darroch and Ratcliff in loglinear models and its application to scaling multidimensional matrices
cites work: Q5580053
cites work: The diagonal equivalence of a nonnegative matrix to a stochastic matrix
cites work: I-divergence geometry of probability distributions and minimization problems
cites work: A geometric interpretation of Darroch and Ratcliff's generalized iterative scaling
cites work: On the scaling of multidimensional matrices
cites work: On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms
cites work: On the complexity of nonnegative-matrix scaling
cites work: On the complexity of general matrix scaling and entropy minimization via the RAS algorithm
cites work: The Sinkhorn–Knopp Algorithm: Convergence and Applications
cites work: A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
cites work: A parallel approximation algorithm for positive linear programming
cites work: Approximating the solution to mixed packing and covering LPs in parallel \(\widetilde O(\varepsilon^{-3})\) time
cites work: Reduction of a Matrix with Positive Elements to a Doubly Stochastic Matrix
cites work: A user's guide to measure theoretic probability
cites work: On pairs of multidimensional matrices
cites work: Approximate distributions of order statistics. With applications to nonparametric statistics
cites work: Matrix scaling by network flow
cites work: Scalings of matrices which have prespecified row sums and column sums via optimization
cites work: Convergence of the iterative proportional fitting procedure
cites work: Q4477677
cites work: Diagonal Equivalence to Matrices with Prescribed Row and Column Sums
cites work: Concerning nonnegative matrices and doubly stochastic matrices
cites work: The rate of convergence of Sinkhorn balancing
DOI: 10.1007/S10107-020-01503-3
description: scientific article; zbMATH DE number 7367266