arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1503.05571cs.LG
收藏

GSNs:生成随机网络

GSNs : Generative Stochastic Networks

University of Montreal(蒙特利尔大学);Cornell University(康奈尔大学)

Guillaume Alain, Yoshua Bengio, Li Yao, Jason Yosinski, Eric Thibodeau-Laufer, Saizheng Zhang, Pascal Vincent

摘要:

我们引入了一种新的概率模型训练原理,它是最大似然的替代方案。提出的生成随机网络(GSN)框架是基于学习马尔可夫链的转移算子,其平稳分布估计数据分布。由于过渡分布是一个条件分布,通常涉及一个小的移动,它有较少的主导模式,是单峰的限制小的移动。因此,它更容易学习,更像是学习执行监督函数逼近,梯度可以通过反向传播获得。这里提供的定理概括了最近关于去噪自动编码器的概率解释的工作,并为依赖网络和广义伪随机性提供了一个有趣的理由(以及定义适当的联合分布和采样机制,即使条件不一致)。我们研究了如何GSN可以与丢失的输入,并可以用来抽样的变量子集,其余的。在两个图像数据集上进行了成功的实验,验证了这些理论结果,并采用了一种特定的架构,该架构模仿了深度玻尔兹曼机吉布斯采样器,但允许训练进行反向传播,而不需要分层预训练。

英文摘要:

We introduce a novel training principle for probabilistic models that is an alternative to maximum likelihood. The proposed Generative Stochastic Networks (GSN) framework is based on learning the transition operator of a Markov chain whose stationary distribution estimates the data distribution. Because the transition distribution is a conditional distribution generally involving a small move, it has fewer dominant modes, being unimodal in the limit of small moves. Thus, it is easier to learn, more like learning to perform supervised function approximation, with gradients that can be obtained by back-propagation. The theorems provided here generalize recent work on the probabilistic interpretation of denoising auto-encoders and provide an interesting justification for dependency networks and generalized pseudolikelihood (along with defining an appropriate joint distribution and sampling mechanism, even when the conditionals are not consistent). We study how GSNs can be used with missing inputs and can be used to sample subsets of variables given the rest. Successful experiments are conducted, validating these theoretical results, on two image datasets and with a particular architecture that mimics the Deep Boltzmann Machine Gibbs sampler but allows training to proceed with backprop, without the need for layerwise pretraining.

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

↑