Iterated proportional fitting procedure and infinite products of stochastic matrices
Jean Brossard, Christophe Leuridan

TL;DR
This paper studies the convergence properties of the iterative proportional fitting procedure, linking it to infinite products of stochastic matrices, and introduces new methods to analyze divergence and convergence in these matrix sequences.
Contribution
The authors develop a new convergence theorem for backward infinite products of stochastic matrices, extending Lorenz's stabilization theorem, and apply it to analyze the iterative proportional fitting procedure.
Findings
Convergence of the iterative proportional fitting sequence when a biproportional fit exists.
Identification of two limit points in divergence cases.
Enhanced understanding of infinite products of stochastic matrices with bounded entries.
Abstract
The iterative proportional fitting procedure, introduced in 1937 by Kruithof, aims to adjust the elements of an array to satisfy specified row and column sums. Given a rectangular non-negative matrix and two positive marginals and , the algorithm generates a sequence of matrices starting at , supposed to converge to a biproportional fitting, that is, to a matrix whose marginals are and and of the form , for some diagonal matrices and with positive diagonal entries. When a biproportional fitting does exist, it is unique and the sequence converges to it at an at least geometric rate. More generally, when there exists some matrix with marginal and and with support included in the support of , the sequence converges to the unique matrix whose marginals are and and which can be written as a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPoint processes and geometric inequalities · Mathematical Inequalities and Applications · Sparse and Compressive Sensing Techniques
