Nonstandard interpretations of probabilistic programs for efficient inference

Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011, NIPS 2011

Volumn , Issue , 2011, Pages

  Wingate, David ^a   Goodman, Noah D ^b   Stuhlmüller, Andreas ^a   Siskind, Jeffrey M ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b ECE Purdue ^*

^c Purdue ECE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL EFFICIENCY; COMPUTER PROGRAMMING LANGUAGES; INFERENCE ENGINES; PROBABILITY DISTRIBUTIONS; PROGRAM COMPILERS; STOCHASTIC SYSTEMS;

AUTOMATIC DIFFERENTIATIONS; BUILDING BLOCKES; COMPILER DESIGN; DESIGN ANALYSIS; INFERENCE ALGORITHM; MACHINE-READABLE FORMAT; OPERATOR OVERLOADING; PROBABILISTIC PROGRAMMING LANGUAGE; PROBABILISTIC PROGRAMS; PROGRAM ANALYSIS;

RANDOM PROCESSES;

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

References (28)

1. C. Bendtsen andO. Stauning. FADBAD, a flexible C++ package for automatic differentiation. Technical Report IMM-REP-1996-17, Department of Mathematical Modelling, Technical University of Denmark, Lyngby, Denmark, Aug. 1996.
2. C. H. Bischof, A. Carle, G. F. Corliss, A. Griewank, and P. D. Hovland. ADIFOR: Generating derivative codes from Fortran programs. Scientific Programming, 1(1):11-29, 1992.
3. G. Corliss, C. Faure, A. Griewank, L. Hascoët, and U. Naumann. Automatic Differentiation: From Simulation toOptimization. Springer-Verlag, New York, NY, 2001.
4. J. Eisner, E. Goldlust, and N. A. Smith. Compiling comp ling: Weighted dynamic programming and the Dyna language. In Proceedings of Human Language Technology Conference and Conference on Empirical Methods in Natural Language Processing (HLT-EMNLP), pages 281-290, Vancouver,October 2005.
5. M. Girolami and B. Calderhead. Riemann manifold Langevin and Hamiltonian Monte Carlo methods. J. R. Statist. Soc. B, 73(2):123-214, 2011.
6. N. Goodman, V.Mansinghka, D. Roy, K. Bonawitz, and J. Tenenbaum. Church: a language for generative models. In Uncertainty in Artificial Intelligence (UAI), 2008.
7. A. Griewank. Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation. Number 19 in Frontiers in Applied Mathematics. SIAM, 2000.
8. A. Griewank, D. Juedes, and J. Utke. ADOL-C, a package for the automatic differentiation of algorithms written in C/C++. ACM Trans. Math. Software, 22(2):131-167, 1996.
9. E. Herbst. Gradient and Hessian-based MCMC for DSGE models (job market paper), 2010.
10. K. Kersting and L. D. Raedt. Bayesian logic programming: Theory and tool. In L. Getoor and B. Taskar, editors, An Introduction to Statistical Relational Learning. MIT Press, 2007.
11. O. Kiselyov and C. Shan. Embedded probabilistic programming. In Domain-Specific Languages, pages 360-384, 2009.
12. Y. LeCun and L. Bottou. Lush reference manual. Technical report, 2002. URL http://lush.sourceforge.net.
13. B. Milch, B. Marthi, S. Russell, D. Sontag, D. L.Ong, and A. Kolobov. BLOG: Probabilistic models with unknown objects. In International Joint Conference on Artificial Intelligence (IJCAI), pages 1352-1359, 2005.
14. M. B. Monagan and W. M. Neuenschwander. GRADIENT: Algorithmic differentiation in Maple. In International Symposium on Symbolic and Algebraic Computation (ISSAC), pages 68-76, July 1993.
15. R. M. Neal. MCMC using Hamiltonian dynamics. In Handbook of Markov Chain Monte-Carlo (Steve Brooks, Andrew Gelman, Galin Jones and Xiao-Li Meng, Eds.), 2010.
16. S. Pandolfi, F. Bartolucci, and N. Friel. A generalization of the multiple-try metropolis algorithm for bayesian estimation and model selection. In International Conference on Artificial Intelligence and Statistics (AISTATS), 2010.
17. B. A. Pearlmutter and J. M. Siskind. Lazy multivariate higher-order forward-mode AD. In Symposium on Principles of Programming Languages (POPL), pages 155-160, 2007. doi: 10.1145/1190215.1190242.
18. A. Pfeffer. IBAL: A probabilistic rational programming language. In International Joint Conference on Artificial Intelligence (IJCAI), pages 733-740. Morgan Kaufmann Publ., 2001.
19. Y. Qi and T. P. Minka. Hessian-based Markov chain Monte-Carlo algorithms (unpublished manuscript), 2002.
20. P. J. Rossky, J. D. Doll, and H. L. Friedman. Brownian dynamics as smart monte carlo simulation. Journal of Chemical Physics, 69:4628-4633, 1978.
21. D. E. Rumelhart, G. E. Hinton, and R. J. Williams. Learning representations by back-propagating errors. 323:533-536, 1986.
22. S. Rump. INTLAB - INTerval LABoratory. In Developments in Reliable Computing, pages 77-104. Kluwer Academic Publishers, Dordrecht, 1999.
23. R. Salakhutdinov and A. Mnih. Probabilistic matrix factorization. In Neural Information Processing Systems (NIPS), 2008.
24. J. M. Siskind and B. A. Pearlmutter. First-class nonstandard interpretations by opening closures. In Symposium on Principles of Programming Languages (POPL), pages 71-76, 2007. doi: 10.1145/1190216.1190230.
25. B. Speelpenning. Compiling Fast Partial Derivatives of Functions Given by Algorithms. PhD thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, Jan. 1980.
26. B. Taylor. Methodus Incrementorum Directa et Inversa. London, 1715.
27. R. E. Wengert. A simple automatic derivative evaluation program. Commun. ACM, 7(8):463-464, 1964.
28. D. Wingate, A. Stuhlmueller, and N. D. Goodman. Lightweight implementations of probabilistic programming languages via transformational compilation. In International Conference on Artificial Intelligence and Statistics (AISTATS), 2011.