arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1603.06170cs.LGstat.ML
收藏

Helmholtz机的联合随机逼近学习

Joint Stochastic Approximation learning of Helmholtz Machines

Tsinghua University(清华大学)

Haotian Xu, Zhijian Ou

摘要:

尽管取得了进展,但模型学习和执行后验推理仍然是使用深度生成模型的常见挑战,特别是在处理离散隐变量时。本文主要研究Helmholz机的学习算法,其特点是将生成模型与辅助推理模型相结合。以前的学习算法的一个共同的缺点是,他们间接优化的目标边际对数似然的一些界限。相比之下,我们成功地开发了一类新的算法,基于随机逼近(SA)理论的罗宾斯-蒙罗型,直接优化的边际对数似然,同时最大限度地减少包容KL-分歧。由此产生的学习算法被称为联合SA(JSA)。此外,我们构造了一个有效的MCMC运营商的JSA。我们在MNIST数据集上的结果表明,JSA的性能始终优于RWS等竞争算法,用于学习一系列困难的模型。

英文摘要:

Though with progress, model learning and performing posterior inference still remains a common challenge for using deep generative models, especially for handling discrete hidden variables. This paper is mainly concerned with algorithms for learning Helmholz machines, which is characterized by pairing the generative model with an auxiliary inference model. A common drawback of previous learning algorithms is that they indirectly optimize some bounds of the targeted marginal log-likelihood. In contrast, we successfully develop a new class of algorithms, based on stochastic approximation (SA) theory of the Robbins-Monro type, to directly optimize the marginal log-likelihood and simultaneously minimize the inclusive KL-divergence. The resulting learning algorithm is thus called joint SA (JSA). Moreover, we construct an effective MCMC operator for JSA. Our results on the MNIST datasets demonstrate that the JSA's performance is consistently superior to that of competing algorithms like RWS, for learning a range of difficult models.

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

↑