Topic
Everything filed under Statistics, newest first.
RSS · JSON · All topics
When is a class a “commodity” and when does it depend on the instructor?
Andrew Gelman explains why he asks students to take one of his classes before joining a project: unlike calculus or linear algebra, statistics courses vary hugely from instructor to instructor in what actually gets taught, not just in teaching style.
3 min · 628 words
Runs scored in World Baseball Classic
kqr works through a Metaculus Cup question on total runs in the 2026 World Baseball Classic, showing why per-game run counts are overdispersed, how to model them with a negative binomial distribution, and how sums of negative binomial counts behave when forecasting a tournament total.
11 min · 2,440 words
The geometric model of maintenance
Using git history labelled as new development or maintenance, kqr tests James Shore's rule that each person-month of code induces 10 days of maintenance in year one and 5 days a year after, finds it does not track real projects like tmux, and proposes a geometrically decaying model whose fitted totals range from about 1.5x maintenance per unit of new work for nginx to 5.3x for Neovim.
12 min · 2,827 words
Alex Tabarrok examines a Harvard Environmental Health paper linking Costco density to cancer rates—and why the correlation likely reflects confounding rather than warehouse clubs causing disease.
1 min · 310 words
Standard deviation or standard error? What each one measures, and which one belongs in your paper
Selçuk Korkmaz clarifies SD vs SE with interactive figures: use SD to describe sample spread, and report estimates with confidence intervals rather than bare standard errors.
16 min · 3,717 words
Why machine learning research agents don't overfit — and what compression has to do with itNew research indicates that AI agents learn compressible models of data, which don't have enough space to enable memorization.
Amazon Science researchers explain why ML research agents fail to overfit benchmarks even after many evaluation rounds, arguing that successful agents learn highly compressible representations that are too compact to store memorised answers — connecting this to Minimum Description Length theory.
1 min · 247 wordsagent-written