arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2110.04776cs.LGstat.ML
收藏

基于随机成分选择的大型混合模型拟合

Fitting large mixture models using stochastic component selection

Milan Papež, Tomáš Pevný, Václav Šmídl

摘要:

传统的有限混合模型的无监督学习方法需要评估混合模型中所有成分的似然性。当组件的数量很大时,这在计算上变得禁止,例如,在和积(变换)网络中。因此,我们建议应用的期望最大化和大都会黑斯廷斯算法的组合,以评估只有少量的,随机采样,组件,从而大大降低了计算成本。组件分配的马尔可夫链在算法的迭代中顺序生成,具有非平稳目标分布,其参数通过梯度下降方案而变化。我们把重点放在我们的方法的通用性,配备它的能力,训练浅和深的混合模型,涉及复杂的,可能是非线性的,转换。我们的方法的性能在各种合成和真实数据环境中进行了说明,考虑到深度模型,例如归一化流和和积(变换)网络的混合。

英文摘要:

Traditional methods for unsupervised learning of finite mixture models require to evaluate the likelihood of all components of the mixture. This becomes computationally prohibitive when the number of components is large, as it is, for example, in the sum-product (transform) networks. Therefore, we propose to apply a combination of the expectation maximization and the Metropolis-Hastings algorithm to evaluate only a small number of, stochastically sampled, components, thus substantially reducing the computational cost. The Markov chain of component assignments is sequentially generated across the algorithm's iterations, having a non-stationary target distribution whose parameters vary via a gradient-descent scheme. We put emphasis on generality of our method, equipping it with the ability to train both shallow and deep mixture models which involve complex, and possibly nonlinear, transformations. The performance of our method is illustrated in a variety of synthetic and real-data contexts, considering deep models, such as mixtures of normalizing flows and sum-product (transform) networks.

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

↑