Memory intensive branch-and-bound search for graphical models

Authors:
Radu Marinescu;Rina Dechter
Affiliations:
School of Information and Computer Science, University of California, Irvine, CA;School of Information and Computer Science, University of California, Irvine, CA
Venue:
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Year:
2006

Citing 13
Cited 10

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
Search in Artificial Intelligence

Search in Artificial Intelligence
Recursive conditioning

Artificial Intelligence - special issue on computational tradeoffs under bounded resources
A general scheme for automatic generation of search heuristics from specification dependencies

Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Earth Observation Satellite Management

Constraints
Mini-buckets: A general scheme for bounded inference

Journal of the ACM (JACM)
Constraint Processing

Constraint Processing
Mixtures of deterministic-probabilistic networks and their AND/OR search space

UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
On the space-time trade-off in solving constraint satisfaction problems

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Existential arc consistency: getting closer to full arc consistency in weighted CSPs

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
AND/OR branch-and-bound for graphical models

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
AND/OR cutset conditioning

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Value elimination: bayesian inference via backtracking search

UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence

Mendelian Error Detection in Complex Pedigrees Using Weighted Constraint Satisfaction Techniques

Constraints
Best-First AND/OR Search for 0/1 Integer Programming

CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques

Proceedings of the 2007 conference on Artificial Intelligence Research and Development
Memory intensive AND/OR search for combinatorial optimization in graphical models

Artificial Intelligence
Best-first AND/OR search for graphical models

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Russian Doll search with tree decomposition

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Evaluating the impact of AND/OR search on 0-1 integer linear programming

Constraints
AND/OR multi-valued decision diagrams for constraint optimization

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Portfolios in Stochastic Local Search: Efficiently Computing Most Probable Explanations in Bayesian Networks

Journal of Automated Reasoning
Algorithms for generating ordered solutions for explicit and/or structures

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the structure of the model, which can translate into exponential time savings for search algorithms. AND/OR Branch-and-Bound (AOBB) is a new algorithm that explores the AND/OR search tree for solving optimization tasks in graphical models. In this paper we extend the algorithm to explore an AND/OR search graph by equipping it with a context-based adaptive caching scheme similar to good and no-good recording. The efficiency of the new graph search algorithm is demonstrated empirically on various benchmarks, including the very challenging ones that arise in genetic linkage analysis.