Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Introduction to the theory of neural computation
Introduction to the theory of neural computation
Elements of information theory
Elements of information theory
Graphical models for machine learning and digital communication
Graphical models for machine learning and digital communication
The Handbook of Brain Theory and Neural Networks
The Handbook of Brain Theory and Neural Networks
ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Flows suspending iterative algorithms
Flows suspending iterative algorithms
Stochastic processes on graphs with cycles: geometric and variational approaches
Stochastic processes on graphs with cycles: geometric and variational approaches
A novel optimizing network architecture with applications
Neural Computation
Loopy belief propagation for approximate inference: an empirical study
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Turbo decoding as an instance of Pearl's “belief propagation” algorithm
IEEE Journal on Selected Areas in Communications
Approximate inference in Boltzmann machines
Artificial Intelligence
Finding Deformable Shapes Using Loopy Belief Propagation
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Neural Computation
Linear response algorithms for approximate inference in graphical models
Neural Computation
Stochastic reasoning, free energy, and information geometry
Neural Computation
On the choice of regions for generalized belief propagation
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
On the uniqueness of loopy belief propagation fixed points
Neural Computation
Approximate factorizations of distributions and the minimum relative entropy principle
GECCO '05 Proceedings of the 7th annual workshop on Genetic and evolutionary computation
Estimation and Marginalization Using the Kikuchi Approximation Methods
Neural Computation
Expectation Consistent Approximate Inference
The Journal of Machine Learning Research
Loop Corrections for Approximate Inference on Factor Graphs
The Journal of Machine Learning Research
A new look at survey propagation and its generalizations
Journal of the ACM (JACM)
Efficient belief propagation for higher-order cliques using linear constraint nodes
Computer Vision and Image Understanding
MAP-Inference for Highly-Connected Graphs with DC-Programming
Proceedings of the 30th DAGM symposium on Pattern Recognition
On the Minima of Bethe Free Energy in Gaussian Distributions
ICAISC '08 Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing
Generalization of Concave and Convex Decomposition in Kikuchi Free Energy
ICANN '08 Proceedings of the 18th international conference on Artificial Neural Networks, Part I
Graphical Models, Exponential Families, and Variational Inference
Foundations and Trends® in Machine Learning
Occlusion Boundaries from Motion: Low-Level Detection and Mid-Level Reasoning
International Journal of Computer Vision
Message-passing and local heuristics as decimation strategies for satisfiability
Proceedings of the 2009 ACM symposium on Applied Computing
Loop Calculus for satisfiability
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Convexity arguments for efficient minimization of the Bethe and Kikuchi free energies
Journal of Artificial Intelligence Research
Graphical model inference in optimal control of stochastic multi-agent systems
Journal of Artificial Intelligence Research
Cortical circuitry implementing graphical models
Neural Computation
Leveraging belief propagation, backtrack search, and statistics for model counting
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Convergent message passing algorithms: a unifying view
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Convexifying the Bethe free energy
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Norm-product belief propagation: primal-dual message-passing for approximate inference
IEEE Transactions on Information Theory
Code-aided maximum-likelihood ambiguity resolution through free-energy minimization
IEEE Transactions on Signal Processing
Recovering Occlusion Boundaries from an Image
International Journal of Computer Vision
Expectation propagation for approximate inference in dynamic bayesian networks
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Approximate inference and constrained optimization
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Relax, compensate and then recover
JSAI-isAI'10 Proceedings of the 2010 international conference on New Frontiers in Artificial Intelligence
Structured Learning and Prediction in Computer Vision
Foundations and Trends® in Computer Graphics and Vision
Variational algorithms for marginal MAP
The Journal of Machine Learning Research
Hi-index | 0.06 |
This article introduces a class of discrete iterative algorithms that are provably convergent alternatives to belief propagation (BP) and generalized belief propagation (GBP). Our work builds on recent results by Yedidia, Freeman, and Weiss (2000), who showed that the fixed points of BP and GBP algorithms correspond to extrema of the Bethe and Kikuchi free energies, respectively. We obtain two algorithms by applying CCCP to the Bethe and Kikuchi free energies, respectively (CCCP is a procedure, introduced here, for obtaining discrete iterative algorithms by decomposing a cost function into a concave and a convex part). We implement our CCCP algorithms on two- and three-dimensional spin glasses and compare their results to BP and GBP. Our simulations show that the CCCP algorithms are stable and converge very quickly (the speed of CCCP is similar to that of BP and GBP). Unlike CCCP, BP will often not converge for these problems (GBP usually, but not always, converges). The results found by CCCP applied to the Bethe or Kikuchi free energies are equivalent, or slightly better than, those found by BP or GBP, respectively (when BP and GBP converge). Note that for these, and other problems, BP and GBP give very accurate results (see Yedidia et al., 2000), and failure to converge is their major error mode. Finally, we point out that our algorithms have a large range of inference and learning applications.