Allocate Marginal Reviews to Borderline Papers Using LLM Comparative Ranking
Elliot L. Epstein, Rajat Dwaraknath, John Winnicki, Thanawat Sornwanee

TL;DR
This paper introduces a method using large language model-based comparative ranking to identify borderline papers before human review, optimizing marginal review allocation at conferences.
Contribution
It proposes a novel LLM-based ranking approach to pre-identify borderline papers, improving review resource allocation without relying on human reviews or LLM accept/reject outputs.
Findings
Effective identification of borderline papers using LLM ranking.
Improved marginal review allocation based on predicted boundary.
Retrospective proxies for impact estimation.
Abstract
This paper argues that large ML conferences should allocate marginal review capacity primarily to papers near the acceptance boundary, rather than spreading extra reviews via random or affinity-driven heuristics. We propose using LLM-based comparative ranking (via pairwise comparisons and a Bradley--Terry model) to identify a borderline band \emph{before} human reviewing and to allocate \emph{marginal} reviewer capacity at assignment time. Concretely, given a venue-specific minimum review target (e.g., 3 or 4), we use this signal to decide which papers receive one additional review (e.g., a 4th or 5th), without conditioning on any human reviews and without using LLM outputs for accept/reject. We provide a simple expected-impact calculation in terms of (i) the overlap between the predicted and true borderline sets () and (ii) the incremental value of an extra review near the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsExpert finding and Q&A systems · scientometrics and bibliometrics research · Computational and Text Analysis Methods
