Clamping Variables and Approximate Inference

No abstract is available for this paper.

• Publication year

  2014

• Venue

  Neural Information Processing Systems

• Publication date

  2014-12-08

• 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.

• Clamping Improves TRW and Mean Field Approximations

  2015cited by this paper
• Belief Propagation

  2014cited by this paper
• Understanding the Bethe Approximation: When and How can it go Wrong?

  2014influential reference
• Marginal Inference in MRFs using Frank-Wolfe

  2013cited by this paper
• Approximating the Bethe Partition Function

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

  2012influential reference
• Approximating Marginals Using Discrete Energy Minimization

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

  2012cited by this paper
• Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function

  2010cited by this paper
• Feedback message passing for inference in gaussian graphical models

  2010cited by this paper
• Probabilistic Graphical Models: Principles and Techniques - Adaptive Computation and Machine Learning

  2009influential reference
• Convexifying the Bethe Free Energy

  2009cited by this paper
• Wiley Interdisciplinary Reviews

  2009cited by this paper
• Choosing a Variable to Clamp: Approximate Inference Using Conditioned Belief Propagation

  2009cited by this paper
• The expressive power of binary submodular functions

  2008cited by this paper
• Approximating the Partition Function by Deleting and then Correcting for Model Edges

  2008cited by this paper
• Graphical Models, Exponential Families, and Variational Inference

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

  2007cited by this paper
• TRANSFORMING AN ARBITRARY MINSUM PROBLEM INTO A BINARY ONE

  2006cited by this paper
• Understanding belief propagation and its generalizations

  2003cited by this paper
• Stochastic processes on graphs with cycles: geometric and variational approaches

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

  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
• Resolution versus Search: Two Strategies for SAT

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

  1999cited by this paper
• The Envelope Theorems

  1999cited by this paper
• A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem

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

  1998cited by this paper
• Pearl, J. (1988, second printing 1991). Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan-Kaufmann.

  1994cited by this paper
• Probabilistic reasoning in intelligent systems: Networks of plausible inference

  1991cited by this paper
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems

  1991cited by this paper
• Fusion and Propagation with Multiple Observations in Belief Networks

  1991cited by this paper
• Local computations with probabilities on graphical structures and their application to expert systems

  1990cited by this paper
• Branch-and-Cut Algorithms for Combinatorial Optimization Problems

  1988cited by this paper
• Minimizing a Submodular Function on a Lattice

  1978cited by this paper
• Complexity of Computer Computations

  1972cited by this paper
• Topological proofs for certain theorems on matrices with non-negative elements

  1958cited by this paper
• An algorithm for quadratic programming

  1956cited by this paper
• On the notion of balance of a signed graph.

  1953cited by this paper

• Fixing the Bethe approximation: How structural modifications in a graph improve belief propagation

  2022cites this paper
• Understanding the Behavior of Belief Propagation

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

  2018cites this paper
• Structure in machine learning : graphical models and Monte Carlo methods

  2018cites this paper
• Lost Relatives of the Gumbel Trick

  2017cites this paper
• Approximation Guarantees for Sherali Adams Relaxations

  2017cites this paper
• Uprooting and Rerooting Higher-Order Graphical Models

  2017cites this paper
• Improving Optimization-Based Approximate Inference by Clamping Variables

  2017cites this paper
• Understanding Expectation Propagation

  2017cites this paper
• Stochastic Discrete Clenshaw-Curtis Quadrature

  2016cites this paper
• High Dimensional Inference With Random Maximum A-Posteriori Perturbations

  2016cites this paper
• Uprooting and Rerooting Graphical Models

  2016influential citation
• Analysis of double covers of factor graphs

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

  2015influential citation
• Bethe and Related Pairwise Entropy Approximations

  2015influential citation
• Generalized belief propagation for estimating the partition function of the 2D Ising model

  2015cites this paper
• Message Passing and Combinatorial Optimization

  2015cites this paper
• Methods for Inference in Graphical Models

  2014cites this paper