~/talk

Probabilistic Programming: What It Is and How It Works

slides:none on file

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

  1. 0:00Introduction
  2. 1:53Probability Distribution
  3. 2:57Conditional Probability Distribution
  4. 3:56Portability
  5. 4:15Independent Events
  6. 5:05Example Query
  7. 5:53Example Discrete
  8. 10:17Approximate Solutions
  9. 10:47Sampling
  10. 12:16Tailoring
  11. 13:33Free Modern
  12. 20:49Deep Learning vs probabilistic programming
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.