mlsanityData to 14 Oct 2026

Which Coauthor Should I Nominate in My 99 ICLR Submissions? A Mathematical Analysis of the ICLR 2026 Reciprocal Reviewer Nomination Policy

arXiv 2512.17950 ↗First posted 17 Dec 2025cs.GT cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

The rapid growth of AI conference submissions has created an overwhelming reviewing burden. To alleviate this, recent venues such as ICLR 2026 introduced a reviewer nomination policy: each submission must nominate one of its authors as a reviewer, and any paper nominating an irresponsible reviewer is desk-rejected. We study this new policy from the perspective of author welfare. Assuming each author carries a probability of being irresponsible, we ask: how can authors (or automated systems) nominate reviewers to minimize the risk of desk rejections? We formalize and analyze three variants of the desk-rejection risk minimization problem. The basic problem, which minimizes expected desk rejections, is solved optimally by a simple greedy algorithm. We then introduce hard and soft nomination limit variants that constrain how many papers may nominate the same author, preventing widespread failures if one author is irresponsible. These formulations connect to classical optimization frameworks, including minimum-cost flow and linear programming, allowing us to design efficient, principled nomination strategies. Our results provide the first theoretical study for reviewer nomination policies, offering both conceptual insights and practical directions for authors to wisely choose which co-author should serve as the nominated reciprocal reviewer.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 32 of its 79 references that are in the map. First posted on arXiv 17 Dec 2025.

Builds on

32 of 79 references.

References · 32

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2021Convex optimizationcited by 2,515
  3. 2018Solving Linear Programs in the Current Matrix Multiplication Timecited by 100
  4. 2021Training Multi-Layer Over-Parametrized Neural Network in Subquadratic Timecited by 62
  5. 2019Solving Empirical Risk Minimization in the Current Matrix Multiplication Timecited by 53
  6. 2020Mitigating Manipulation in Peer Review via Randomized Reviewer Assignmentscited by 38
  7. 2017Design and Analysis of the NIPS 2016 Review Processcited by 33
  8. 2019Does My Rebuttal Matter? Insights from a Major NLP Conferencecited by 31
  9. 2018PeerReview4All: Fair and Accurate Reviewer Assignment in Peer Reviewcited by 30
  10. 2019Paper Matching with Local Fairness Constraintscited by 30
  11. 2020A Nearly-Linear Time Algorithm for Linear Programs with Small Treewidth: A Multiscale Representation of Robust Central Pathcited by 29
  12. 2018Your 2 is My 1, Your 3 is My 9: Handling Arbitrary Miscalibrations in Ratingscited by 28
20 more
  1. 2019Learning Mixtures of Linear Regressions in Subexponential Time via Fourier Momentscited by 26
  2. 2022Training Overparametrized Neural Networks in Sublinear Timecited by 22
  3. 2020Solving Tall Dense Linear Programs in Nearly Linear Timecited by 21
  4. 2023Solving Attention Kernel Regression Problem via Pre-conditionercited by 20
  5. 2022Matching Papers and Reviewers at Large Conferencescited by 18
  6. 2018On Strategyproof Conference Peer Reviewcited by 17
  7. 2019On Testing for Biases in Peer Reviewcited by 15
  8. 2020Space-Efficient Interior Point Method, with applications to Linear Programming and Maximum Weight Bipartite Matchingcited by 14
  9. 2023A Nearly-Optimal Bound for Fast Regression with ℓ_∞ Guaranteecited by 14
  10. 2023Faster Algorithms for Structured Linear and Kernel Support Vector Machinescited by 13
  11. 2018Loss Functions, Axioms, and Peer Reviewcited by 10
  12. 2020A SUPER* Algorithm to Optimize Paper Bidding in Peer Reviewcited by 10
  13. 2021I Will Have Order! Optimizing Orders for Fair Reviewer Assignmentcited by 9
  14. 2023Federated Empirical Risk Minimization via Second-Order Methodcited by 9
  15. 2025Dissecting Submission Limit in Desk-Rejections: A Mathematical Analysis of Fairness in AI Conference Policiescited by 9
  16. 2021Near-Optimal Reviewer Splitting in Two-Phase Paper Reviewing and Conference Experiment Designcited by 6
  17. 2022Strategyproofing Peer Assessment via Partitioning: The Price in Terms of Evaluators' Expertisecited by 6
  18. 2023Reviewer Assignment Problem: A Systematic Review of the Literaturecited by 2
  19. 2025Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Datacited by 1
  20. 2025When a Paper Has 1000 Authors: Rethinking Citation Metrics in the Era of LLMscited by 1

Built on by

Not cited yet.