Tree-based reparameterization framework for analysis of sum-product and related algorithms

DOI10.1109/TIT.2003.810642zbMath1063.68079MaRDI QIDQ4680078

Martin J. Wainwright, Alan S. Willsky, Tommi S. Jaakkola

Publication date: 1 June 2005

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (19)

Improving probabilistic inference in graphical models with determinism and cycles ⋮ Graphical models for statistical inference and data assimilation ⋮ Parallel finite element technique using Gaussian belief propagation ⋮ Graphical Models and Message-Passing Algorithms: Some Introductory Lectures ⋮ Multicuts and perturb \& MAP for probabilistic graph clustering ⋮ A nonparametric belief propagation method for uncertainty quantification with applications to flow in random porous media ⋮ Evaluations of Tutte polynomials of regular graphs ⋮ Counting degree-constrained subgraphs and orientations ⋮ On learning conditional random fields for stereo ⋮ Unnamed Item ⋮ Piecewise training for structured prediction ⋮ Message-passing algorithms for inference and optimization ⋮ Conditional random fields for pattern recognition applied to structured data ⋮ Data association based on optimization in graphical models with application to sensor networks ⋮ Understanding the scalability of Bayesian network inference using clique tree growth curves ⋮ Learning and approximate inference in dynamic hierarchical models ⋮ Fermions and loops on graphs: I. Loop calculus for determinants ⋮ Gauging variational inference ⋮ Gauges, loops, and polynomials for partition functions of graphical models

This page was built for publication: Tree-based reparameterization framework for analysis of sum-product and related algorithms