Skip to contentSkip to filters

We use cookies for analytics.

Podcast

Learning Bayesian Statistics

  • 4 episodes
  • Latest episode Nov 4, 2026
Related content

Topics

Recent episodes

Q: Why would a linguist switch from lme4 to Bayesian multilevel models? A: For Santiago, it was purely practical. Mixed-effects models fit with lme4 kept failing to converge, and they couldn't handle the complex repeated-measures structures his experiments needed. His friend Noah Silbert got him into Bayesian modeling around 2015, and only afterwards did he realize he agreed with the philosophy too. His analogy: the frequentist toolbox is a furniture store, and if it doesn't sell the bed you need, you settle for the nearest one; Bayesian modeling teaches you carpentry, so the model can match what you believe is going on in your data instead of squeezing the data into a standard structure. Q: Why teach Bayesian multilevel models before t-tests and ANOVA? A: Because in linguistics essentially all data are repeated measures: listeners judge hundreds of trials, and speakers produce many tokens. Yet students traditionally spend a year or more on one-sample t-tests, paired t-tests and ANOVAs they will never use in their own research. Santiago's book jumps straight to the multilevel version of the simplest case, a one-group model with many observations per listener, which he finds no harder to grasp than a t-test since there are no reference distributions or degrees of freedom to explain. Q: Do Bayesian and frequentist analyses give different results on typical phonetics data? A: With analogous models, largely no, at least with the amount of data phonetics experiments usually have. That's why the early chapters of Santiago's book end with a comparison to the equivalent frequentist analysis, to reassure readers. His rule of thumb: if you get dramatically different results, something has probably gone wrong. The gain from going Bayesian is not different point estimates, but models that actually converge, flexible error distributions and model structures, and much richer information about the so-called random effects, which in speech research describe how listeners vary within a speech community.

Hosted by Alexandre Andorra

Published Nov 4, 2026 · 1 h 26 min

Q: What is HSSM and how does it relate to HDDM? A: HSSM stands for hierarchical sequential sampling models, a generalization of HDDM (hierarchical drift diffusion models), the older toolbox for the same class of decision-making models, but HSSM is built from the ground up on simulation-based inference. That's what lets it handle any variation of the underlying process model, not just the ones with a tractable closed-form likelihood. Q: What is the drift diffusion model and why has cognitive science relied on it so heavily? A: The drift diffusion model treats a decision as a random walk that accumulates evidence until it crosses one of two boundaries, with parameters controlling boundary separation, starting bias, and drift rate. It's been used in thousands of published papers largely because it has a closed-form likelihood, which makes standard Bayesian and maximum-likelihood inference fast. Small variations on the model are often just as scientifically motivated, but if their likelihoods aren't analytically convenient, the literature using them stays sparse. Q: What is a likelihood approximation network (LAN) and what does it actually learn? A: A LAN is a neural network trained to take in a process's parameters and a trial's outcome and output how likely that outcome was, learned purely from repeated simulation rather than derived analytically. Once trained, it functions as a fast, reusable likelihood you plug directly into Bayes' rule, in place of a closed-form solution that may not exist for the model you actually want to fit. Q: What's the difference between amortizing the likelihood and amortizing the posterior? A: Amortizing the likelihood, HSSM's approach, means training a network once to approximate the likelihood, then reusing that same network across arbitrarily many downstream models: different priors, hierarchical structures, or regression backends, with no retraining. Amortizing the posterior directly, the approach tools like BayesFlow take, gives near-instant inference once trained, but locks the network into the specific scenario it was trained for.

Hosted by Alexandre Andorra

Published Sep 18, 2026 · 1 h 48 min

Q: What is the "Bayesian Workflow" book about, and who is it for? A: It covers what the three authors know that isn't already in Bayesian Data Analysis (BDA3) or Statistical Rethinking, organized around case studies that walk through full analyses end to end rather than just giving a recommendation. It's not an introduction to Bayesian inference -- it assumes you already know the basics -- but a guide to making theoretically informed, professional decisions at the many branching points a real analysis involves that source books rarely acknowledge. Q: What's a concrete way to report Bayesian results without just handing over a posterior distribution? A: Report a few named scenarios from the distribution, such as pessimistic, median, and optimistic. This is easier to discuss than a full posterior and helps shift the conversation toward what would move outcomes from the median toward the optimistic case.

Hosted by Alexandre Andorra

Published Aug 31, 2026 · 1 h 44 min

Q: What is Variational Bayesian Monte Carlo (VBMC) and how is it different from Bayesian optimization? A: VBMC borrows the machinery of Bayesian optimization but aims at a different target. Bayesian optimization fits a Gaussian process surrogate to an expensive function and uses it to hunt for the optimum. VBMC instead treats the log-posterior as the function to model, evaluates it at a few carefully chosen points, and keeps the whole reconstructed shape rather than just its peak. That gives you the full posterior, not a single best-fit value. Where MCMC might need tens of thousands to millions of evaluations, VBMC often reconstructs a good posterior approximation from a few hundred, which matters when each evaluation is slow. Q: When should you reach for PyVBMC, and when is it the wrong tool? A: Two symptoms tell you PyVBMC might help. First, speed: if a single evaluation of your log density takes on the order of a second, running MCMC over tens of thousands of evaluations becomes painful, and PyVBMC's few-hundred-evaluation budget pays off. Second, dimensionality: because it leans on a Gaussian process surrogate, it works well up to roughly 10 to 15 parameters and degrades beyond that. If your model already runs fine in Stan or PyMC, you do not need it. It shines for expensive, low-dimensional models common in science and engineering, where you are modeling a process rather than composing nice distributions.

Hosted by Alexandre Andorra

Published Jul 16, 2026 · 1 h 32 min