Understanding the Bethe Approximation: When and How can it go Wrong?

No abstract is available for this paper.

• Publication year

  2014

• Venue

  Conference on Uncertainty in Artificial Intelligence

• Publication date

  2014-07-23

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Marginal Inference in MRFs using Frank-Wolfe

  2013cited by this paper
• Revisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization

  2013cited by this paper
• Approximating the Bethe Partition Function

  2013cited by this paper
• On MAP Inference by MWSS on Perfect Graphs

  2013influential reference
• Learning Low-order Models for Enforcing High-order Statistics

  2012cited by this paper
• Belief Propagation

  2012cited by this paper
• Bethe Bounds and Approximating the Global Optimum

  2012influential reference
• The Bethe Partition Function of Log-supermodular Graphical Models

  2012influential reference
• Complexity of Bethe Approximation

  2011cited by this paper
• What Cannot be Learned with Bethe Approximations

  2011cited by this paper
• Uniqueness of Belief Propagation on Signed Graphs

  2011cited by this paper
• Introduction to dual composition for inference

  2011cited by this paper
• Approximate inference in graphical models using lp relaxations

  2010influential reference
• Primal View on Belief Propagation

  2010cited by this paper
• Nonlinear Programming

  2010cited by this paper
• libDAI: A Free and Open Source C++ Library for Discrete Approximate Inference in Graphical Models

  2010cited by this paper
• 1 Introduction to Dual Decomposition for Inference

  2010cited by this paper
• Convexifying the Bethe Free Energy

  2009cited by this paper
• Geometry of cuts and metrics

  2009influential reference
• Graphical Models, Exponential Families, and Variational Inference

  2008influential reference
• New Outer Bounds on the Marginal Polytope

  2007influential reference
• Accuracy Bounds for Belief Propagation

  2007influential reference
• Index Terms

  2007cited by this paper
• Loop Series and Bethe Variational Bounds in Attractive Graphical Models

  2007cited by this paper
• Estimating the "Wrong" Graphical Model: Benefits in the Computation-Limited Setting

  2006cited by this paper
• Loop series for discrete statistical models on graphs

  2006cited by this paper
• On the properties of the Bethe approximation and loopy belief propagation on binary networks

  2005influential reference
• On the Uniqueness of Loopy Belief Propagation Fixed Points

  2004influential reference
• Understanding belief propagation and its generalizations

  2003cited by this paper
• Approximate Inference and Constrained Optimization

  2002cited by this paper
• A new class of upper bounds on the log partition function

  2002cited by this paper
• Stable Fixed Points of Loopy Belief Propagation Are Minima of the Bethe Free Energy

  2002cited by this paper
• Stable Fixed Points of Loopy Belief Propagation Are Local Minima of the Bethe Free Energy

  2002cited by this paper
• Belief Propagation and Statistical Physics

  2002cited by this paper
• Belief Optimization for Binary Networks: A Stable Alternative to Loopy Belief Propagation

  2001influential reference
• Graphical Models and Iterative Decoding

  2000cited by this paper
• Correctness of Local Probability Propagation in Graphical Models with Loops

  2000cited by this paper
• Loopy Belief Propagation for Approximate Inference: An Empirical Study

  1999cited by this paper
• Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm

  1998cited by this paper
• On cuts and matchings in planar graphs

  1993cited by this paper
• Approximating Probabilistic Inference in Bayesian Belief Networks is NP-Hard

  1993cited by this paper
• The Computational Complexity of Probabilistic Inference Using Bayesian Belief Networks

  1990cited by this paper
• On the cut polytope

  1986influential reference
• The Complexity of Computing the Permanent

  1979cited by this paper
• An algorithm for quadratic programming

  1956cited by this paper

• Graph-Cover-based Characterization of the Bethe Partition Function of Double-Edge Factor Graphs

  2025cites this paper
• The Bethe Partition Function and the SPA for Factor Graphs based on Homogeneous Real Stable Polynomials

  2024cites this paper
• What type of inference is planning?

  2024cites this paper
• Circular Belief Propagation for Approximate Probabilistic Inference

  2024cites this paper
• Belief propagation on networks with cliques and chordless cycles.

  2023cites this paper
• Fixing the Bethe approximation: How structural modifications in a graph improve belief propagation

  2022influential citation
• Understanding the Behavior of Belief Propagation

  2022cites this paper
• Convergence behavior of belief propagation: estimating regions of attraction via Lyapunov functions

  2021cites this paper
• Variational Message Passing and Local Constraint Manipulation in Factor Graphs

  2021cites this paper
• Region-based Energy Neural Network for Approximate Inference

  2020cites this paper
• Belief propagation: accurate marginals or accurate partition function—where is the difference?

  2020cites this paper
• Belief Propagation, Bethe Approximation and Polynomials

  2019cites this paper
• TIZED BETHE FREE ENERGY MINIMIZATION

  2019cites this paper
• Amortized Bethe Free Energy Minimization for Learning MRFs

  2019cites this paper
• Guided Selection of Accurate Belief Propagation Fixed Points

  2019cites this paper
• Self-Guided Belief Propagation – A Homotopy Continuation Method

  2018influential citation
• Uprooting and Rerooting Higher-Order Graphical Models

  2017cites this paper
• Gauging variational inference

  2017cites this paper
• Belief propagation, bethe approximation and polynomials

  2017cites this paper
• Exact MAP Inference by Avoiding Fractional Vertices

  2017influential citation
• Non-uniform Subset Selection for Active Learning in Structured Data

  2017cites this paper
• Uprooting and Rerooting Graphical Models

  2016cites this paper
• Statistical mechanics approach for collaborative business social network reconstruction

  2016cites this paper
• Tight Variational Bounds via Random Projections and I-Projections

  2015cites this paper
• Clamping Improves TRW and Mean Field Approximations

  2015influential citation
• Bethe and Related Pairwise Entropy Approximations

  2015influential citation
• Clamping Variables and Approximate Inference

  2014influential citation
• Methods for Inference in Graphical Models

  2014cites this paper
• Approximating the Bethe Partition Function

  2013cites this paper