DSpace Repository

Fast Learning by Bounding Likelihoods in Sigmoid Type Belief Networks

Show simple item record

dc.creator Jaakkola, Tommi S.
dc.creator Saul, Lawrence K.
dc.creator Jordan, Michael I.
dc.date 2004-10-20T20:49:15Z
dc.date 2004-10-20T20:49:15Z
dc.date 1996-02-09
dc.date.accessioned 2013-10-09T02:48:31Z
dc.date.available 2013-10-09T02:48:31Z
dc.date.issued 2013-10-09
dc.identifier AIM-1560
dc.identifier CBCL-129
dc.identifier http://hdl.handle.net/1721.1/7189
dc.identifier.uri http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description Sigmoid type belief networks, a class of probabilistic neural networks, provide a natural framework for compactly representing probabilistic information in a variety of unsupervised and supervised learning problems. Often the parameters used in these networks need to be learned from examples. Unfortunately, estimating the parameters via exact probabilistic calculations (i.e, the EM-algorithm) is intractable even for networks with fairly small numbers of hidden units. We propose to avoid the infeasibility of the E step by bounding likelihoods instead of computing them exactly. We introduce extended and complementary representations for these networks and show that the estimation of the network parameters can be made fast (reduced to quadratic optimization) by performing the estimation in either of the alternative domains. The complementary networks can be used for continuous density estimation as well.
dc.format 7 p.
dc.format 197474 bytes
dc.format 292170 bytes
dc.format application/postscript
dc.format application/pdf
dc.language en_US
dc.relation AIM-1560
dc.relation CBCL-129
dc.subject AI
dc.subject MIT
dc.subject Artificial Intelligence
dc.subject Belief networks
dc.subject Probabilistic networks
dc.subject EM algorithm
dc.subject Density estimation
dc.subject Likelihood bounds
dc.title Fast Learning by Bounding Likelihoods in Sigmoid Type Belief Networks


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account