skip to main content
research-article

A type theory for probability density functions

Published:25 January 2012Publication History
Skip Abstract Section

Abstract

There has been great interest in creating probabilistic programming languages to simplify the coding of statistical tasks; however, there still does not exist a formal language that simultaneously provides (1) continuous probability distributions, (2) the ability to naturally express custom probabilistic models, and (3) probability density functions (PDFs). This collection of features is necessary for mechanizing fundamental statistical techniques. We formalize the first probabilistic language that exhibits these features, and it serves as a foundational framework for extending the ideas to more general languages. Particularly novel are our type system for absolutely continuous (AC) distributions (those which permit PDFs) and our PDF calculation procedure, which calculates PDF s for a large class of AC distributions. Our formalization paves the way toward the rigorous encoding of powerful statistical reformulations.

Skip Supplemental Material Section

Supplemental Material

popl_8b_1.mp4

mp4

214.9 MB

References

  1. A. Agarwal, S. Bhat, A. Gray, and I. E. Grossmann. Automating Mathematical Program Transformations. In Practical Aspects of Declarative Languages, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. P. Audebaud and C. Paulin-Mohring. Proofs of Randomized Algorithms in Coq. In Mathematics of Program Construction, pages 49--68. Springer, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. C. Bishop. Pattern Recognition and Machine Learning. Springer, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. J. Borgstram, A. D. Gordon, M. Greenberg, J. Margetson, and J. V. Gael. Measure Transformer Semantics for Bayesian Machine Learning. In European Symposium on Programming, pages 77--96, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. H. Daumé III. HBC: Hierarchical Bayes Compiler, 2007. URL http://hal3.name/HBC.Google ScholarGoogle Scholar
  6. L. Devroye. Non-Uniform Random Variate Generation, 1986.Google ScholarGoogle Scholar
  7. M. Erwig and S. Kollmansberger. Functional Pearls: Probabilistic Functional Programming in Haskell. Journal of Functional Programming, 16 (01): 21--34, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. M. Giry. A Categorical Approach to Probability Theory. Categorical Aspects of Topology and Analysis, 915: 68--85, 1981.Google ScholarGoogle ScholarCross RefCross Ref
  9. N. Goodman, V. Mansinghka, D. Roy, K. Bonawitz, and J. Tenenbaum. Church: A Language for Generative Models. In Uncertainty in Artificial Intelligence, 2008.Google ScholarGoogle Scholar
  10. A. G. Gray, B. Fischer, J. Schumann, and W. Buntine. Automatic Derivation of Statistical Algorithms: The EM Family and Beyond. In Advances in Neural Information Processing Systems, 2003.Google ScholarGoogle Scholar
  11. M. Hoyrup, C. Rojas, and K. Weihrauch. The Radon-Nikodym operator is not computable. In Computability & Complexity in Analysis, 2011.Google ScholarGoogle Scholar
  12. K. Kersting and L. De Raedt. Bayesian Logic Programming: Theory and Tool. In Introduction to Statistical Relational Learning. 2007.Google ScholarGoogle Scholar
  13. O. Kiselyov and C. Shan. Embedded Probabilistic Programming. In Working Conference on Domain Specific Languages. Springer, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. D. Kozen. Semantics of Probabilistic Programs. Journal of Computer and System Sciences, 22 (3): 328--350, 1981.Google ScholarGoogle ScholarCross RefCross Ref
  15. T. Mhamdi, O. Hasan, and S. Tahar. On the Formalization of the Lebesgue Integration Theory in HOL. Interactive Theorem Proving, pages 387--402, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. B. Milch, B. Marthi, S. Russell, D. Sontag, D. Ong, and A. Kolobov. BLOG: Probabilistic Models with Unknown Objects. In International Joint Conference on Artificial Intelligence, volume 19, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. O. Nielsen. An Introduction to Integration and Measure Theory. Wiley-Interscience, 1997.Google ScholarGoogle Scholar
  18. S. Park, F. Pfenning, and S. Thrun. A Probabilistic Language based upon Sampling Functions. In Principles of Programming Languages, pages 171--182. ACM New York, NY, USA, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. A. Pfeffer. IBAL: A Probabilistic Rational Programming Language. In International Joint Conference on Artificial Intelligence, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. N. Ramsey and A. Pfeffer. Stochastic Lambda Calculus and Monads of Probability Distributions. volume 37, pages 154--165. ACM, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. M. Richardson and P. Domingos. Markov Logic Networks. Machine Learning, 62 (1): 107--136, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. T. Sato and Y. Kameya. PRISM: A Symbolic-Statistical Modeling Language. In International Joint Conference on Artificial Intelligence, pages 1330--1339, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. D. Scott. Parametric Statistical Modeling by Minimum Integrated Square Error. Technometrics, 43 (3): 274--285, 2001.Google ScholarGoogle ScholarCross RefCross Ref
  24. B. Silverman. Density Estimation for Statistics and Data Analysis. Chapman & Hall/CRC, 1986.Google ScholarGoogle ScholarCross RefCross Ref
  25. R. Solovay. A Model of Set-Theory in Which Every Set of Reals is Lebesgue Measurable. Annals of Mathematics, pages 1--56, 1970.Google ScholarGoogle ScholarCross RefCross Ref
  26. L. Wasserman. All of Statistics: A Concise Course in Statistical Inference. Springer, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A type theory for probability density functions

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image ACM SIGPLAN Notices
          ACM SIGPLAN Notices  Volume 47, Issue 1
          POPL '12
          January 2012
          569 pages
          ISSN:0362-1340
          EISSN:1558-1160
          DOI:10.1145/2103621
          Issue’s Table of Contents
          • cover image ACM Conferences
            POPL '12: Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
            January 2012
            602 pages
            ISBN:9781450310833
            DOI:10.1145/2103656

          Copyright © 2012 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 25 January 2012

          Check for updates

          Qualifiers

          • research-article

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader