A geometric interpretation of Darroch and Ratcliff's generalized iterative scaling

DOI10.1214/aos/1176347279zbMath0681.62010OpenAlexW1966917791MaRDI QIDQ1823572

Imre Csizár

Publication date: 1989

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aos/1176347279

zbMATH Keywords

iterative algorithmmaximum entropymaximum likelihoodminimumdiscrimination informationgeneralized iterative scalingI- projection operationsI-divergence geometrylinear contraintsminimizing I-divergence

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Statistical aspects of information-theoretic topics (62B10)

Related Items (12)

Graphical Models and Message-Passing Algorithms: Some Introductory Lectures ⋮ A general duality approach to \(I\)-projections ⋮ Unnamed Item ⋮ On maximum entropy and minimum KL-divergence optimization by Gröbner basis methods ⋮ Maximum likelihood estimation in log-linear models ⋮ An overview of algorithmic approaches to compute optimum entropy distributions in the expert system shell MECore (extended version) ⋮ Order independence and factor convergence in iterative scaling ⋮ A note on the geometric interpretation of the EM algorithm in estimating item characteristics and student abilities ⋮ Iterative proportional scaling via decomposable submodels for contingency tables ⋮ Unified generalized iterative scaling and its applications ⋮ An iterative procedure for general probability measures to obtain \(I\)-projections onto intersections of convex sets ⋮ Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling

This page was built for publication: A geometric interpretation of Darroch and Ratcliff's generalized iterative scaling