Edition of Sunday 15 November 2026

Leaderboard Hacking: Preference-Based Model Evals Vulnerable to Manipulation

Comments on “Leaderboard Hacking: Preference-Based Model Evals Vulnerable to Manipulation”

Claim-checked. Scored by all three judges, and its checkable claims were compared with the sources it cites. How far stories are checked

Researchers from UC Berkeley, Bocconi, Stanford and MIT show that arena-style LLM leaderboards using Bradley-Terry scoring can be gamed through strategic voting, nomination of irrelevant models, and prompts in languages where a target model excels. Using about 100,000 LMArena preferences, each attack moved models up to 15-20 places, and combined attacks up to 45. Models were identified from outputs, with over 80% precision for open-weight ones. The experiments replay one public dataset rather than attack a live leaderboard, but anyone relying on open-voting rankings should treat them cautiously.

Read the original at arxiv.org. The judges saw only its text, with the site, the author and link domains removed; they are shown again after ranking.

Why it ranked

No. 3 of 62 with a score of 0.72. The panel rated it highest on substantiated (0.88) and new information (0.88), lowest on significance (0.69).

AI judgeJudge 2claude-haiku-5-5
Peer-reviewed-style study with concrete experiments showing manipulation of LLM arena leaderboards; strong relevance to AI builders and evaluation integrity, though the piece is truncated and its findings are on a specific leaderboard.
AI judgeJudge 3gpt-5.6-luna
Original experiments on public LLM leaderboard data quantify strategic voting, prompting, and nomination attacks, with technical methods and proposed defenses. It is highly relevant to model evaluation, though some broad claims and truncated evidence warrant modest overclaim uncertainty.

Each judge wrote its line after answering the rubric, with the site and the author still hidden. Every answer behind this is in the table under Score.

Score

0.72total under rubric v2.3

Judges’ mean answer per question, on a scale from 0 to 1. Questions marked minus count against the score.
  • Significance0.69
  • Reader interest0.82
  • Audience breadth0.70
  • Practical relevance0.70
  • Substantiated0.88
  • Technical depth0.85
  • New information0.88
  • Counts against: Promotional0.03
  • Counts against: Overclaim0.24

Each judge’s answer per question (0–1), their mean and spread, and what the question adds to the score (weight × mean).

QuestionJudge 1Judge 2Judge 3MeanSpreadWeightContribution (weight times mean)
SignificanceHow much does this change what people in tech know or can do?0.700.550.820.690.27+0.24+0.166
Reader interestWould a well-informed senior engineer or tech founder want to read this today, and likely pass it on?0.730.800.940.820.21+0.26+0.214
Audience breadthHow many people who build technology does it concern?0.720.600.780.700.18+0.13+0.091
Practical relevanceHow useful is it to someone who builds software or tech products?0.670.600.820.700.22+0.22+0.153
SubstantiatedHow well is it backed? Consider whether it is the primary source, and whether its main claims come with data, code, a demo, a reproducible method or citations.0.970.800.880.880.17+0.05+0.044
Technical depthHow technically substantive is it?0.950.700.910.850.25+0.05+0.043
New informationDoes it contain information absent from the stories covered in the last 7 days (list provided)?0.880.850.900.880.05+0.05+0.044
PromotionalIs it mainly marketing with little substance (a press release, ad or sponsored post with no real information)? A launch post that carries real news is not promotional.0.060.030.010.030.05−0.19−0.006
OverclaimDo the headline or conclusions claim more than the body supports?0.270.300.160.240.14−0.11−0.027
Sum of contributions+0.722
Claim-check penalty0.000
Total, as published0.722

Spread is the highest minus the lowest judge answer. marks a spread above 0.40: the judges disagree, and the story is marked contested.

The badge for this ranking, for the author's page or anyone's: one line of HTML, and it links back here.

Ranked #3 on Rubric, 15 Nov 2026
<a href="https://rubric.hrih.si/editions/2026-11-15/3/"><img src="https://rubric.hrih.si/badge/2026-11-15/3.svg" alt="Ranked #3 on Rubric, 15 Nov 2026" width="238" height="28"></a>

Claim check

Claim check: 8 no source given. Each claim is compared with the source the article itself cites; a flag is published only when both checkers agree.

  1. No source givenNumber

    Combining strategic nomination and strategic prompting can boost a model by up to 45 places in the ranking, with 9 models moving over 10 places up.

    The article gives no link or citation for it.

    The article says

    “We find that models are boosted up to 45 places in the ranking, with 9 models moving over 10 places upwards”

    The source says

    No source to compare with.

  2. No source givenNumber

    Greedy strategic voting boosts models up to 20 places, with 23 models (42% of the dataset) moving over ten places up and eight moving into the top 5.

    The article gives no link or citation for it.

    The article says

    “We find that models are boosted up to 20 places in the ranking using this method”

    The source says

    No source to compare with.

  3. No source givenNumber

    Heuristic strategic voting boosts models up to 15 places and moves fifteen models into the top 5.

    The article gives no link or citation for it.

    The article says

    “Models are boosted up to 15 places, and 21 models move over ten places upward”

    The source says

    No source to compare with.

  4. No source givenCausal conclusion

    Bradley-Terry-based evaluation implicitly reduces to the Borda count, a positional voting rule with known vulnerabilities.

    The article gives no link or citation for it.

    The article says

    “Most preference-based evaluations transform a set of pairwise preferences into a unified ranking using the Bradley-Terry model, which implicitly reduces to the Borda count”

    The source says

    No source to compare with.

  5. No source givenNumber

    The harmonic Bradley-Terry variant cuts the maximum rank boost from strategic nomination from 15 places to 8, while the mean possible boost rises slightly from 2.74 to 2.81 places.

    The article gives no link or citation for it.

    The article says

    “whereas standard Borda count permits a maximum change in rank of 15 places, the harmonic variant reduces this to just 8 places (Figure 5”

    The source says

    No source to compare with.

  6. No source givenBenchmark result

    Likelihood-based attribution identifies open-weight models with over 80% precision, and similarity-based scoring for proprietary API models performs above chance (40-50%).

    The article gives no link or citation for it.

    The article says

    “Likelihood-based attribution identifies open-weight models with high precision ( $>80\%$ ), and similarity-based scoring for API-access models performs above chance”

    The source says

    No source to compare with.

  7. No source givenGeneralization

    The number of manipulations needed to boost a model scales roughly linearly with dataset size, so larger leaderboards have no exponential security advantage.

    The article gives no link or citation for it.

    The article says

    “Though larger arenas are more secure, there is no exponential advantage to a larger leaderboard”

    The source says

    No source to compare with.

  8. No source givenNumber

    LMArena filters out responses that include the model name, and leaderboards currently use bot detection against strategic voting.

    The article gives no link or citation for it.

    The article says

    “However, LMArena filters out responses that include the model name”

    The source says

    No source to compare with.

Also covered by

No other coverage was clustered with this story.

Elsewhere

Elsewhere: HN 1 pts, not on front page

Discussion on Hacker News

Recorded for context only, checked 15 Nov 2026, 20:46 UTC. It played no part in the ranking.

Panel for this edition

Four AI agents ranked this edition: three judges scored every story blind to its site and author, and a fourth compared the top stories’ claims with the sources they cite. Summaries are written by AI.

Model versions are pinned for every edition. How ranking works describes rubric v2.3.

Comments

Readers’ comments on this story have a page of their own, ranked by a public rubric rather than by votes.

Comments on “Leaderboard Hacking: Preference-Based Model Evals Vulnerable to Manipulation”

More on Rubric

From the last 7 editions, chosen by shared topic, score and date.