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

基于混合多项式的混合模型估计

Estimating Mixture Models via Mixtures of Polynomials

Stanford University(斯坦福大学)

Sida I. Wang, Arun Tejasvi Chaganty, Percy Liang

摘要:

混合建模是一种通过加权组合使任何简单模型更具表达力的通用技术。这种通用性和简单性部分解释了期望最大化(EM)算法的成功,在该算法中,很容易为广泛的混合模型导出更新。然而,混合模型的可能性是非凸的,因此EM没有已知的全局收敛保证。最近,矩量法方法提供了一些混合模型的全局保证,但它们不容易扩展到现有的混合模型的范围。在这项工作中,我们提出了Polymom,一个统一的框架,基于矩量法的估计程序很容易推导,就像在EM。当单个混合组分的矩是参数的多项式时,多项式是适用的。我们的关键观察是,混合模型的矩是这些多项式的混合,这使我们能够将估计转换为广义矩问题。我们使用半定优化来求解其松弛,然后使用计算机代数的思想来提取参数。这个框架使我们能够从凸优化,计算机代数和矩理论中汲取见解和应用工具来研究统计估计中的问题。

英文摘要:

Mixture modeling is a general technique for making any simple model more expressive through weighted combination. This generality and simplicity in part explains the success of the Expectation Maximization (EM) algorithm, in which updates are easy to derive for a wide class of mixture models. However, the likelihood of a mixture model is non-convex, so EM has no known global convergence guarantees. Recently, method of moments approaches offer global guarantees for some mixture models, but they do not extend easily to the range of mixture models that exist. In this work, we present Polymom, an unifying framework based on method of moments in which estimation procedures are easily derivable, just as in EM. Polymom is applicable when the moments of a single mixture component are polynomials of the parameters. Our key observation is that the moments of the mixture model are a mixture of these polynomials, which allows us to cast estimation as a Generalized Moment Problem. We solve its relaxations using semidefinite optimization, and then extract parameters using ideas from computer algebra. This framework allows us to draw insights and apply tools from convex optimization, computer algebra and the theory of moments to study problems in statistical estimation.

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

↑