mlsanityData to 14 Oct 2026

A Gold Standard Dataset for the Reviewer Assignment Problem

arXiv 2303.16750 ↗First posted 23 Mar 2023cs.IR cs.DL cs.LGcited by 11

Not on the map. Why?

Abstract (arXiv)

Many peer-review venues are using algorithms to assign submissions to reviewers. The crux of such automated approaches is the notion of the "similarity score" -- a numerical estimate of the expertise of a reviewer in reviewing a paper -- and many algorithms have been proposed to compute these scores. However, these algorithms have not been subjected to a principled comparison, making it difficult for stakeholders to choose the algorithm in an evidence-based manner. The key challenge in comparing existing algorithms and developing better algorithms is the lack of publicly available gold-standard data. We address this challenge by collecting a novel dataset of similarity scores that we release to the research community. Our dataset consists of 477 self-reported expertise scores provided by 58 researchers who evaluated their expertise in reviewing papers they have read previously. Using our dataset, we compare several widely used similarity algorithms and offer key insights. First, all algorithms exhibit significant error, with misranking rates between 12%-30% in easier cases and 36%-43% in harder ones. Second, most specialized algorithms are designed to work with titles and abstracts of papers, and in this regime the SPECTER2 algorithm performs best. Interestingly, classical TF-IDF matches SPECTER2 in accuracy when given access to full submission texts. In contrast, off-the-shelf LLMs lag behind specialized approaches.

Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). Builds on 19 of its 57 references that are in the map. First posted on arXiv 23 Mar 2023.

Builds on

19 of 57 references.

References · 19

  1. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  2. 2018Deep contextualized word representationscited by 2,290
  3. 2018SentencePiece: A simple and language independent subword tokenizer and detokenizer for Neural Text Processingcited by 1,989
  4. 2019SciBERT: A Pretrained Language Model for Scientific Textcited by 1,414
  5. 2020SPECTER: Document-level Representation Learning using Citation-informed Transformerscited by 430
  6. 2022SciRepEval: A Multi-Format Benchmark for Scientific Document Representationscited by 129
  7. 2020Mitigating Manipulation in Peer Review via Randomized Reviewer Assignmentscited by 38
  8. 2017Design and Analysis of the NIPS 2016 Review Processcited by 33
  9. 2018PeerReview4All: Fair and Accurate Reviewer Assignment in Peer Reviewcited by 30
  10. 2019Paper Matching with Local Fairness Constraintscited by 30
  11. 2019Simple and Effective Paraphrastic Similarity from Parallel Translationscited by 25
  12. 2021Paraphrastic Representations at Scalecited by 21
7 more
  1. 2022Matching Papers and Reviewers at Large Conferencescited by 18
  2. 2019PaRe: A Paper-Reviewer Matching Approach Using a Common Topic Spacecited by 14
  3. 2021Making Paper Reviewing Robust to Bid Manipulation Attackscited by 12
  4. 2020A SUPER* Algorithm to Optimize Paper Bidding in Peer Reviewcited by 10
  5. 2022A Dataset on Malicious Paper Bidding in Peer Reviewcited by 9
  6. 2021Combating Collusion Rings is Hard but Possiblecited by 6
  7. 2022Strategyproofing Peer Assessment via Partitioning: The Price in Terms of Evaluators' Expertisecited by 6

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 3; 2024: 3; 2025: 3; 2026: 2.

11 papers.