PeerReview4All: Fair and Accurate Reviewer Assignment in Peer Review

We consider the problem of automated assignment of papers to reviewers in conference peer review, with a focus on fairness and statistical accuracy. Our fairness objective is to maximize the review quality of the most disadvantaged paper, in contrast to the commonly used objective of maximizing the total quality over all papers. We design an assignment algorithm based on an incremental max-flow procedure that we prove is near-optimally fair. Our statistical accuracy objective is to ensure correct recovery of the papers that should be accepted. We provide a sharp minimax analysis of the accuracy of the peer-review process for a popular objective-score model as well as for a novel subjective-score model that we propose in the paper. Our analysis proves that our proposed assignment algorithm also leads to a near-optimal statistical accuracy. Finally, we design a novel experiment that allows for an objective comparison of various assignment algorithms, and overcomes the inherent difficulty posed by the absence of a ground truth in experiments on peer-review. The results of this experiment as well as of other experiments on synthetic and real data corroborate the theoretical guarantees of our algorithm.

[1]  Laurent Massoulié,et al.  A queueing analysis of max-min fairness, proportional fairness and balanced fairness , 2006, Queueing Syst. Theory Appl..

[2]  Richard S. Zemel,et al.  The Toronto Paper Matching System: An automated paper-reviewer assignment system , 2013 .

[3]  Clark McPhail,et al.  The Manuscript Review and Decision-Making Process , 1987 .

[4]  Claudio Gandelli,et al.  Saint Matthew strikes again: An agent-based model of peer review and the scientific community structure , 2012, J. Informetrics.

[5]  Nihar B. Shah,et al.  Your 2 is My 1, Your 3 is My 9: Handling Arbitrary Miscalibrations in Ratings , 2018, AAMAS.

[6]  Ulrike von Luxburg,et al.  Peer Grading in a Course on Algorithms and Data Structures: Machine Learning Algorithms do not Improve over Simple Baselines , 2016, L@S.

[7]  Robert E. Tarjan,et al.  A faster deterministic maximum flow algorithm , 1992, SODA '92.

[8]  Guillaume Cabanac,et al.  Expert suggestion for conference program committees , 2017, 2017 11th International Conference on Research Challenges in Information Science (RCIS).

[9]  Alan L. Porter,et al.  Peer Review of Interdisciplinary Research Proposals , 1985 .

[10]  Geneva G. Belford,et al.  Multi-aspect expertise matching for review assignment , 2008, CIKM '08.

[11]  Andrew McCallum,et al.  Expertise modeling for matching papers with reviewers , 2007, KDD '07.

[12]  Michèle Lamont,et al.  How Professors Think: Inside the Curious World of Academic Judgment , 2009 .

[13]  Nikhil Bansal,et al.  The Santa Claus problem , 2006, STOC '06.

[14]  Camillo J. Taylor,et al.  On the Optimal Assignment of Conference Papers to Reviewers , 2008 .

[15]  Nasir D. Memon,et al.  A robust model for paper reviewer assignment , 2014, RecSys '14.

[16]  Nihar B. Shah,et al.  On Strategyproof Conference Peer Review , 2018, IJCAI.

[17]  S. Kerr,et al.  Manuscript Characteristics Which Influence Acceptance for Management and Social Science Journals , 1977 .

[18]  Jie Tang,et al.  Expertise Matching via Constraint-Based Optimization , 2010, Web Intelligence.

[19]  Natalie S. Glance,et al.  Star Quality: Aggregating Reviews to Rank Products and Merchants , 2010, ICWSM.

[20]  Nihar B. Shah,et al.  On Testing for Biases in Peer Review , 2019, NeurIPS.

[21]  Harold Maurice Collins,et al.  New Light on Old Boys: Cognitive and Institutional Particularism in the Peer Review System , 1991 .

[22]  Hui Lin,et al.  A Class of Submodular Functions for Document Summarization , 2011, ACL.

[23]  Andrew McCallum,et al.  Paper Matching with Local Fairness Constraints , 2019, KDD.

[24]  N. Black,et al.  What makes a good reviewer and a good review for a general medical journal? , 1998, JAMA.

[25]  Warren Thorngate,et al.  By the Numbers: Track Record, Flawed Reviews, Journal Space, and the Fate of Talented Authors , 2013, ESSA.

