Lesson 8.7core3 h

Evaluating LLMs

Benchmarks, arenas, judges — and the eval set that actually matters: yours

You cannot improve what you cannot measure, and with LLMs almost everything is hard to measure: outputs are open-ended, public benchmarks leak into training data, and the cheapest grader — another LLM — has biases of its own. Every later decision (prompt changes 8.4 Prompting as programming, fine-tuning 8.2 Fine-tuning and PEFT, RAG design 9.8 Evaluating and observing LLM apps, agent reliability 10.9 Evaluating agents) is only as good as the evaluation behind it. This lesson gives you the benchmark landscape, the statistics from 1.8 Statistics essentials applied to leaderboards, and a method for building your own evals.

You'll be able to

  • Interpret perplexity and explain why it stops tracking usefulness after alignment
  • Map the major benchmark families to the capabilities they measure and know which are saturated
  • Explain how human-preference arenas produce ratings and what biases they carry
  • Design an LLM-as-judge protocol that controls position, verbosity and self-preference bias
  • Quantify statistical noise and contamination, and build a task-specific eval set

Key ideas

  1. Public benchmarks tell you what to try; your own eval set tells you what to ship.
  2. Perplexity = exp(mean NLL); it tracks pretraining but decouples from usefulness after alignment and is only comparable with the same tokenizer and text.
  3. Benchmark families cover knowledge (MMLU, GPQA), math (GSM8K, competition sets), code (HumanEval, SWE-bench), long context, multimodal, agents and safety — many are saturated or contaminated.
Show 4 more key ideas
  1. Arenas turn pairwise human votes into Bradley–Terry ratings; they favor long, well-formatted, confident answers.
  2. LLM judges are cheap and roughly human-level in agreement, but need position swapping, rubrics, different judge models and calibration against human labels.
  3. A score is an estimate with SE = √(p(1−p)/n): 200-question benchmarks have confidence intervals of several points.
  4. Build evals from real inputs, automate deterministic checks first, run on every change, and read your failures.

Suggested path through this lesson