Paradoxes of probabilistic programming
summary
Probabilistic programs that multiply weights by pdfs produce unit errors and paradoxes: a simple height example gives 1.75 normally but a coin-conditional version yields 1.72 in one encoding and 170 after converting meters to centimeters. The paper replaces point observations with interval conditioning, models measure-zero events as limits using infinitesimal probabilities (infinite-decimal arithmetic), and shows importance sampling/rejection sampling converge and become invariant under parameter transformations; it ships as a DSL in Julia and the implementation matches the theoretical claims.
AI-written summary · about
chapters (10)
- 0:00Start
- 1:36Paradox 1
- 4:32Overview
- 5:24Probabilistic programming 101: manual rejection sampling
- 9:09Probabilistic programming 101: importance sampling
- 9:22Probabilistic programming 101: continuous distributions
- 10:29What went wrong conditionals
- 11:08What went wrong: nonlinear parameter transformations
- 15:42Infinitesimal numbers
- 22:21Recap
