liveBook · Manning

Perplexity

As explained in Sutskever's List

Perplexity is a language-model metric representing the effective number of plausible next tokens, with lower values indicating greater predictive certainty.

Perplexity measures how surprised a language model is by new tokens: lower values indicate greater predictive certainty, while higher values indicate uncertainty. section 4.3

A multiple-choice interpretation

A perplexity of 100 means the model behaves roughly as if it were choosing among 100 plausible next tokens. Randomly guessing from a 50,000-token vocabulary would yield perplexity around 50,000, so 100 reflects learned patterns despite limited confidence. section 4.3

Perplexity became a practical hurdle for recurrent neural networks on Penn Treebank benchmarks, where reducing it below 100 was once difficult because of overfitting. section 4.3

How Sutskever's List covers it

How deep it goes
Defines the metric intuitively and compares benchmark values, but does not derive its mathematical formula or computation.
Examples
Uses a multiple-choice quiz, a 50,000-token random baseline, and a perplexity-100 Penn Treebank threshold.
What it assumes
Assumes familiarity with tokens and language models while defining predictive surprise and plausible next-token choices from zero.
What you can do after
Evaluate language-model certainty and compare sequential-modeling results using perplexity values.
How it connects
Connects language models with recurrent neural networks, LSTMs, overfitting, dropout, and Penn Treebank benchmarks.

Also explained in

Compare how 5 books explain perplexity →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Sutskever's List. The section links point to the parts of the book it draws on.