SampleSearch: Importance sampling in presence of determinism

Artificial Intelligence

Volumn 175, Issue 2, 2011, Pages 694-729

  Gogate, Vibhav ^a   Dechter, Rina ^b  

^a UNIVERSITY OF WASHINGTON   (United States)

^b Ringgold Standard Institution Informatics   (United States)

Author keywords

Approximate inference; Bayesian networks; Constraint satisfaction; Importance sampling; Markov chain Monte Carlo; Markov networks; Model counting; Probabilistic inference; Satisfiability

Indexed keywords

APPROXIMATE INFERENCE; BAYESIAN; CONSTRAINT SATISFACTION; IMPORTANCE SAMPLING; MARKOV CHAIN MONTE CARLO; MARKOV NETWORKS; PROBABILISTIC INFERENCE; SATISFIABILITY;

DISTRIBUTED PARAMETER NETWORKS; FORMAL LOGIC; GRAPHIC METHODS; INFERENCE ENGINES; INTELLIGENT NETWORKS; MARKOV PROCESSES; MONTE CARLO METHODS; SAMPLING; SPEECH RECOGNITION;

BAYESIAN NETWORKS;

EID: 78650935812     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2010.10.009     Document Type: Article

References (64)

1. R. Dechter, D. Larkin, Hybrid processing of beliefs and constraints, in: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence (UAI), 2001, pp. 112-119.
2. D. Larkin, R. Dechter, Bayesian inference in the presence of determinism, in: Tenth International Workshop on Artificial Intelligence and Statistics (AISTATS), 2003.
3. R. Dechter, R. Mateescu, Mixtures of deterministic-probabilistic networks and their AND/OR search space, in: Proceedings of the 20th Annual Conference on Uncertainty in Artificial Intelligence (UAI), 2004, pp. 120-129.
4. R. Mateescu, and R. Dechter Mixed deterministic and probabilistic networks, Annals of Mathematics and Artificial Intelligence (AMAI) Special Issue: Probabilistic Relational Learning 54 1-3 2008 3 51
5. J. Pearl Probabilistic Reasoning in Intelligent Systems 1988 Morgan Kaufmann
6. R. Dechter Constraint Processing 2003 Morgan Kaufmann
7. A.W. Marshall The use of multi-stage sampling schemes in Monte Carlo computations Symposium on Monte Carlo Methods 1956 123 140
8. R.Y. Rubinstein Simulation and the Monte Carlo Method 1981 John Wiley & Sons Inc.
9. J. Geweke Bayesian inference in econometric models using Monte Carlo integration Econometrica 57 6 1989 1317 1339
10. V. Gogate, R. Dechter, Approximate inference algorithms for hybrid Bayesian networks with discrete constraints, in: Proceedings of the 21st Annual Conference on Uncertainty in Artificial Intelligence (UAI), 2005, pp. 209-216.
11. J.S. Yedidia, W.T. Freeman, and Y. Weiss Constructing free energy approximations and generalized belief propagation algorithms IEEE Transactions on Information Theory 51 2004 2282 2312
12. R. Dechter, K. Kask, and R. Mateescu Iterative join graph propagation Proceedings of the 18th Conference in Uncertainty in Artificial Intelligence (UAI) 2002 Morgan Kaufmann 128 136
13. R. Mateescu, K. Kask, V. Gogate, and R. Dechter Join-graph propagation algorithms Journal of Artificial Intelligence Research 37 2009 279 328
14. B. Bidyuk, and R. Dechter Cutset sampling for Bayesian networks Journal of Artificial Intelligence Research (JAIR) 28 2007 1 48
15. N. Sorensson, N. Een, Minisat v1.13-A SAT solver with conflict-clause minimization, in: SAT 2005 Competition, 2005.
16. W. Wei, J. Erenrich, B. Selman, Towards efficient sampling: exploiting random walk strategies, in: Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004, pp. 670-676.
17. C.P. Gomes, J. Hoffmann, A. Sabharwal, B. Selman, From sampling to model counting, in: Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI), 2007, pp. 2293-2299.
18. J. Roberto, J. Bayardo, J.D. Pehoushek, Counting models using connected components, in: Proceedings of 17th National Conference on Artificial Intelligence (AAAI), 2000, pp. 157-162.
19. R. Dechter Bucket elimination: A unifying framework for reasoning Artificial Intelligence 113 1999 41 85
20. A. Choi, A. Darwiche, An edge deletion semantics for belief propagation and its practical impact on approximation quality, in: Proceedings of the Twenty-First National Conference on Artificial Intelligence (AAAI), 2006, pp. 1107-1114.
21. M. Fishelson, D. Geiger, Optimizing exact genetic linkage computations, in: Proceedings of the Seventh Annual International Conference on Research in Computational Molecular Biology (RECOMB), 2003, pp. 114-121.
22. M.D. Chavira, A. Darwiche, and M. Jaeger Compiling relational Bayesian networks for exact inference International Journal of Approximate Reasoning 42 1-2 2006 4 20
23. C. Yuan, and M.J. Druzdzel Importance sampling algorithms for Bayesian networks: Principles and performance Mathematical and Computer Modelling 0895-7177 43 90-10 2006 1189 1207
24. V. Gogate, R. Dechter, SampleSearch: A scheme that searches for consistent samples, in: Proceedings of the 11th Conference on Artificial Intelligence and Statistics (AISTATS), 2007, pp. 147-154.
25. V. Gogate, R. Dechter, Approximate counting by sampling the backtrack-free search space, in: Proceedings of 22nd Conference on Artificial Intelligence (AAAI), 2007, pp. 198-203.
26. J. Liu Monte-Carlo Strategies in Scientific Computing 2001 Springer-Verlag New York
27. E.C. Freuder A sufficient condition for backtrack-free search Journal of the ACM 29 1 1982 24 32
28. T. Walsh SAT v CSP Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming 2000 Springer-Verlag London, UK 3-540-41053-8 441 456
29. K. Pipatsrisawat, A. Darwiche, RSAT 2.0: SAT solver description, Tech. Rep. D-153, Automated Reasoning Group, Computer Science Department, UCLA, 2007.
30. J. Cheng, and M.J. Druzdzel AIS-BN: An adaptive importance sampling algorithm for evidential reasoning in large Bayesian networks Journal of Artificial Intelligence Research (JAIR) 13 2000 155 188
31. R.D. Shachter, M.A. Peot, Simulation approaches to general probabilistic inference on belief networks, in: Proceedings of the Fifth Annual Conference on Uncertainty in Artificial Intelligence (UAI), 1990, pp. 221-234.
32. R.M. Fung, K.-C. Chang, Weighing and integrating evidence for stochastic simulation in Bayesian networks, in: Proceedings of the Fifth Annual Conference on Uncertainty in Artificial Intelligence (UAI), 1990, pp. 209-220.
33. L. Ortiz, L. Kaelbling, Adaptive importance sampling for estimation in structured domains, in: Proceedings of the 16th Annual Conference on Uncertainty in Artificial Intelligence (UAI), 2000, pp. 446-454.
34. R. Fung, B. del Favero, Backward simulation in Bayesian networks, in: Proceedings of the Tenth Annual Conference on Uncertainty in Artificial Intelligence (UAI), 1994, pp. 227-234.
35. K. Kask, R. Dechter, J. Larrosa, and A. Dechter Unifying tree decompositions for reasoning in graphical models Artificial Intelligence 166 1-2 2005 165 193
36. G. Casella, and C.P. Robert Rao-blackwellisation of sampling schemes Biometrika 83 1 1996 81 94 10.1093/biomet/83.1.81
37. A. Darwiche, and M. Hopkins Using recursive decomposition to construct elimination orders, jointrees, and dtrees Trends in Artificial Intelligence Lecture Notes in AI 2001 Springer-Verlag 180 191
38. B. Bidyuk, R. Dechter, On finding minimal w-cutset problem, in: Proceedings of the 20th Conference in Uncertainty in Artificial Intelligence (UAI), 2004, pp. 43-50.
39. W. Wei, B. Selman, A new approach to model counting, in: Proceedings of Eighth International Conference on Theory and Applications of Satisfiability Testing (SAT), 2005, pp. 324-339.
40. L.G. Valiant The complexity of enumeration and reliability problems SIAM Journal of Computation 8 3 1987 105 117
41. T. Sang, P. Beame, H. Kautz, Heuristics for fast exact model counting, in: Eighth International Conference on Theory and Applications of Satisfiability Testing (SAT), 2005, pp. 226-240.
42. B. Selman, H. Kautz, B. Cohen, Noise strategies for local search, in: Proceedings of the Eleventh National Conference on Artificial Intelligence, 1994, pp. 337-343.
43. K.P. Murphy, Y. Weiss, M.I. Jordan, Loopy belief propagation for approximate inference: an empirical study, in: Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence (UAI), 1999, pp. 467-475.
44. A. Darwiche, R. Dechter, A. Choi, V. Gogate, and L. Otten Results from the probabilistic inference evaluation of UAI'08 available online at: http://graphmod.ics.uci.edu/uai08/Evaluation/Report 2008
45. R. Dechter, V. Gogate, L. Otten, R. Marinescu, and R. Mateescu Graphical model algorithms at UC Irvine website: http://graphmod.ics.uci.edu/group/ Software 2009
46. A. Darwiche A differential approach to inference in Bayesian networks Journal of the ACM 50 3 2003 280 305
47. A. Darwiche, New advances in compiling CNF into decomposable negation normal form, in: Proceedings of the 16th European Conference on Artificial Intelligence (ECAI), 2004, pp. 328-332.
48. A. Darwiche, and P. Marquis A knowledge compilation map Journal of Artificial Intelligence Research (JAIR) 17 2002 229 264
49. C. Gomes, D. Shmoys, Completing quasigroups or Latin squares: a structured graph coloring problem, in: Proceedings of the Computational Symposium on Graph Coloring and Extensions, 2002.
50. T. Ritter Latin squares: A literature survey available online at: http://www.ciphersbyritter.com/RES/LATSQ.HTM
51. T. Walsh, Permutation problems and channelling constraints, in: Proceedings of the 8th International Conference on Logic Programming and Automated Reasoning (LPAR), 2001, pp. 377-391.
52. V. Gogate, B. Bidyuk, R. Dechter, Studies in lower bounding probability of evidence using the Markov inequality, in: Proceedings of 23rd Conference on Uncertainty in Artificial Intelligence (UAI), 2007, pp. 141-148.
53. L. Simon, D.L. Berre, and E. Hirsch The SAT 2002 competition Annals of Mathematics and Artificial Intelligence (AMAI) 43 2005 307 342
54. J. Ott Analysis of Human Genetic Linkage 1999 The Johns Hopkins University Press Baltimore, Maryland
55. J. Bilmes, and R. Dechter Evaluation of probabilistic inference systems of UAI'06 available online at http://ssli.ee.washington.edu/bilmes/ uai06InferenceEvaluation/ 2006
56. K. Kask, R. Dechter, A. Gelfand, BEEM: bucket elimination with external memory, in: 26th Conference on Uncertainty in Artificial Intelligence (UAI), 2010, pp. 268-276.
57. G. Kokolakis, and P. Nanopoulos Bayesian multivariate micro-aggregation under the Hellinger distance criterion Research in Official Statistics 4 2001 117 125
58. S. Kullback, and R.A. Leibler On information and sufficiency The Annals of Mathematical Statistics 22 1 1951 79 86
59. R. Dechter, R. Mateescu, A simple insight into iterative belief propagation's success, in: Proceedings of the 19th Conference in Uncertainty in Artificial Intelligence (UAI), 2003, p. 175-183.
60. V. Gogate, Sampling algorithms for probabilistic and deterministic graphical models, PhD thesis, University of California, Irvine, 2009.
61. N. Eén, and N. Sörensson Temporal induction by incremental SAT solving Electronic Notes in Theoretical Computer Science 1571-0661 89 4 2003 543 560
62. R. Dechter, and R. Mateescu AND/OR search spaces for graphical models Artificial Intelligence 171 2-3 2007 73 106 (Pubitemid 46328845)
63. R.E. Bryant Graph-based algorithms for Boolean function manipulation IEEE Transactions on Computers 35 8 1986 677 691
64. S. Moral, and A. Salmerón Dynamic importance sampling in Bayesian networks based on probability trees International Journal of Approximate Reasoning 38 3 2005 245 261