Probabilistic Programming: What It Is and How It Works
summary
Builds a simple Scala model that explains seeing cats by a hidden enticement with probabilities milkshake 0.6 fish 0.1 nothing 0.3, shows exact enumeration for small discrete cases and sampling for larger/continuous ones, and implements a distribution as a Free monad with primitive generators and an interpreter that turns a Distribution into a RNG -> A sampler (uses java.util.Random, SBT demo). Posterior calculation for three observed cats yields posterior milkshake ≈ 85%. Code exists but is noted as rough.
AI-written summary · about
chapters (12)
- 0:00Introduction
- 1:53Probability Distribution
- 2:57Conditional Probability Distribution
- 3:56Portability
- 4:15Independent Events
- 5:05Example Query
- 5:53Example Discrete
- 10:17Approximate Solutions
- 10:47Sampling
- 12:16Tailoring
- 13:33Free Modern
- 20:49Deep Learning vs probabilistic programming
related talks
42mBayes and Bool Walk into a Bar
29mMotivating Probabilistic Programming
31mProbabilistic Programming: The What, Why and How
30mProbabilistic modelling with Scala
01h 03mA Personal Viewpoint on Probabilistic Programming
43mProbabilistic Programming in the Real World
36mProbabilistic Programs Which Make (Common) Sense
43mThe Power of Probabilistic Programming
