mlsanityData to 7 Oct 2026

Vulnerability of Text-Matching in ML/AI Conference Reviewer Assignments to Collusions

arXiv 2412.06606 ↗First posted 9 Dec 2024cs.LG cs.CR cs.DLcited by 7

Not on the map. Why?

Abstract (arXiv)

In the peer review process of top-tier machine learning (ML) and artificial intelligence (AI) conferences, reviewers are assigned to papers through automated methods. These assignment algorithms consider two main factors: (1) reviewers' expressed interests indicated by their bids for papers, and (2) reviewers' domain expertise inferred from the similarity between the text of their previously published papers and the submitted manuscripts. A significant challenge these conferences face is the existence of collusion rings, where groups of researchers manipulate the assignment process to review each other's papers, providing positive evaluations regardless of their actual quality. Most efforts to combat collusion rings have focused on preventing bid manipulation, under the assumption that the text similarity component is secure. In this paper, we demonstrate that even in the absence of bidding, colluding reviewers and authors can exploit the machine learning based text-matching component of reviewer assignment used at top ML/AI venues to get assigned their target paper. We also highlight specific vulnerabilities within this system and offer suggestions to enhance its robustness.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 19 of its 36 references that are in the map. First posted on arXiv 9 Dec 2024.

Builds on

19 of 36 references.

References · 19

  1. 2019Is BERT Really Robust? A Strong Baseline for Natural Language Attack on Text Classification and Entailmentcited by 663
  2. 2020BERT-ATTACK: Adversarial Attack Against BERT Using BERTcited by 488
  3. 2020SPECTER: Document-level Representation Learning using Citation-informed Transformerscited by 426
  4. 2022SciRepEval: A Multi-Format Benchmark for Scientific Document Representationscited by 124
  5. 2022Neighborhood Contrastive Learning for Scientific Document Representations with Citation Embeddingscited by 75
  6. 2020Mitigating Manipulation in Peer Review via Randomized Reviewer Assignmentscited by 38
  7. 2018PeerReview4All: Fair and Accurate Reviewer Assignment in Peer Reviewcited by 30
  8. 2019Paper Matching with Local Fairness Constraintscited by 30
  9. 2019Simple and Effective Paraphrastic Similarity from Parallel Translationscited by 25
  10. 2022Matching Papers and Reviewers at Large Conferencescited by 18
  11. 2023Editable User Profiles for Controllable Text Recommendationcited by 16
  12. 2021Making Paper Reviewing Robust to Bid Manipulation Attackscited by 12
7 more
  1. 2021I Will Have Order! Optimizing Orders for Fair Reviewer Assignmentcited by 9
  2. 2022A Dataset on Malicious Paper Bidding in Peer Reviewcited by 9
  3. 2023No more Reviewer #2: Subverting Automatic Paper-Reviewer Assignment using Adversarial Learningcited by 7
  4. 2024On the Detection of Reviewer-Author Collusion Rings From Paper Biddingcited by 7
  5. 2021Combating Collusion Rings is Hard but Possiblecited by 6
  6. 2023A One-Size-Fits-All Approach to Improving Randomness in Paper Assignmentcited by 6
  7. 2022Tradeoffs in Preventing Manipulation in Paper Bidding for Reviewer Assignmentcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 3; 2026: 4.

7 papers.