[26]  Robert S. Garfinkel,et al.  Technical Note - An Improved Algorithm for the Bottleneck Assignment Problem , 1971, Oper. Res..

[27]  Isabelle Guyon,et al.  Design and Analysis of the NIPS 2016 Review Process , 2017, J. Mach. Learn. Res..

[28]  Craig Boutilier,et al.  A Framework for Optimizing Paper Matching , 2011, UAI.

[29]  Nihar B. Shah,et al.  Choosing How to Choose Papers , 2018, ArXiv.

[30]  Johan Bollen,et al.  Mapping the Bid Behavior of Conference Referees , 2006, J. Informetrics.

[31]  Kurt Mehlhorn Assigning Papers to Referees , 2009, ICALP.

[32]  Alan L. Porter,et al.  Peer Review of Interdisciplinary Research Proposals : Science, Technology & Human Values , 1987 .

[33]  Johan Bollen,et al.  An algorithm to determine peer-reviewers , 2006, CIKM '08.

[34]  Peter A. Flach,et al.  Novel tools to streamline the conference review process: experiences from SIGKDD'09 , 2010, SKDD.

[35]  Nihar B. Shah,et al.  A SUPER* Algorithm to Optimize Paper Bidding in Peer Review , 2020, UAI.

[36]  Iryna Gurevych,et al.  Does My Rebuttal Matter? Insights from a Major NLP Conference , 2019, NAACL.

[37]  Meng Wang,et al.  Context-Aware Reviewer Assignment for Trust Enhanced Peer Review , 2015, PloS one.

[38]  Michael Luca,et al.  Aggregation of Consumer Ratings: An Application to Yelp.com , 2012 .

[39]  Jörg Rothe,et al.  How to Calibrate the Scores of Biased Reviewers by Quadratic Programming , 2011, AAAI.

[40]  J. R. Cole,et al.  Chance and consensus in peer review. , 1981, Science.

[41]  M. Mahoney Publication prejudices: An experimental study of confirmatory bias in the peer review system , 1977, Cognitive Therapy and Research.

[42]  J. Rawls A Theory of Justice , 1999 .

[43]  James B. Orlin,et al.  Max flows in O(nm) time, or better , 2013, STOC '13.

[44]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[45]  Min Zhang,et al.  Reviewer bias in single- versus double-blind peer review , 2017, Proceedings of the National Academy of Sciences.

[46]  E. L. Hahne,et al.  Round-Robin Scheduling for Max-Min Fairness in Data Networks , 1991, IEEE J. Sel. Areas Commun..

[47]  Flaminio Squazzoni,et al.  Is three better than one? simulating the effect of reviewer selection and behavior on the quality and efficiency of peer review , 2015, 2015 Winter Simulation Conference (WSC).

[48]  Andrzej Galat,et al.  Technical note , 2008, Comput. Biol. Chem..

[49]  David Hartvigsen,et al.  The Conference Paper‐Reviewer Assignment Problem* , 1999 .

[50]  Amin Saberi,et al.  An approximation algorithm for max-min fair allocation of indivisible goods , 2007, STOC '07.

[51]  Judy Goldsmith,et al.  The AI conference paper assignment problem , 2007, AAAI 2007.

[52]  Martin J. Wainwright,et al.  Simple, Robust and Optimal Ranking from Pairwise Comparisons , 2015, J. Mach. Learn. Res..

[53]  Stefan Thurner,et al.  Peer-review in a world with rational scientists: Toward selection of the average , 2010, 1008.4324.

[54]  Salem Benferhat,et al.  Conference paper assignment , 2001, Int. J. Intell. Syst..

[55]  Cheng Long,et al.  On Good and Fair Paper-Reviewer Assignment , 2013, 2013 IEEE 13th International Conference on Data Mining.

[56]  T. Asano,et al.  ENTROPY , RELATIVE ENTROPY , AND MUTUAL INFORMATION , 2008 .

[57]  Dirk Helbing,et al.  Peer review and competition in the Art Exhibition Game , 2016, Proceedings of the National Academy of Sciences.

[58]  E. Ernst,et al.  Reviewer bias: a blinded experimental study. , 1994, The Journal of laboratory and clinical medicine.

[59]  Noam Nisan,et al.  Towards a characterization of truthful combinatorial auctions , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[60]  R. Merton The Matthew Effect in Science , 1968, Science.