arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2209.01301stat.MLcs.LG
收藏

EM的几何及相关迭代算法

Geometry of EM and related iterative algorithms

The Institute of Statistical Mathematics(统计数学研究所);RIKEN AIP(理化学研究所人工智能研究中心);The National Institute of Advanced Industrial Science and Technology(产业技术综合研究所);Waseda University(早稻田大学)

Hideitsu Hino, Shotaro Akaho, Noboru Murata

摘要:

期望最大化(EM)算法是一种简单的元算法,多年来一直被用作观测数据中存在缺失测量或数据由可观测量和不可观测量组成时的统计推断方法。它的一般性质已经得到了很好的研究,而且,有无数种方法可以将它应用于个别问题。在本文中,我们介绍了$em$算法,信息几何公式的期望最大化算法,其扩展和应用到各种问题。具体而言,我们将看到,可以制定异常鲁棒推理算法,用于计算信道容量的算法,概率单纯形上的参数估计方法,特别是多变量分析方法,例如概率模型空间中的主成分分析和模态回归,矩阵分解和学习生成模型,这些方法最近在深度学习中引起了关注,从几何学的角度来看。

英文摘要:

The Expectation--Maximization (EM) algorithm is a simple meta-algorithm that has been used for many years as a methodology for statistical inference when there are missing measurements in the observed data or when the data is composed of observables and unobservables. Its general properties are well studied, and also, there are countless ways to apply it to individual problems. In this paper, we introduce the $em$ algorithm, an information geometric formulation of the EM algorithm, and its extensions and applications to various problems. Specifically, we will see that it is possible to formulate an outlier-robust inference algorithm, an algorithm for calculating channel capacity, parameter estimation methods on probability simplex, particular multivariate analysis methods such as principal component analysis in a space of probability models and modal regression, matrix factorization, and learning generative models, which have recently attracted attention in deep learning, from the geometric perspective.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