Mean Field Theory for Sigmoid Belief Networks
L. K. Saul, T. Jaakkola, M. I. Jordan
Abstract
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 utility of this framework on a benchmark problem in statistical pattern recognition---the classification of handwritten digits.
Create a lesson
Related papers
FDE-Gym: The Last Mile of AI Delivery
Dongxu Yang, Hongda Yan, Renxin Wang et al.
MLExpert: Towards a Generalist Agentic Model for Autonomous Machine Learning Engineering
Shangheng Du, Jinxin Shi, Shuaiyu Zhang et al.
Evaluation Awareness Beyond English: Do LLMs Act Differently When Tested in Indic Languages?
Trizal Garg, Sibayan Mitra, Arya Karanjkar et al.
KnowGPO: Knowledge-Grouped Policy Optimization for Search Agents
Siqi Chen, Zhengxi Lu, Yuchen Yan et al.
Designing Transformers for Continuous Diffusion Language Models
Weijian Luo, Yujian Chen, Hao Jiang et al.
A team of Gemini 4 Argon agents beats Minecraft
Maxence Faldor, Satinder Singh, Roberta Raileanu