179 questions
No questions match those filters.
Model A scores a perplexity of 2.1 and Model B scores 2...
This is one of the questions in the full AI/ML interview bank. Pro unlocks all 1789 questions; Premium includes the same bank plus the highest daily Practice limit.
See plansPerplexity is defined as the exponential of the average negative log- likelihood per token: PPL = exp(-(1/N)·Σ log P(xᵢ)), and the entire comparison hinges on what N — the token count — actually represents. N is a direct function of the tokenizer’s vocabulary and compression efficiency, not an intrinsic property of the text. If Model A’s tokenizer splits “unbelievable” into four pieces and Model B’s treats it as one token, both models can assign the exact same total log- probability to the sequence and still report very different perplexity numbers, purely because they’re dividing by different denominators.
Concretely, a model with a worse, more fragmented tokenizer will tend to report a lower (better-looking) perplexity for the same underlying quality, because spreading the same total probability mass across more tokens deflates the per-token average. Comparing 2.1 versus 2.4 across two different tokenizer families without accounting for this is like comparing a runner who covered 10 miles to one who covered 12 kilometers and declaring a winner without converting units — you’re not measuring the same thing.
The fix is to normalize onto a tokenizer-independent basis before comparing anything: bits-per-byte or a per-character log-likelihood, which lets you compare total information content regardless of how each model happened to chop the text into pieces. Until that normalization is done, a “lower” perplexity number tells you as much about tokenizer design as it does about model quality, and it’s not safe to use as a deployment decision on its own.