Geometry of EM and related iterative algorithms

DOI10.1007/S41884-022-00080-YarXiv2209.01301OpenAlexW4309405349MaRDI QIDQ6138788

Shotaro Akaho, Noboru Murata, Hideitsu Hino

Publication date: 16 January 2024

Published in: Information Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.01301

zbMATH Keywords

EM algorithminformation theoryrobust statisticsinformation geometryBregman divergencegenerative models\textit{em} algorithm

Mathematics Subject Classification ID

Parametric inference (62Fxx) Nonparametric inference (62Gxx) Sufficiency and information (62Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bagging predictors
• Nonparametric information geometry: from divergence function to referential-representational biduality on statistical manifolds
• Information estimators for weighted observations
• Statistical guarantees for the EM algorithm: from population to sample-based analysis
• Regression towards the mode
• Mode regression
• A modified EM algorithm for mixture models based on Bregman divergence
• Dual connections in nonparametric classical information geometry
• On the convergence properties of the EM algorithm
• Extensions of estimation methods using the EM algorithm
• Gradient systems in view of information geometry
• Information geometry of estimating functions in semi-parametric statistical models
• A decision-theoretic generalization of on-line learning and an application to boosting
• Non-parametric entropy estimators based on simple linear regression
• Classification by pairwise coupling
• A infinite-dimensional geometric structure on the space of all the probability measures equivalent to a given one
• Estimation of neural connections from partially observed neural spikes
• Geometry of Arimoto algorithm
• Information geometry of modal linear regression
• An Estimation of Generalized Bradley-Terry Models Based on the em Algorithm
• Maximum likelihood estimation via the ECM algorithm: A general framework
• Local modal regression
• A Grouped Ranking Model for Item Preference Parameter
• Modal Principal Component Analysis
• Robust Boosting Algorithm Against Mislabeling in Multiclass Problems
• The EM Algorithm and Extensions, 2E
• Information Geometry of Turbo and Low-Density Parity-Check Codes
• On asymptotic properties of predictive distributions
• Information geometry on hierarchy of probability distributions
• On Parametric Bootstrapping and Bayesian Prediction
• Information Geometry of U-Boost and Bregman Divergence
• Principal Component Analysis for Gaussian Process Posteriors
• Estimating Divergence Functionals and the Likelihood Ratio by Convex Risk Minimization
• Information Geometry
• Nonparametric e-Mixture Estimation
• Statistical Inference for Probabilistic Functions of Finite State Markov Chains
• An algorithm for computing the capacity of arbitrary discrete memoryless channels
• Active learning by query by committee with robust divergences

This page was built for publication: Geometry of EM and related iterative algorithms