Perplexity › The Evaluation Problem

Consider two language models trained on the same corpus. Model A assigns $P(\text{"the cat sat on the mat"}) = 0.001$. Model B assigns $P(\text{"the cat sat on the mat"}) = 0.0001$. Which model is better?

At first glance, Model A seems superior because it assigns higher probability to a grammatical sentence. But this comparison is misleading. Model A might assign high probability to everything, including nonsense like "mat the on sat cat the." Model B might be more discriminating, reserving high probability for truly likely sequences while assigning near-zero probability to ungrammatical or incoherent text.

We need a metric that rewards models for assigning high probability to actual language while penalizing them for wasting probability mass on unlikely sequences. Perplexity does exactly this by measuring how well a model predicts held-out test data.

The held-out evaluation principle is fundamental. A model can always achieve better probability on its own training data simply by memorizing it. The real question is whether the patterns the model learned from training data generalize to new text it has never seen. Perplexity on a held-out test set answers this question directly.

Think of it like testing a student. A student who memorized answers to practice problems but doesn't understand the underlying concepts will do well on those same practice problems and poorly on a final exam with new questions. Perplexity on held-out data is the final exam: it distinguishes learning from memorization.