Intro to Probabilistic Programming and Clojure’s Anglican

on YouTube ↗34m

" summary

Probabilistic programming is presented with concrete Clojure examples using Anglican running on the JVM, showing a beta prior coin model (40 tosses) and an AB test where simulated groups of 150 vs 250 users with 7% vs 4% conversion are recovered as posteriors via do-query sampling (20,000 samples, ~230s on the demo machine). The game-physics experiment attempts to infer gravity (true -80) and restitution (true 0.5) but fails to converge cleanly, illustrating limits; alternatives mentioned include Stan, PyMC and Biadera.

AI-written summary · about

" chapters (15)

1. 0:00Intro to probabilistic programming
2. 1:08Speaker’s journey to Anglican
3. 3:56Probabilistic programming and why
4. 6:22Bayesian probability basics
5. 10:54MCMC sampling explained
6. 13:22How prob prog systems work
7. 15:29Anglican features
8. 16:12Coin toss with Anglican
9. 16:55Learning coin bias
10. 19:43AB testing with Anglican
11. 25:23Game physics Bayesian inference
12. 29:34Creative apps and Clojure
13. 30:59Other prob prog tools
14. 32:01Conclusions on Anglican
15. 33:26Acknowledgements

" related talks

• 38mIntroduction to Logic Programming with ClojureAmbrose Bonnaire-Sergeant · Clojure/conj 2011
• 31mBayesian Data Analysis of Nonparametric Models in ClojureMichael Lindon · Clojure/conj 2017
• 36mPlaying Go with ClojureZach Tellman · Clojure/conj 2012
• 40mFun with Functional Programming in ClojureJohn Stevenson · Codemotion Rome 2016
• 01h 02mSolving Problems the Clojure WayRafal Dittwald · Clojure/north 2019
• 01h 15mEffective Programs - 10 Years of ClojureRich Hickey · Clojure/conj 2017
• 34mPanel with Paula Gearon and Eric NormandEric Normand, Paula Gearon · re:Clojure 2021
• 31mScientific Computing with ClojureKyle Harrington · Clojure/conj 2015