AI News HubLIVE
Original source2 min read

RoPoLL: Robust Panel of LLM Judges

This paper formalizes the LLM Jury under the Huber contamination model and shows that PoLL incurs unbounded bias under any positive contamination if a single judge fails in a biased, LLM-typical way. By framing jury consensus as robust mean estimation, the authors propose RoPoLL using the geometric median as aggregation, achieving optimal breakdown point 1/2. Experiments across 13 judges, three benchmarks, and four corruption regimes show RoPoLL dominates PoLL on every biased corruption type, with a 3-judge committee at 38B outperforming Mistral-Large-3 (675B) by 1.31x under 30% bimodal-random corruption.

SourcearXiv AIAuthor: Anish Acharya, Kris W Pan, Brian Verkhovsky

-->

[Submitted on 29 Jun 2026]

Title:RoPoLL: Robust Panel of LLM Judges

View a PDF of the paper titled RoPoLL: Robust Panel of LLM Judges, by Anish Acharya and 2 other authors

View PDF HTML (experimental)

Abstract:The LLM Jury, a Panel of LLM Evaluators (PoLL) reporting consensus scores, has become a practical alternative to single-judge LLM evaluation, yet its statistical behavior remains poorly understood. We formalize the LLM Jury under the Huber contamination model and show that PoLL incurs unbounded bias

under any positive contamination, regardless of jury size, whenever a single judge fails in a biased, LLM-typical way (mode collapse, sycophancy, safety refusal). Framing jury consensus as classical robust mean estimation, we propose RoPoLL (Robust Panel of LLM-as-Judge), which preserves the PoLL

panel but replaces the aggregation function with a robust mean estimator, instantiated with the geometric median (GM): tuning-free, with the optimal finite-sample breakdown point 1/2. A finite-sample error bound and a matching information-theoretic minimax lower bound agree on the parametric rate

sigma*sqrt(d/N) and differ on the breakdown floor by a factor of sqrt(d), a statistical-computational gap that polynomial-time RoPoLL pays relative to the intractable Tukey halfspace median. Across 13 open-weight judges (4B-675B), three reward-model benchmarks, and four corruption regimes at rates up

to 50%, RoPoLL dominates PoLL on every biased corruption type: by about 19% on cross-dimensional attacks at matched compute, and by orders of magnitude on heavy-tailed Byzantine adversaries. A 3-judge RoPoLL committee at 38B beats Mistral-Large-3 (675B) by 1.31x on HelpSteer-2 under 30% bimodal-random

corruption, an 18x parameter advantage at better accuracy; a Noisy-GT control confirms the premium is paid against biased contamination, not benign imprecision.

Subjects:

Artificial Intelligence (cs.AI); Machine Learning (cs.LG); Multiagent Systems (cs.MA); Optimization and Control (math.OC); Probability (math.PR)

Cite as: arXiv:2606.30931 [cs.AI]

(or arXiv:2606.30931v1 [cs.AI] for this version)

https://doi.org/10.48550/arXiv.2606.30931

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Anish Acharya [view email] [v1] Mon, 29 Jun 2026 21:34:27 UTC (474 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled RoPoLL: Robust Panel of LLM Judges, by Anish Acharya and 2 other authors

View PDF

HTML (experimental)

TeX Source

view license

Current browse context:

cs.AI

new | recent | 2026-06

Change to browse by:

cs cs.LG cs.MA math math.OC math.PR

References & Citations

NASA ADS

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)