Mean Field Theory for Sigmoid Belief Networks
We develop a mean field theory for sigmoid belief networks based on ideas from statistical mechanics. Our mean field theory provides a tractable approximation to the true probability distribution in these networks; it also yields a lower bound on the likelihood of evidence. We demonstrate the...
Main Authors: | Saul, Lawrence K., Jaakkola, Tommi, Jordan, Michael I. |
---|---|
Language: | en_US |
Published: |
2004
|
Online Access: | http://hdl.handle.net/1721.1/6652 |
Similar Items
-
Fast Learning by Bounding Likelihoods in Sigmoid Type Belief Networks
by: Jaakkola, Tommi S., et al.
Published: (2004) -
Computing Upper and Lower Bounds on Likelihoods in Intractable Networks
by: Jaakkola, Tommi S., et al.
Published: (2004) -
Two-Step Implementation of Sigmoid Function for Artificial Neural Network in Field Programmable Gate Array
by: Syahrulanuar, Ngah, et al.
Published: (2014) -
Two-Steps Implementation of Sigmoid Function for Artificial Neural Network in Field Programmable Gate Array
by: Syahrulanuar, Ngah, et al.
Published: (2016) -
QUIET-SUN NETWORK BRIGHT POINT PHENOMENA WITH SIGMOIDAL SIGNATURES
by: Chesny, D. L., et al.
Published: (2016)