A tighter bound for graphical models M.A.R. Leisink.pdf

A tighter bound for graphical models M.A.R. Leisink.pdf

  1. 1、本文档共7页,可阅读全部内容。
  2. 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
A tighter bound for graphical models M.A.R. Leisink

A tighter bound for graphical modelsM.A.R. Leisink and H.J. KappenyDepartment of BiophysicsUniversity of Nijmegen, Geert Grooteplein 21NL 6525 EZ Nijmegen, The Netherlandsfmartijn,bertg@mbfys.kun.nlAbstractWe present a method to bound the partition function of a Boltz-mannmachine neural network with any odd order polynomial. Thisis a direct extension of the mean eld bound, which is rst order.We show that the third order bound is strictly better than mean eld. Additionally we show the rough outline how this bound isapplicable to sigmoid belief networks. Numerical experiments in-dicate that an error reduction of a factor two is easily reached inthe region where expansion based approximations are useful.1 IntroductionGraphical models have the capability to model a large class of probability distri-butions. The neurons in these networks are the random variables, whereas theconnections between them model the causal dependencies. Usually, some of thenodes have a direct relation with the random variables in the problem and arecalled `visibles. The other nodes, known as `hiddens, are used to model morecomplex probability distributions.Learning in graphical models can be done as long as the likelihood that the visiblescorrespond to a pattern in the data set, can be computed. In general the time ittakes, scales exponentially with the number of hidden neurons. For such architec-tures one has no other choice than using an approximation for the likelihood.A well known approximation technique from statistical mechanics, called Gibbssampling, was applied to graphical models in [1]. More recently, the mean eldapproximation known from physics was derived for sigmoid belief networks [2]. Forthis type of graphical models the parental dependency of a neuron is modelled by anon-linear (sigmoidal) function of the weighted parent states [3]. It turns out thatthe mean eld approximation has the nice feature that it bounds the likelihoodfrom below. This is useful for learning, since a m

文档评论(0)

l215322 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档