Computing loop corrections by message passing

  title={Computing loop corrections by message passing},
  author={Abolfazl Ramezanpour},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  volume={87 6},
  • A. Ramezanpour
  • Published 29 November 2012
  • Computer Science
  • Physical review. E, Statistical, nonlinear, and soft matter physics
Any spanning tree in a loopy interaction graph can be used for communicating the effect of the loopy interactions by introducing messages that are passed along the edges in the spanning tree. This defines an exact mapping of the problem on the loopy interaction graph onto an extended problem on a tree interaction graph, where the thermodynamic quantities can be computed by a message-passing algorithm based on the Bethe equations. We propose an approximation loop correction algorithm for the… 

Figures from this paper

Statistical physics of loopy interactions: Independent-loop approximation and beyond
This work considers an interacting system of spin variables on a loopy interaction graph, identified by a tree graph and a set of loopy interactions, and finds the sum over the loop configurations can be computed "exactly" by the belief propagation algorithm in the low orders of the approximation as long as the loops have a tree structure.
Cycle-Based Cluster Variational Method for Direct and Inverse Inference
This work addresses both the direct and inverse problem with mean-field methods of statistical physics, going beyond the Bethe approximation and associated belief propagation algorithm, and proposes two complementary methods based respectively on fixed point equations and on a one-parameter log likelihood function minimization.
Distance measures and evolution of polymer chains in their topological space.
This study provides a first theoretical framework for topological transition, i.e. conformational transitions that are associated with changes in molecular topology, and presents an algorithm for estimating the number of intermediate topologies visited during a topological reaction.


Loop series for discrete statistical models on graphs
The derivation details, logic, and motivation for the three loop calculus introduced in Chertkov and Chernyak (2006) are presented and local gauge symmetry transformations that clarify an important invariant feature of the BP solution are revealed.
Sign problem in the Bethe approximation
We propose a message-passing algorithm to compute the Hamiltonian expectation with respect to an appropriate class of trial wave functions for an interacting system of fermions. To this end, we
How to compute loop corrections to the Bethe approximation
We introduce a method for computing corrections to the Bethe approximation for spin models on arbitrary lattices. Unlike cluster variational methods, the new approach takes into account fluctuations
Factor graphs and the sum-product algorithm
A generic message-passing algorithm, the sum-product algorithm, that operates in a factor graph, that computes-either exactly or approximately-various marginal functions derived from the global function.
Constructing free-energy approximations and generalized belief propagation algorithms
This work explains how to obtain region-based free energy approximations that improve the Bethe approximation, and corresponding generalized belief propagation (GBP) algorithms, and describes empirical results showing that GBP can significantly outperform BP.
Tree-based reparameterization framework for analysis of sum-product and related algorithms
We present a tree-based reparameterization (TRP) framework that provides a new conceptual view of a large class of algorithms for computing approximate marginals in graphs with cycles. This class
Statistical physics approach to graphical games: local and global interactions
A representation of games that extends over graphical games to deal conveniently with both local a global interactions and the cavity method of statistical physics to study the geometrical structure of the equilibria space is considered.
The Bethe lattice spin glass revisited
Abstract:So far the problem of a spin glass on a Bethe lattice has been solved only at the replica symmetric level, which is wrong in the spin glass phase. Because of some technical difficulties,
Loop expansion around the Bethe–Peierls approximation for lattice models
We develop an effective field theory for lattice models, in which the only non-vanishing diagrams exactly reproduce the topology of the lattice. The Bethe–Peierls approximation appears naturally as
Cluster Variation Method in Statistical Physics and Probabilistic Graphical Models
The cluster variation method (CVM) is a hierarchy of approximate variational techniques for discrete (Ising-like) models in equilibrium statistical mechanics, improving on the mean-field