arXiv — NLP / Computation & Language · · 3 min read

SCOPE: Selective Conformal Optimized Pairwise LLM Judging

Mirrored from arXiv — NLP / Computation & Language for archival readability. Support the source by reading on the original site.

Computer Science > Computation and Language

arXiv:2602.13110 (cs)
[Submitted on 13 Feb 2026 (v1), last revised 18 Aug 2026 (this version, v4)]

Title:SCOPE: Selective Conformal Optimized Pairwise LLM Judging

View a PDF of the paper titled SCOPE: Selective Conformal Optimized Pairwise LLM Judging, by Sher Badshah and 2 other authors
View PDF HTML (experimental)
Abstract:Large language models (LLMs) are increasingly used as scalable judges in pairwise evaluation, but they remain prone to miscalibration and biases. We propose \textsc{Scope} (Selective Conformal Optimized Pairwise Evaluation), a framework that calibrates an acceptance threshold so that, under exchangeability, the error rate among non-abstained judgments is at most a user-specified level $\alpha$. To supply \textsc{Scope} with a bias-neutral uncertainty signal, we introduce Bidirectional Preference Entropy (BPE), which queries the judge under both response positions and converts the order-averaged preference probability into an entropy-based score. Across various pairwise judging benchmarks, BPE outperforms standard confidence proxies in calibration and discrimination, while \textsc{Scope} consistently satisfies the target risk bound (empirical FDR $\approx 0.097$--$0.099$ at $\alpha=0.10$) and retains substantial coverage. Compared to vanilla baselines, \textsc{Scope} accepts up to $2.4\times$ more judgments under the same risk constraint, demonstrating that BPE enables reliable and high-coverage LLM-based evaluation.
Comments: Accepted at ICML 2026. 23 pages (9 main plus appendix), 7 figures, 11 tables
Subjects: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
MSC classes: 62G15, 62C20, 68T07
ACM classes: I.2.6; I.2.7; I.2.11; F.2.2
Cite as: arXiv:2602.13110 [cs.CL]
  (or arXiv:2602.13110v4 [cs.CL] for this version)
  https://doi.org/10.48550/arXiv.2602.13110
arXiv-issued DOI via DataCite

Submission history

From: Sher Badshah [view email]
[v1] Fri, 13 Feb 2026 17:10:43 UTC (695 KB)
[v2] Thu, 19 Feb 2026 14:41:37 UTC (694 KB)
[v3] Fri, 29 May 2026 16:17:11 UTC (183 KB)
[v4] Tue, 18 Aug 2026 17:19:06 UTC (184 KB)
Full-text links:

Access Paper:

Current browse context:

cs.CL
< prev   |   next >
Change to browse by:

References & Citations

Loading...

BibTeX formatted citation

loading...
Data provided by:

Bookmark

BibSonomy Reddit
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?)
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.

Discussion (0)

Sign in to join the discussion. Free account, 30 seconds — email code or GitHub.

Sign in →

No comments yet. Sign in and be the first to say something.

More from arXiv — NLP / Computation & Language