Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited
From MaRDI portal
Publication:5229963
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
Cites work
- scientific article; zbMATH DE number 1646249 (Why is no real title available?)
- scientific article; zbMATH DE number 5764876 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 1945067 (Why is no real title available?)
- scientific article; zbMATH DE number 2080314 (Why is no real title available?)
- scientific article; zbMATH DE number 2080322 (Why is no real title available?)
- scientific article; zbMATH DE number 4121482 (Why is no real title available?)
- scientific article; zbMATH DE number 2117879 (Why is no real title available?)
- Title not available (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- scientific article; zbMATH DE number 2243365 (Why is no real title available?)
- A Computing Procedure for Quantification Theory
- A New Class of Upper Bounds on the Log Partition Function
- A Theory of Cooperative Phenomena
- A partial k-arboretum of graphs with bounded treewidth
- Accuracy of variational estimates for random graph mixture models
- An Approximate Minimum Degree Ordering Algorithm
- An algebra of bayesian belief universes for knowledge‐based systems
- An algebraic graphical model for decision with uncertainties, feasibilities, and utilities
- Approximate computations for binary Markov random fields and their use in Bayesian models
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Approximating discrete probability distributions with dependence trees
- Arc consistency for soft constraints
- Bayesian Networks and Decision Graphs
- Belief propagation for continuous state spaces: stochastic message-passing with quantitative guarantees
- Branch-and-Bound Methods: A Survey
- Bucket elimination: A unifying framework for reasoning
- Completing networks using observed data
- Complexity of Finding Embeddings in a k-Tree
- Consistency of maximum-likelihood and variational estimators in the stochastic block model
- Consistency techniques for flow-based projection-safe global cost functions in weighted constraint satisfaction
- Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
- Convergence properties of a general algorithm for calculating variational Bayesian estimates for a normal mixture model
- Cyclic consistency: A local reduction operation for binary valued constraints
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Efficient recursions for general factorisable models
- Factor graphs and the sum-product algorithm
- Factorial hidden Markov models
- Graph minor theory
- Graph minors. II. Algorithmic aspects of tree-width
- Graphical models, exponential families, and variational inference
- Handbook of constraint programming.
- Incidence matrices and interval graphs
- LibDAI: a free and open source C++ library for discrete approximate inference in graphical models
- Machine learning. A probabilistic perspective
- Minimizing a Submodular Function on a Lattice
- Nonserial dynamic programming
- On some simplicial elimination schemes for chordal graphs
- Pattern recognition and machine learning.
- Probabilistic graphical models.
- Recursive computing and simulation-free inference for general factorizable models
- Reinforcement learning-based design of sampling policies under cost constraints in Markov random fields: application to weed map reconstruction
- Semiring-based constraint satisfaction and optimization
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Soft arc consistency revisited
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Sufficient Conditions for Convergence of the Sum–Product Algorithm
- The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
- Theory of Gaussian variational approximation for a Poisson mixed model
- Topology of series-parallel networks
- Treewidth computations. I: Upper bounds
- Variational particle approximations
Cited in
(1)
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)
