Linear Response Algorithms for Approximate Inference in Graphical Models

DOI10.1162/08997660460734056zbMath1097.68118OpenAlexW2098823658WikidataQ52001910 ScholiaQ52001910MaRDI QIDQ4823748

Yee Whye Teh, Max Welling

Publication date: 28 October 2004

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1162/08997660460734056

zbMATH Keywords

cyclic graphsBelief Propagation

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (3)

Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor Graphs ⋮ Approximate inverse Ising models close to a Bethe reference point ⋮ Unnamed Item

Cites Work

• Approximate inference in Boltzmann machines
• CCCP Algorithms to Minimize the Bethe and Kikuchi Free Energies: Convergent Alternatives to Belief Propagation
• Factor graphs and the sum-product algorithm
• Convergence analysis of turbo decoding of product codes

This page was built for publication: Linear Response Algorithms for Approximate Inference in Graphical Models