Abstract
Bayesian practitioners build models of the world without regarding how difficult it will be to answer questions about them. When answering questions, they put off approximating as long as possible, and usually must write programs to compute converging approximations. Writing the programs is distracting, tedious and error-prone, and we wish to relieve them of it by providing languages and compilers.
Their style constrains our work: the tools we provide cannot approximate early. Our approach to meeting this constraint is to 1) determine their notation’s meaning in a suitable theoretical framework; 2) generalize our interpretation in an uncomputable, exact semantics; 3) approximate the exact semantics and prove convergence; and 4) implement the approximating semantics in Racket (formerly PLT Scheme). In this way, we define languages with at least as much exactness as Bayesian practitioners have in mind, and also put off approximating as long as possible.
In this paper, we demonstrate the approach using our preliminary work on discrete (countably infinite) Bayesian models.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bonawitz, K.A.: Composable Probabilistic Inference with Blaise. Ph.D. thesis, Massachusetts Institute of Technology (2008)
Culpepper, R.: Refining Syntactic Sugar: Tools for Supporting Macro Development. Ph.D. thesis, Northeastern University(2010) (to appear)
Flatt, M.: PLT: Reference: Racket. Tech. Rep. PLT-TR-2010-1, PLT Inc., (2010), http://racket-lang.org/tr1/
Goodman, N., Mansinghka, V., Roy, D., Bonawitz, K., Tenenbaum, J.: Church: a language for generative models. Uncertainty in Artificial Intelligence (2008)
Gordon, M.: Higher order logic, set theory or both? In: TPHOLs, Turku, Finland (1996) invited talk
Hurd, J.: Formal Verification of Probabilistic Algorithms. Ph.D. thesis, University of Cambridge (2002)
Jones, C.: Probabilistic Non-Determinism. Ph.D. thesis, University of Edinburgh (1990)
Kiselyov, O., Shan, C.: Monolingual probabilistic programming using generalized coroutines. Uncertainty in Artificial Intelligence (2008)
Koller, D., McAllester, D., Pfeffer, A.: Effective Bayesian inference for stochastic programs. In: 14th National Conference on Artificial Intelligence (August 1997)
Kozen, D.: Semantics of probabilistic programs. Foundations of Computer Science (1979)
Lunn, D.J., Thomas, A., Best, N., Spiegelhalter, D.: WinBUGS – a Bayesian modelling framework. Statistics and Computing 10(4) (2000)
Mateescu, R., Dechter, R.: Mixed deterministic and probabilistic networks. Annals of Mathematics and Artificial Intelligence (2008)
McBride, C., Paterson, R.: Applicative programming with effects. Journal of Functional Programming 18(1) (2008)
Milch, B., Marthi, B., Russell, S., Sontag, D., Ong, D., Kolobov, A.: BLOG: Probabilistic models with unknown objects. In: International Joint Conference on Artificial Intelligence (2005)
Nahin, P.J.: Duelling Idiots and Other Probability Puzzlers. Princeton University Press, Princeton (2000)
Park, S., Pfenning, F., Thrun, S.: A probabilistic language based upon sampling functions. Transactions on Programming Languages and Systems 31(1) (2008)
Paulson, L.C.: Set theory for verification: I. From foundations to functions. Journal of Automated Reasoning 11, 353–389 (1993)
Paulson, L.C.: Set theory for verification: II. Induction and recursion. Journal of Automated Reasoning 15, 167–215 (1995)
Pfeffer, A.: The design and implementation of IBAL: A general-purpose probabilistic language. Statistical Relational Learning (2007)
Ramsey, N., Pfeffer, A.: Stochastic lambda calculus and monads of probability distributions. Principles of Programming Languages (2002)
Toronto, N., Morse, B.S., Seppi, K., Ventura, D.: Super-resolution via recapture and Bayesian effect modeling. Computer Vision and Pattern Recognition (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Toronto, N., McCarthy, J. (2011). From Bayesian Notation to Pure Racket via Discrete Measure-Theoretic Probability in λ ZFC . In: Hage, J., Morazán, M.T. (eds) Implementation and Application of Functional Languages. IFL 2010. Lecture Notes in Computer Science, vol 6647. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24276-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-24276-2_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24275-5
Online ISBN: 978-3-642-24276-2
eBook Packages: Computer ScienceComputer Science (R0)