Jul 28, 2017 · 16m · a16z
Kathryn McKinley
gold bands on the timeline = statements, start to end. Hover to read, click to jump. CC turns on captions
In this presentation at the Andreessen Horowitz Academic Roundtable, Microsoft Research Principal Researcher Kathryn S. McKinley introduces Uncertain<T>, a programming model designed to gracefully handle sensor inaccuracy and probabilistic data through statistical semantics, domain-aware Bayesian inference, and probabilistic program verification.
How this conversation actually went
Every chapter scored 0–10 on four independent dynamics. Hover any point for the reasoning behind the score. How this is scored →
speaking balance: gold is the host, purple is the guest (3 minute bins)
McKinley offers a mild technical critique of traditional probabilistic programming languages for assuming unnecessary precision, though delivered constructively as part of her lecture.
Hardest push from the host ▶ 0:10 No host pushback presentBecause this transcript is a solo presentation without host participation, no host pushback occurs in the episode.
Biggest teaching moment ▶ 3:40 Explaining GPS sensor error modelsMcKinley educates the audience on Rayleigh distributions, explaining that GPS error forms a doughnut shape around the actual location rather than a single point estimate.
The host holds their own ▶ 0:10 No host hits back presentThe host does not speak during this presentation transcript, leaving host expertise scores at zero.
the scores for every segment, with the reasoning behind each
| Chapter | Topic | The host as informed peer | Guest teaching | Guest disagreement | The host pushing back | Why |
|---|---|---|---|---|---|---|
| Motivation: Sensor Inaccuracy and Inaccurate Speed Data | 0 | 6 | 0 | 0 | Kathryn McKinley presents a technical talk explaining how sensor inaccuracies lead to speed calculation errors, introducing the need for uncertain programming types. The host is absent during this monologue segment. | |
| Statistical Semantics, Sampling, and Bayesian Networks | 0 | 6 | 0 | 0 | McKinley explains statistical semantics embedded in programming language runtimes and how Bayesian networks evaluate expression precision dynamically. As a monologue lecture, host-side metrics remain at zero. | |
| Evaluating Conditionals and Reducing False Positives | 0 | 6 | 0 | 0 | McKinley demonstrates how sampling and hypothesis testing evaluate conditionals to systematically eliminate false positives in sensor applications. The segment is an unassisted presentation. | |
| Exploiting Domain Context with Bayesian Inference | 0 | 6 | 0 | 0 | McKinley details incorporating domain context like road snapping using Bayesian constructs and sequential likelihood reweighting to compress code length. No host interaction occurs. | |
| Probabilistic Assertions for Program Verification | 0 | 6 | 0 | 0 | McKinley discusses replacing deterministic assertions with probabilistic assertions for approximate computing and privacy verification. The segment is entirely monologue presentation. | |
| Conclusion and Final Summary Remarks | 0 | 5 | 0 | 0 | McKinley concludes her talk by summarizing the necessity of programming language support for imperfect data across domain areas before thanking the audience. |