SampleSearch: importance sampling in presence of determinism
From MaRDI portal
Publication:543621
DOI10.1016/j.artint.2010.10.009zbMath1216.68246OpenAlexW2102233204MaRDI QIDQ543621
Publication date: 17 June 2011
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2010.10.009
Bayesian networksimportance samplingMarkov chain Monte Carlosatisfiabilityprobabilistic inferenceconstraint satisfactionapproximate inferencemodel countingMarkov networks
Related Items
FAST FACTORISATION OF PROBABILISTIC POTENTIALS AND ITS APPLICATION TO APPROXIMATE INFERENCE IN BAYESIAN NETWORKS ⋮ Stochastic enumeration method for counting NP-hard problems ⋮ Oblivious bounds on the probability of boolean functions ⋮ Importance Sampling on Bayesian Networks with Deterministic Causalities ⋮ Learning Bayesian network parameters under equivalence constraints ⋮ Importance sampling-based estimation over AND/OR search spaces for graphical models
Uses Software
Cites Work
- Mixed deterministic and probabilistic networks
- AND/OR search spaces for graphical models
- Dynamic importance sampling in Bayesian networks based on probability trees
- Bucket elimination: A unifying framework for reasoning
- Unifying tree decompositions for reasoning in graphical models
- Importance sampling algorithms for Bayesian networks: principles and performance
- Compiling relational Bayesian networks for exact inference
- Permutation Problems and Channelling Constraints
- A differential approach to inference in Bayesian networks
- Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
- Join-Graph Propagation Algorithms
- Graph-Based Algorithms for Boolean Function Manipulation
- Rao-Blackwellisation of sampling schemes
- A Sufficient Condition for Backtrack-Free Search
- Bayesian Inference in Econometric Models Using Monte Carlo Integration
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- On Information and Sufficiency
- Monte Carlo strategies in scientific computing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item