AI-ENGINEERING
    intermediate

    Comparative Evaluation & Leaderboards

    AI Engineer path · lesson 89 of 124
    The idea
    Nobody can tell you reliably how good a chess player is out of 100. Everybody can tell you who won the game. Ratings exist to turn a pile of individual results into a single ordering — and they work on model outputs for exactly the same reason.
    How to use
    Vote on several matchups and watch the ratings separate. Then open 'How many votes' and see how large the sample has to be before a 55% win rate means anything.
    One vote is a comparison, not a score. Pick a winner and watch both ratings update — the loser gives up exactly what the winner gains.
    Matchup 1 · which response is better?
    Standings after 0 votes
    1Model A
    1200
    2Model B
    1200
    3Model C
    1200

    Key insight

    Ratings are zero-sum by construction: every point one model gains, its opponent loses. That is what makes the scale meaningful across a whole population of models — and what makes an absolute rating number meaningless on its own.

    How an arena leaderboard is built

    Sequence

    Order the steps from a single vote to a ranking.

    Tap a piece, then tap where it goes — or drag it. Tap the tray to take one back.

    1. 1Drop a step here
    2. 2Drop a step here
    3. 3Drop a step here
    4. 4Drop a step here
    5. 5Drop a step here
    6. 6Drop a step here
    6 pieces left to place

    Test your knowledge

    20 questions
    Question 1 of 20
    Score: 0

    Comparative evaluation asks graders to:

    The short version

    Nobody can tell you reliably how good a chess player is out of 100. Everybody can tell you who won the game. Ratings exist to turn a pile of individual results into a single ordering — and they work on model outputs for exactly the same reason.

    In more depth

    Comparative Evaluation & Leaderboards

    For open-ended outputs, people are much better at judging which of two answers is better than at scoring one answer out of ten. Comparative evaluation builds on that.

    From comparisons to a ranking

    Elo: incremental, one match at a time. Expected score E_A = 1 / (1 + 10^((R_B − R_A) / 400)); update R_A ← R_A + K(S_A − E_A).
    Bradley–Terry: fits all recorded comparisons at once by maximum likelihood. Order-independent, gives proper confidence intervals. Most public "Elo" leaderboards are actually this.

    A 100-point gap means the stronger model wins about 64% of the time.

    Sample size is the thing everyone gets wrong

    95% interval half-width ≈ 1.96 · √(p(1−p)/n). Separating 55% from chance takes roughly 400 votes; 52% takes several thousand. Close models are exactly the ones you are comparing, so most informal A/Bs measure noise. Paired designs (same prompts through both models) cut variance substantially and are free.

    What it hides

    Preferred ≠ correct · no absolute quality · the arena's prompt distribution is not yours · rankings are not always transitive · leaderboards get optimised for once they matter.

    Use a public leaderboard to build the shortlist, never to make the decision.

    Interview Questions

    OpenAI
    Anthropic
    Google
    Meta
    Amazon
    Netflix
    Google
    OpenAI
    Microsoft
    Anthropic
    Meta
    Amazon

    Love this visualization?

    Sign up to track your progress, earn achievements, use the AI assistant, and access your personal learning dashboard.

    100% free • No credit card required