Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited

DOI10.1111/ANZS.12257OpenAlexW2955135267MaRDI QIDQ5229963FDOQ5229963

Author name not available (Why is that?)

Publication date: 19 August 2019

Published in: Australian <html_ent glyph="@amp;" ascii="&amp;"/> New Zealand Journal of Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.08544

Recommendations

• The necessity of bounded treewidth for efficient inference in Bayesian networks
• Tree-width and the computational complexity of MAP approximations in Bayesian networks
• scientific article
• Empirical comparison study of approximate methods for structure selection in binary graphical models
• scientific article; zbMATH DE number 6253970
• Robust Estimation of Latent Tree Graphical Models: Inferring Hidden States With Inexact Parameters
• scientific article; zbMATH DE number 1522721

zbMATH Keywords

hidden Markov modelsmessage passingvariational approximationsmarginalisationcomputational inferencemode evaluation

Mathematics Subject Classification ID

Nonparametric estimation (62G05) Markov processes: estimation; hidden Markov models (62M05) Estimation in multivariate analysis (62H12) Graphical methods in statistics (62A09) Research exposition (monographs, survey articles) pertaining to statistics (62-02)

Cites Work

• LibDAI: a free and open source C++ library for discrete approximate inference in graphical models
• Soft arc consistency revisited
• Graphical Models, Exponential Families, and Variational Inference
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Consistency of maximum-likelihood and variational estimators in the stochastic block model
• Machine learning. A probabilistic perspective
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Title not available (Why is that?)
• Approximating discrete probability distributions with dependence trees
• Title not available (Why is that?)
• An Approximate Minimum Degree Ordering Algorithm
• Title not available (Why is that?)
• Bayesian Networks and Decision Graphs
• Title not available (Why is that?)
• A partial k-arboretum of graphs with bounded treewidth
• Incidence matrices and interval graphs
• A New Class of Upper Bounds on the Log Partition Function
• Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
• Complexity of Finding Embeddings in a k-Tree
• Title not available (Why is that?)
• Convergence properties of a general algorithm for calculating variational Bayesian estimates for a normal mixture model
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
• Nonserial dynamic programming
• Graph minors. II. Algorithmic aspects of tree-width
• Minimizing a Submodular Function on a Lattice
• Title not available (Why is that?)
• Title not available (Why is that?)
• Factorial hidden Markov models
• Graph minor theory
• The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
• Branch-and-Bound Methods: A Survey
• A Computing Procedure for Quantification Theory
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Title not available (Why is that?)
• Consistency techniques for flow-based projection-safe global cost functions in weighted constraint satisfaction
• Title not available (Why is that?)
• Title not available (Why is that?)
• Factor graphs and the sum-product algorithm
• Arc consistency for soft constraints
• Treewidth computations. I: Upper bounds
• Topology of series-parallel networks
• Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
• A Theory of Cooperative Phenomena
• Semiring-based constraint satisfaction and optimization
• Accuracy of variational estimates for random graph mixture models
• Title not available (Why is that?)
• Bucket elimination: A unifying framework for reasoning
• Completing networks using observed data
• Bayesian Reasoning and Machine Learning
• On some simplicial elimination schemes for chordal graphs
• Title not available (Why is that?)
• Recursive computing and simulation-free inference for general factorizable models
• Sufficient Conditions for Convergence of the Sum–Product Algorithm
• Title not available (Why is that?)
• Reinforcement learning-based design of sampling policies under cost constraints in Markov random fields: application to weed map reconstruction
• Approximate computations for binary Markov random fields and their use in Bayesian models
• An algebra of bayesian belief universes for knowledge‐based systems
• Cyclic consistency: A local reduction operation for binary valued constraints
• Efficient recursions for general factorisable models
• Title not available (Why is that?)
• Belief Propagation for Continuous State Spaces: Stochastic Message-Passing with Quantitative Guarantees
• Title not available (Why is that?)

Cited In (1)

• Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor Graphs

This page was built for publication: Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5229963)