Efficiently sampling probabilistic programs via program analysis

Journal of Machine Learning Research

Volumn 31, Issue , 2013, Pages 153-160

  Chaganty, Arun T ^a   Nori, Aditya V ^b   Rajamani, Sriram K ^b  

^a STANFORD UNIVERSITY   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; ERROR ANALYSIS; SAMPLING;

GENERATING SAMPLES; MATHEMATICAL PROPERTIES; NATURAL APPROACHES; PROBABILISTIC PROGRAMMING; PROBABILISTIC PROGRAMS; SUCCINCT REPRESENTATION; SYMBOLIC EXECUTION; WEAKEST PRECONDITION;

PROBABILITY DISTRIBUTIONS;

EID: 84954244367     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (16)

1. Cadar, C., Dunbar, D., and Engler, D. R. (2008). Klee: Unassisted and automatic generation of high-coverage tests for complex systems programs. In Operating Systems Design and Implementation (OSDI), pages 209-224.
2. de Moura, L. and Bjorner, N. (2008). Z3: An Efficient SMT Solver. In Tools and Algorithms for the Con- struction and Analysis of Systems (TACAS), pages 337-340.
3. Dijkstra, E. W. (1976). A Discipline of Programming. Prentice Hall.
4. Gilks, W. R., Thomas, A., and Spiegelhalter, D. J. (1994). A language and program for complex Bayesian modelling. The Statistician, 43(1): 169-177.
5. Godefroid, P., Klarlund, N., and Sen, K. (2005). DART: Directed Automated Random Testing. In Programming Language Design and Implementation (PLDI), pages 213-223.
6. Godefroid, P., Levin, M. Y., and Molnar, D. A. (2012). Sage: Whitebox fuzzing for security testing. Com- mun. ACM, 55(3): 40-44.
7. Goodman, N. D., Mansinghka, V. K., Roy, D. M., Bonawitz, K., and Tenenbaum, J. B. (2008). Church: A language for generative models. In Un- certainty in Artificial Intelligence (UAI), pages 220-229.
8. Gordon, A. D., Aizatulin, M., Johannes Borgstroem, G. C., Graepel, T., Nori, A. V., Rajamani, S. K., and Russo, C. (2013). A model-learner pattern for bayesian reasoning. In Principles of Programming Languages (POPL).
9. Kiselyov, O. and Shan, C. (2009). Monolingual probabilistic programming using generalized coroutines. In Uncertainty in Artificial Intelligence (UAI), pages 285-292.
10. Kok, S., Sumner, M., Richardson, M., Singla, P., Poon, H., Lowd, D., and Domingos, P. (2007). The Alchemy system for Statistical Relational AI. Technical report, University of Washington.
11. Koller, D., McAllester, D. A., and Pfeffer, A. (1997). Effective Bayesian inference for stochastic programs. In National Conference on Artificial Intelligence (AAAI), pages 740-747.
12. Milch, B. and Russell, S. J. (2006). General-purpose MCMC inference over relational structures. In Un- certainty in Artificial Intelligence(UAI).
13. Minka, T., Winn, J., Guiver, J., and Kannan, A. (2009). Infer.NET 2.3.
14. Pfeffer, A. (2007a). The design and implementation of IBAL: A general-purpose probabilistic language. In Statistical Relational Learning, pages 399-432.
15. Pfeffer, A. (2007b). A general importance sampling algorithm for probabilistic programs. Technical report, Harvard University TR-12-07.
16. Wingate, D., Goodman, N. D., Stuhlmüller, A., and Siskind, J. M. (2011). Nonstandard interpretations of probabilistic programs for efficient inference. In Neural Information Processing Systems (NIPS), pages 1152-1160.