HackerPapers

arXiv:1701.02547cs.PL

A Convenient Category for Higher-Order Probability Theory

Chris Heunen, Ohad Kammar, Sam Staton, Hongseok Yang

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

Higher-order probabilistic programming languages allow programmers to write sophisticated models in machine learning and statistics in a succinct and structured way, but step outside the standard measure-theoretic formalization of probability theory. Programs may use both higher-order functions and continuous distributions, or even define a probability distribution on functions. But standard probability theory does not handle higher-order functions well: the category of measurable spaces is not cartesian closed. Here we introduce quasi-Borel spaces. We show that these spaces: form a new formalization of probability theory replacing measurable spaces; form a cartesian closed category and so support higher-order functions; form a well-pointed category and so support good proof principles for equational reasoning; and support continuous probability distributions. We demonstrate the use of quasi-Borel spaces for higher-order functions and probability by: showing that a well-known construction of probability theory involving random functions gains a cleaner expression; and generalizing de Finetti's theorem, that is a crucial theorem in probability theory, to quasi-Borel spaces.

arXiv comments
Journal reference
Logic in Computer Science 2017
DOI
doi:10.1109/LICS.2017.8005137
Subjects
cs.PLProgramming Languages cs.AIArtificial Intelligence cs.LOLogic in Computer Science math.CTCategory Theory math.PRProbability

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Oct 2018 to Oct 2018.

Comments linking this paper, per year.

Discussed in comments1 thread

    • Chris Heunen and cols. have thought about a workaround to make probabilistic categories cartesian closed, and then Lambek translation from CCC to simply typed lambda calculus should apply, so Elliot machinery should also enable to express probablistic problems in Haskell terms.…

      jesuslopView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.