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

68T37: Reasoning under uncertainty in the context of artificial intelligence

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

94A13: Detection theory in information and communication theory

Related Items

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, Image Labeling Based on Graphical Models Using Wasserstein Messages and Geometric Assignment, 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, Improved High Dimensional Discrete Bayesian Network Inference using Triplet Region Construction, Two faces of greedy leaf removal procedure on graphs, 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, Segmentation and Skeletonization on Arbitrary Graphs Using Multiscale Morphology and Active Contours, A New Inference Framework for Dependency Networks, Phase Transitions for the Uniform Distribution in the Pattern Maximum Likelihood Problem and its Bethe Approximation, Convergence and Correctness of Max-Product Belief Propagation for Linear Programming, Spike-Based Probabilistic Inference in Analog Graphical Models Using Interspike-Interval Coding, Active Inference: A Process Theory, Active Inference, Curiosity and Insight, Gibbs states and the set of solutions of random constraint satisfaction problems, Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting, Gauging variational inference, The cavity master equation: average and fixed point of the ferromagnetic model in random graphs, Gauges, loops, and polynomials for partition functions of graphical models, Belief propagation: accurate marginals or accurate partition function—where is the difference?, Dynamic Sampling from Graphical Models, Learning causal Bayesian networks using minimum free energy principle, Parallel finite element technique using Gaussian belief propagation, Information diffusion in social sensing, Cycle-based cluster variational method for direct and inverse inference, Multicuts and perturb \& MAP for probabilistic graph clustering, Deformable model fitting by regularized landmark mean-shift, Optimal control as a graphical model inference problem, Reference classes and relational learning, Recursive sum-product algorithm for generalized outer-planar graphs, Region graph partition function expansion and approximate free energy landscapes: theory and some numerical results, Investigation of commuting Hamiltonian in quantum Markov network, Latent binary MRF for online reconstruction of large scale systems, Learning Bayesian network parameters under equivalence constraints, Diagonal stationary points of the Bethe functional, SampleSearch: importance sampling in presence of determinism, Bounded approximate decentralised coordination via the max-sum algorithm, Leveraging belief propagation, backtrack search, and statistics for model counting, Improved generalized belief propagation for vision processing, Long-range correlations improve understanding of the influence of network structure on contact dynamics, Message-passing algorithms for inference and optimization, Active inference on discrete state-spaces: a synthesis, The Moon illusion explained by the projective consciousness model, A new probabilistic constraint logic programming language based on a generalised distribution semantics, Replica cluster variational method, Uncovering latent structure in valued graphs: a variational approach, Relaxed maximum a posteriori fault identification, Applicability of \(n\)-vicinity method for calculation of free energy of Ising model, Optimal segmentation of directed graph and the minimum number of feedback arcs, Image labeling by assignment, Robustifying sum-product networks, Neural network implementation of inference on binary Markov random fields with probability coding, Conditional random fields for pattern recognition applied to structured data, Importance sampling-based estimation over AND/OR search spaces for graphical models, Combinatorial resampling particle filter: an effective and efficient method for articulated object tracking, Perceptual grouping and the interactions between visual cortical areas, Fast structured prediction using large margin sigmoid belief networks, Monotonic optimization based decoding for linear codes, Markov models for image labeling, Learning multi-linear representations of distributions for efficient inference, Piecewise training for structured prediction, A review of message passing algorithms in estimation of distribution algorithms, A factor graph model for unsupervised feature selection, Learning adaptive regularization for image labeling using geometric assignment, Iterative multiplicative filters for data labeling, \textit{Kernel cuts}: kernel and spectral clustering meet regularization, Generalised free energy and active inference, 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, Improving probabilistic inference in graphical models with determinism and cycles, Graphical models for statistical inference and data assimilation, Limits of discrete distributions and Gibbs measures on random graphs, Hierarchical semi-Markov conditional random fields for deep recursive sequential data, Factor models on locally tree-like graphs, Generalized belief propagation for the magnetization of the simple cubic Ising model, Moment-closure approximations for discrete adaptive networks, An exemplar-based clustering using efficient variational message passing, On the number of limit cycles in diluted neural networks, Unnamed Item, Loop calculus in statistical physics and information science, Loop series for discrete statistical models on graphs, Belief Propagation in Networks of Spiking Neurons, Assignment Flows, Statistical mechanics of complex neural systems and high dimensional data, Approximate inverse Ising models close to a Bethe reference point, 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