A case study in complexity estimation: Towards parallel branch-and-bound over graphical models

Uncertainty in Artificial Intelligence - Proceedings of the 28th Conference, UAI 2012

Volumn , Issue , 2012, Pages 665-674

  Otten, Lars ^a   Dechter, Rina ^a  

^a Irvine   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; REGRESSION ANALYSIS;

COMPLEXITY ESTIMATION; DISTRIBUTED SYSTEMS; GRAPHICAL MODEL; LOAD IMBALANCE; PARALLEL BRANCH AND BOUNDS; PARALLELIZING; ROBUST PREDICTIONS; STATISTICAL REGRESSION MODEL;

GRAPHIC METHODS;

EID: 84886077515     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Geoffrey Chu, Christian Schulte, and Peter J. Stuckey. Confidence-based work stealing in parallel constraint programming. In CP, pages 226-241, 2009.
2. Gerard Cornuejols, Miroslav Karamanov, and Yanjun Li. Early estimates of the size of branch-and-bound trees. INFORMS Journal on Computing, 18(1):86-96, 2006.
3. Rina Dechter and Robert Mateescu. AND/OR search spaces for graphical models. Artif. Intell., 171(2-3):73-106, 2007.
4. Rina Dechter and Irina Rish. Mini-buckets: A general scheme for bounded inference. Journal of the ACM, 50(2):107-153, 2003.
5. Bernard Gendron and Teodor Gabriel Crainic. Parallel branch-and-bound algorithms: Survey and synthesis. Operations Research, 42(6):1042-1066, 1994.
6. Ananth Grama, George Karypis, Vipin Kumar, and Anshul Gupta. Introduction to Parallel Computing. Addison Wesley, 2003.
7. Ananth Grama and Vipin Kumar. State of the art in parallel search techniques for discrete optimization problems. IEEE Trans. Knowl. Data Eng., 11(1):28-35, 1999.
8. Trevor Hastie, Robert Tibshirani, and Jerome Friedman. The Elements of Statistical Learning. Springer, 5th corrected edition, 2011.
9. Philip Kilby, John Slaney, Sylvie Thiebaux, and Toby Walsh. Estimating search tree size. In AAAI, pages 1014-1019. AAAI Press, 2006.
10. Donald E. Knuth. Estimating the efficiency of backtrack programs. Mathematics of Computation, 29(129):121-136, 1975.
11. Kevin Leyton-Brown, Eugene Nudelman, and Yoav Shoham. Empirical hardness models: Methodology and a case study on combinatorial auctions. Journal of the ACM, 56(4):1-52, 2009.
12. RaduMarinescu and Rina Dechter. AND/OR Branchand-Bound search for combinatorial optimization in graphical models. Artif. Intell., 173(16-17):1457-1491, 2009.
13. Lars Otten and Rina Dechter. Towards parallel search for optimization in graphical models. In ISAIM, 2010.
14. Lars Otten and Rina Dechter. Finding most likely haplotypes in general pedigrees through parallel search with dynamic load balancing. In PSB, 2011.
15. Robert Tibshirani. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society, Series B, 58(1):267-288, 1996.
16. Lin Xu, Frank Hutter, Holger H. Hoos, and Kevin Leyton-Brown. SATzilla: portfolio-based algorithm selection for SAT. Journal of Artificial Intelligence Research, 32:565-606, June 2008.
17. Chen Yanover and Yair Weiss. Approximate inference and protein-folding. In S. Thrun S. Becker and K. Obermayer, editors, Advances in Neural Information Processing Systems 15, pages 1457-1464. MIT Press, Cambridge, MA, 2003.
18. Hui Zou and Trevor Hastie. Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society, Series B, 67(2):301-320, 2005.