A double-loop algorithm to minimize the bethe free energy

DOI10.1007/3-540-44745-8_1MaRDI QIDQ4786033zbMATH OpenFDO

Authors Alan Yuille

Publication date 12 December 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2134/21340003

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Machine vision and scene understanding (68T45) Computing methodologies and applications (68U99)

Recommendations

• Convexity arguments for efficient minimization of the Bethe and Kikuchi free energies
• Stable propagation algorithm for the minimization of the Bethe free energy
• CCCP Algorithms to Minimize the Bethe and Kikuchi Free Energies: Convergent Alternatives to Belief Propagation
• On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
• Message-passing algorithms for inference and optimization

Cited in

(8)

• Energy distribution view for monotonic dual decomposition
• Improving probabilistic inference in graphical models with determinism and cycles
• A family of CCCP algorithms which minimize the TRW free energy
• CCCP Algorithms to Minimize the Bethe and Kikuchi Free Energies: Convergent Alternatives to Belief Propagation
• Sequential Minimization of the Bethe Free Energy of Ising Spin Systems
• Convexity arguments for efficient minimization of the Bethe and Kikuchi free energies
• Tree-based reparameterization framework for analysis of sum-product and related algorithms
• Stochastic Reasoning, Free Energy, and Information Geometry

This page was built for publication: A double-loop algorithm to minimize the bethe free energy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4786033)