Stanford CS336 Language Modeling from Scratch | Spring 2026 | Lecture 12: Evaluation
TL;DR
This lecture explores how to evaluate language models, examining different definitions of "good" from benchmark scores to economic usage, diving deep into perplexity as a foundational metric and its limitations, and tracing the evolution of exam-based benchmarks like MMLU from novel challenges to saturated metrics.
🏆 Defining "Good" in Language Models 3 insights
Benchmarks versus cost efficiency
While Artificial Analysis ranks models by intelligence index, cost matters—expensive models don't always justify their price premium when plotted against inference costs.
Human preference rankings
Arena AI (formerly Chatbot Arena) ranks models based on blind user preferences, capturing subjective quality that pure accuracy metrics fail to measure.
Economic usage signals
Open Router statistics reveal which models people actually pay to use, offering a market-driven lens of practical value beyond technical benchmarks.
📊 Perplexity and Distribution Matching 4 insights
Zero-shot evaluation paradigm
GPT-2 shifted from in-distribution testing to zero-shot evaluation on standard datasets, establishing the modern practice of measuring generalization rather than memorization.
The scaling hypothesis
The belief that "perplexity is all you need" drives scaling laws research, arguing that minimizing perplexity toward the true distribution's entropy inevitably unlocks AGI capabilities.
Conditional perplexity
Researchers can focus on specific tokens by measuring conditional perplexity given prompts, weighting important predictions like answers over incidental words like articles.
Leaderboard trust issues
Perplexity competitions require trusting submitted probabilities sum to one, unlike downstream tasks where black-box models can be evaluated objectively via outputs.
📝 Exam Benchmarks and MMLU 3 insights
Controlled academic testing
Exam-style benchmarks provide carefully controlled difficulty and unambiguous correct answers, making them ideal for automated grading of knowledge and reasoning.
MMLU's evolution
The Massive Multitask Language Understanding benchmark originally showed GPT-3 barely above random chance on 57 subjects using few-shot prompting, but has since saturated into the 90s.
Benchmark lifecycles
Successful benchmarks follow a predictable arc from novel challenges demonstrating emergent capabilities to trivial tasks that require creating harder successors.
Bottom Line
Evaluation metrics fundamentally shape AI development, so choosing between intrinsic measures like perplexity and extrinsic benchmarks like MMLU determines which capabilities researchers prioritize and optimize for.
More from Stanford Online
View all
Stanford MS&E435 Economics of the AI Supercycle | Spring 2026 | Enterprise Internal Knowledge
Former OpenAI researcher Yash Bottle traces AI model evolution from AlexNet to reasoning agents, identifying continual learning as the next bottleneck while explaining why code dominance stems from verifiable rewards and why enterprises must leverage proprietary data to bridge the gap between frontier models and business context.
Stanford MS&E435 | Spring 2026 | Economics of Generative AI
Stanford instructor Apur frames generative AI as a supercycle with inverted economics where semiconductor and infrastructure costs dominate revenues while application-layer value remains elusive, questioning whether this structure represents a temporary capex cycle or a new permanent equilibrium.
Stanford Robotics Seminar ENGR319 | Spring 2026 | Integrated Learning and Planning
This seminar presents a neuro-symbolic approach to robot learning that combines neural visual representations with physics-based constraint optimization to enable one-shot skill acquisition, achieving over 90% success rates on novel objects compared to 0% for standard policy learning methods.
Stanford Robotics Seminar ENGR319 | Spring 2026 | Interactive Autonomy
UC Berkeley's Icon Lab presents game-theoretic frameworks enabling robots to safely interact with humans and other agents by modeling joint prediction as potential games, reducing computational costs by 20x while solving the challenge of multiple social equilibria in real-time navigation.