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
DOI10.1111/anzs.12257OpenAlexW2955135267MaRDI QIDQ5229963
No author found.
Publication date: 19 August 2019
Published in: Australian & New Zealand Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.08544
hidden Markov modelsmessage passingvariational approximationsmarginalisationcomputational inferencemode evaluation
Estimation in multivariate analysis (62H12) Nonparametric estimation (62G05) Markov processes: estimation; hidden Markov models (62M05) Research exposition (monographs, survey articles) pertaining to statistics (62-02) Graphical methods in statistics (62A09)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Arc consistency for soft constraints
- Cyclic consistency: A local reduction operation for binary valued constraints
- Treewidth computations. I: Upper bounds
- Soft arc consistency revisited
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- A partial k-arboretum of graphs with bounded treewidth
- Factorial hidden Markov models
- Reinforcement learning-based design of sampling policies under cost constraints in Markov random fields: application to weed map reconstruction
- Consistency of maximum-likelihood and variational estimators in the stochastic block model
- Bucket elimination: A unifying framework for reasoning
- Approximate computations for binary Markov random fields and their use in Bayesian models
- Topology of series-parallel networks
- Incidence matrices and interval graphs
- Nonserial dynamic programming
- On some simplicial elimination schemes for chordal graphs
- Consistency Techniques for Flow-Based Projection-Safe Global Cost Functions in Weighted Constraint Satisfaction
- Belief Propagation for Continuous State Spaces: Stochastic Message-Passing with Quantitative Guarantees
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Graph minor theory
- Efficient recursions for general factorisable models
- Bayesian Networks and Decision Graphs
- A New Class of Upper Bounds on the Log Partition Function
- Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
- Sufficient Conditions for Convergence of the Sum–Product Algorithm
- Graphical Models, Exponential Families, and Variational Inference
- Completing Networks Using Observed Data
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Graph minors. II. Algorithmic aspects of tree-width
- Complexity of Finding Embeddings in a k-Tree
- The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
- Minimizing a Submodular Function on a Lattice
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Semiring-based constraint satisfaction and optimization
- Factor graphs and the sum-product algorithm
- An Approximate Minimum Degree Ordering Algorithm
- Accuracy of variational estimates for random graph mixture models
- Bayesian Reasoning and Machine Learning
- Recursive computing and simulation-free inference for general factorizable models
- Branch-and-Bound Methods: A Survey
- Approximating discrete probability distributions with dependence trees
- A Computing Procedure for Quantification Theory
- An algebra of bayesian belief universes for knowledge‐based systems
- A Theory of Cooperative Phenomena
- Convergence properties of a general algorithm for calculating variational Bayesian estimates for a normal mixture model
