Stan: A probabilistic programming language

Journal of Statistical Software

Volumn 76, Issue 1, 2017, Pages

  Carpenter, Bob ^a   Gelman, Andrew ^a   Hoffman, Matthew D ^b   Lee, Daniel ^a   Goodrich, Ben ^a   Betancourt, Michael ^a   Brubaker, Marcus A ^c   Guo, Jiqiang ^d   Li, Peter ^a   Riddell, Allen ^e  

^a Och Spine at New York Presbyterian Hospitals   (United States)

^b Adobe Creative Technologies Lab   (United States)

^c YORK UNIVERSITY   (Canada)

^d NPD Group Packers Schlumberger Reservoir Completion   (United States)

^e INDIANA UNIVERSITY   (United States)

Author keywords

Algorithmic differentiation; Bayesian inference; Probabilistic program; Stan

Indexed keywords

EID: 85009889748     PISSN: 15487660     EISSN: None     Source Type: Journal    
DOI: 10.18637/jss.v076.i01     Document Type: Article

References (32)

1. Betancourt M (2016). “Identifying the Optimal Integration Time in Hamiltonian Monte Carlo.” arXiv:1601.00225 [stat.ME]. URL https://arxiv.org/abs/1601.00225.
2. Carpenter B, Hoffman MD, Brubaker M, Lee D, Li P, Betancourt M (2015). “The Stan Math Library: Reverse-Mode Automatic Differentiation in C++.” arXiv:1509.07164 [cs.MS]. URL https://arxiv.org/abs/1509.07164.
3. Chacon S (2009). Pro Git. Apress. doi:10.1007/978-1-4302-1834-0.
4. Cohen SD, Hindmarsh AC (1996). “CVODE, A Stiff/Nonstiff ODE Solver in C.” Computers in Physics, 10(2), 138–143.
5. Driessen V (2010). “A Successful Git Branching Model.” URL http://nvie.com/posts/a-successful-git-branching-model/.
6. Duane AD, Kennedy A, Pendleton B, Roweth D (1987). “Hybrid Monte Carlo.” Physics Letters B, 195(2), 216–222. doi:10.1016/0370-2693(87)91197-x.
7. Efron B (2010). Large-Scale Inference: Empirical Bayes Methods for Estimation, Testing, and Prediction. Institute of Mathematical Statistics Monographs. Cambridge University Press.
8. Gelman A, Carlin JB, Stern HS, Dunson DB, Vehtari A, Rubin DB (2013). Bayesian Data Analysis. 3rd edition. Chapman & Hall/CRC, London.
9. Gelman A, Hill J, Yajima M (2012). “Why We (Usually) Don’t Have to Worry about Multiple Comparisons.” Journal of Research on Educational Effectiveness, 5, 189–211. doi:10.1080/19345747.2011.618213.
10. Gelman A, Rubin DB (1992). “Inference from Iterative Simulation Using Multiple Sequences.” Statistical Science, 7(4), 457–472. ISSN 0883-4237. doi:10.1214/ss/1177011136.
11. Geyer CJ (2011). “Introduction to Markov Chain Monte Carlo.” In Handbook of Markov Chain Monte Carlo. Chapman & Hall/CRC.
12. Google (2016). “googletest: Google C++ Testing Framework.” URL http://code.google.com/p/googletest/.
13. Guennebaud G, Jacob B, et al. (2010). “Eigen, Version 3.” http://eigen.tuxfamily.org.
14. Hindmarsh AC, Brown PN, Grant KE, Lee SL, Serban R, Shumaker DE, Woodward CS (2005). “SUNDIALS: Suite of Nonlinear and Differential/Algebraic Equation Solvers.” ACM Transactions on Mathematical Software, 31(3), 363–396. doi:10.1145/1089014.1089020.
15. Hoffman MD, Gelman A (2014). “The No-U-Turn Sampler: Adaptively Setting Path Lengths in Hamiltonian Monte Carlo.” Journal of Machine Learning Research, 15, 1593–1623.
16. Lunn D, Jackson C, Best N, Thomas A, Spiegelhalter DJ (2012). The BUGS Book – A Practical Introduction to Bayesian Analysis. Chapman & Hall/CRC.
17. Lunn D, Spiegelhalter DJ, Thomas A, Best N (2009). “The BUGS Project: Evolution, Critique, and Future Directions.” Statistics in Medicine, 28, 3049–3067. doi: 10.1002/sim.3680.
18. Lunn D, Thomas A, Best NG, Spiegelhalter DJ (2000). “WinBUGS – A Bayesian Modelling Framework: Concepts, Structure, and Extensibility.” Statistics and Computing, 10, 325–337. doi:10.1023/a:1008929526011.
19. Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller AH, Teller E (1953). “Equation of State Calculations by Fast Computing Machines.” Journal of Chemical Physics, 21, 1087–1092. doi:10.1063/1.1699114.
20. Mittelbach F, Goossens M, Braams J, Carlisle D, Rowley C (2004). The LATEX Companion. Tools and Techniques for Computer Typesetting, 2nd edition. Addison-Wesley.
21. Neal R (2011). “MCMC Using Hamiltonian Dynamics.” In S Brooks, A Gelman, GL Jones, XL Meng (eds.), Handbook of Markov Chain Monte Carlo, pp. 116–162. Chapman & Hall/CRC
22. Neal RM (1994). “An Improved Acceptance Procedure for the Hybrid Monte Carlo Algorithm.” Journal of Computational Physics, 111, 194–203. doi:10.1006/jcph.1994.1054.
23. Neal RM (2003). “Slice Sampling.” The Annals of Statistics, 31(3), 705–767. doi:10.1214/aos/1056562461.
24. Nocedal J, Wright SJ (2006). Numerical Optimization. 2nd edition. Springer-Verlag.
25. Plummer M (2003). “JAGS: A Program for Analysis of Bayesian Graphical Models Using Gibbs Sampling.” In K Hornik, F Leisch, A Zeileis (eds.), Proceedings of the 3rd International Workshop on Distributed Statistical Computing (DSC 2003). Vienna, Austria. ISSN 1609-395X. URL http://www.ci.tuwien.ac.at/Conferences/DSC-2003/.
26. Plummer M, Best N, Cowles K, Vines K (2006). “code: Convergence Diagnosis and Output Analysis for MCMC.” R News, 6(1), 7–11. URL http://CRAN.R-project.org/doc/ Rnews/.
27. R Core Team (2016). R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria. URL https://www.R-project.org/.
28. Schäling B (2011). The Boost C++ Libraries. XML Press. URL http://www.boost.org/.
29. Smart JF (2011). Jenkins: The Definitive Guide. O’Reilly.
30. Stan Development Team (2016). Stan Modeling Language User’s Guide and Reference Manual, Version 2.14.0. URL http://mc-stan.org
31. Van Heesch D (2016). “Doxygen: Generate Documentation from Source Code.” URL http://www.stack.nl/~dimitri/doxygen/.
32. Van Rossum G, et al. (2016). Python Programming Language. URL http://www.python.org/.