~/talk

Probabilistic Programming in the Real World

Talkat PyData DC 2018 · on Friday, 2018-11-16· [machine-learning]
links:none on file
slides:none on file

Shows concrete models and results: uses PyMC3 and MCMC variants (Metropolis, HMC/NUTS) to build a truncated-normal joke-rating model from three ratings, a Bernoulli model for classifier accuracy, a discrete-mixture model for document types, and a Student‑t comparison for error rates. Produces posterior samples, credibile intervals, and summary probabilities—about 80% confident the joke is funnier at PyData and roughly 75% posterior probability the new process yields fewer errors—enough to drive data‑collection and business decisions.

AI-written summary · about

  1. 0:00Introduction
  2. 2:28Joke funniness modeling
  3. 9:51Bayesian modeling theory
  4. 17:35Markov chain Monte Carlo and Metropolis algorithm
  5. 19:39Real-world problems solved
  6. 21:45Model validation
  7. 24:34Expert knowledge in models
  8. 28:05Uncertainty in business
  9. 32:41Probabilistic programming
  10. 36:53Q&A
~/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.