Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms

DOI10.1109/TIT.2005.850085zbMath1283.94023WikidataQ56431752 ScholiaQ56431752MaRDI QIDQ3547852

William T. Freeman, Jonathan S. Yedidia, Yair Weiss

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Detection theory in information and communication theory (94A13)

Related Items (only showing first 100 items - show all)

Learning causal Bayesian networks using minimum free energy principle ⋮ Improving probabilistic inference in graphical models with determinism and cycles ⋮ Applicability of \(n\)-vicinity method for calculation of free energy of Ising model ⋮ Active inference on discrete state-spaces: a synthesis ⋮ The Moon illusion explained by the projective consciousness model ⋮ Perceptual grouping and the interactions between visual cortical areas ⋮ Graphical models for statistical inference and data assimilation ⋮ Loop calculus in statistical physics and information science ⋮ Loop series for discrete statistical models on graphs ⋮ A New Inference Framework for Dependency Networks ⋮ Parallel finite element technique using Gaussian belief propagation ⋮ Minimal model of permutation symmetry in unsupervised learning ⋮ Belief Propagation in Networks of Spiking Neurons ⋮ Information diffusion in social sensing ⋮ Cycle-based cluster variational method for direct and inverse inference ⋮ Multicuts and perturb \& MAP for probabilistic graph clustering ⋮ An exemplar-based clustering using efficient variational message passing ⋮ On the number of limit cycles in diluted neural networks ⋮ Limits of discrete distributions and Gibbs measures on random graphs ⋮ Proof of the satisfiability conjecture for large \(k\) ⋮ Hierarchical semi-Markov conditional random fields for deep recursive sequential data ⋮ Improved generalized belief propagation for vision processing ⋮ Phase Transitions for the Uniform Distribution in the Pattern Maximum Likelihood Problem and its Bethe Approximation ⋮ Long-range correlations improve understanding of the influence of network structure on contact dynamics ⋮ Optimal segmentation of directed graph and the minimum number of feedback arcs ⋮ Fast structured prediction using large margin sigmoid belief networks ⋮ Deformable model fitting by regularized landmark mean-shift ⋮ A new probabilistic constraint logic programming language based on a generalised distribution semantics ⋮ Iterative multiplicative filters for data labeling ⋮ \textit{Kernel cuts}: kernel and spectral clustering meet regularization ⋮ Monotonic optimization based decoding for linear codes ⋮ Optimal control as a graphical model inference problem ⋮ Convergence and Correctness of Max-Product Belief Propagation for Linear Programming ⋮ Image labeling by assignment ⋮ Reference classes and relational learning ⋮ Factor models on locally tree-like graphs ⋮ Recursive sum-product algorithm for generalized outer-planar graphs ⋮ Markov models for image labeling ⋮ Generalized belief propagation for the magnetization of the simple cubic Ising model ⋮ Region graph partition function expansion and approximate free energy landscapes: theory and some numerical results ⋮ Learning multi-linear representations of distributions for efficient inference ⋮ Piecewise training for structured prediction ⋮ Spike-Based Probabilistic Inference in Analog Graphical Models Using Interspike-Interval Coding ⋮ Improved High Dimensional Discrete Bayesian Network Inference using Triplet Region Construction ⋮ Active Inference: A Process Theory ⋮ Two faces of greedy leaf removal procedure on graphs ⋮ Moment-closure approximations for discrete adaptive networks ⋮ Robustifying sum-product networks ⋮ Message-passing algorithms for inference and optimization ⋮ Neural network implementation of inference on binary Markov random fields with probability coding ⋮ Assignment Flows ⋮ Investigation of commuting Hamiltonian in quantum Markov network ⋮ Statistical mechanics of complex neural systems and high dimensional data ⋮ Approximate inverse Ising models close to a Bethe reference point ⋮ Conditional random fields for pattern recognition applied to structured data ⋮ Random field Ising model in two dimensions: Bethe approximation, cluster variational method and message passing algorithms ⋮ On one-step replica symmetry breaking in the Edwards–Anderson spin glass model ⋮ Statistical mechanics of unsupervised feature learning in a restricted Boltzmann machine with binary synapses ⋮ Generalizedk-core pruning process on directed networks ⋮ Variational approximations for stochastic dynamics on graphs ⋮ Latent binary MRF for online reconstruction of large scale systems ⋮ The Discrete and Continuous Brain: From Decisions to Movement—And Back Again ⋮ Active Inference, Belief Propagation, and the Bethe Approximation ⋮ Learning Bayesian network parameters under equivalence constraints ⋮ Diagonal stationary points of the Bethe functional ⋮ Probabilistic Graphical Models and Markov Networks ⋮ A Review of Estimation of Distribution Algorithms and Markov Networks ⋮ MN-EDA and the Use of Clique-Based Factorisations in EDAs ⋮ Fast Fitness Improvements in Estimation of Distribution Algorithms Using Belief Propagation ⋮ A review of message passing algorithms in estimation of distribution algorithms ⋮ Importance sampling-based estimation over AND/OR search spaces for graphical models ⋮ A factor graph model for unsupervised feature selection ⋮ SampleSearch: importance sampling in presence of determinism ⋮ Bounded approximate decentralised coordination via the max-sum algorithm ⋮ Replica cluster variational method ⋮ Leveraging belief propagation, backtrack search, and statistics for model counting ⋮ Generalised free energy and active inference ⋮ Uncovering latent structure in valued graphs: a variational approach ⋮ Learning adaptive regularization for image labeling using geometric assignment ⋮ Image Labeling Based on Graphical Models Using Wasserstein Messages and Geometric Assignment ⋮ Combinatorial resampling particle filter: an effective and efficient method for articulated object tracking ⋮ Systems of Bounded Rational Agents with Information-Theoretic Constraints ⋮ An exactly solvable ansatz for statistical mechanics models ⋮ Relaxed maximum a posteriori fault identification ⋮ Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited ⋮ Fermions and loops on graphs: I. Loop calculus for determinants ⋮ Belief propagation guided decimation algorithms for random constraint satisfaction problems with growing domains ⋮ Multimarginal Optimal Transport with a Tree-Structured Cost and the Schrödinger Bridge Problem ⋮ Whence the Expected Free Energy? ⋮ Sophisticated Inference ⋮ A Generalization of Spatial Monte Carlo Integration ⋮ Convex combination belief propagation ⋮ Segmentation and Skeletonization on Arbitrary Graphs Using Multiscale Morphology and Active Contours ⋮ Unbiasing in iterative reconstruction algorithms for discrete compressed sensing ⋮ A Tight Analysis of Bethe Approximation for Permanent ⋮ Gaussian Belief Propagation Solvers for Nonsymmetric Systems of Linear Equations ⋮ Unnamed Item ⋮ Sub-sample swapping for sequential Monte Carlo approximation of high-dimensional densities in the context of complex object tracking ⋮ Energy distribution view for monotonic dual decomposition ⋮ Belief propagation as diffusion

This page was built for publication: Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms