IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2206.08149.html
   My bibliography  Save this paper

You Are the Best Reviewer of Your Own Papers: The Isotonic Mechanism

Author

Listed:
  • Weijie Su

Abstract

Machine learning (ML) and artificial intelligence (AI) conferences including NeurIPS and ICML have experienced a significant decline in peer review quality in recent years. To address this growing challenge, we introduce the Isotonic Mechanism, a computationally efficient approach to enhancing the accuracy of noisy review scores by incorporating authors' private assessments of their submissions. Under this mechanism, authors with multiple submissions are required to rank their papers in descending order of perceived quality. Subsequently, the raw review scores are calibrated based on this ranking to produce adjusted scores. We prove that authors are incentivized to truthfully report their rankings because doing so maximizes their expected utility, modeled as an additive convex function over the adjusted scores. Moreover, the adjusted scores are shown to be more accurate than the raw scores, with improvements being particularly significant when the noise level is high and the author has many submissions -- a scenario increasingly prevalent at large-scale ML/AI conferences. We further investigate whether submission quality information beyond a simple ranking can be truthfully elicited from authors. We establish that a necessary condition for truthful elicitation is that the mechanism be based on pairwise comparisons of the author's submissions. This result underscores the optimality of the Isotonic Mechanism, as it elicits the most fine-grained truthful information among all mechanisms we consider. We then present several extensions, including a demonstration that the mechanism maintains truthfulness even when authors have only partial rather than complete information about their submission quality. Finally, we discuss future research directions, focusing on the practical implementation of the mechanism and the further development of a theoretical framework inspired by our mechanism.

Suggested Citation

  • Weijie Su, 2022. "You Are the Best Reviewer of Your Own Papers: The Isotonic Mechanism," Papers 2206.08149, arXiv.org, revised Mar 2025.
  • Handle: RePEc:arx:papers:2206.08149
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2206.08149
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Sahand Negahban & Sewoong Oh & Devavrat Shah, 2017. "Rank Centrality: Ranking from Pairwise Comparisons," Operations Research, INFORMS, vol. 65(1), pages 266-287, February.
    2. J. Kruskal, 1964. "Nonmetric multidimensional scaling: A numerical method," Psychometrika, Springer;The Psychometric Society, vol. 29(2), pages 115-129, June.
    3. Sahand Negahban & Sewoong Oh & Devavrat Shah, 2017. "Rank Centrality: Ranking from Pairwise Comparisons," Operations Research, INFORMS, vol. 65(1), pages 266-287, February.
    4. Gneiting, Tilmann & Raftery, Adrian E., 2007. "Strictly Proper Scoring Rules, Prediction, and Estimation," Journal of the American Statistical Association, American Statistical Association, vol. 102, pages 359-378, March.
    5. Krishna, Vijay & Maenner, Eliot, 2001. "Convex Potentials with an Application to Mechanism Design," Econometrica, Econometric Society, vol. 69(4), pages 1113-1119, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jibang Wu & Haifeng Xu & Yifan Guo & Weijie Su, 2023. "A Truth Serum for Eliciting Self-Evaluations in Scientific Reviews," Papers 2306.11154, arXiv.org, revised Feb 2024.
    2. Yuling Yan & Weijie J. Su & Jianqing Fan, 2023. "Isotonic Mechanism for Exponential Family Estimation in Machine Learning Peer Review," Papers 2304.11160, arXiv.org, revised Feb 2025.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Tino Werner, 2022. "Elicitability of Instance and Object Ranking," Decision Analysis, INFORMS, vol. 19(2), pages 123-140, June.
    2. Dipankar Das, 2023. "A Model of Competitive Assortment Planning Algorithm," Papers 2307.09479, arXiv.org.
    3. Christis Katsouris, 2023. "Statistical Estimation for Covariance Structures with Tail Estimates using Nodewise Quantile Predictive Regression Models," Papers 2305.11282, arXiv.org, revised Jul 2023.
    4. Frongillo, Rafael M. & Kash, Ian A., 2021. "General truthfulness characterizations via convex analysis," Games and Economic Behavior, Elsevier, vol. 130(C), pages 636-662.
    5. Yangming Zhou & Jin-Kao Hao & Zhen Li, 2024. "Heuristic Search for Rank Aggregation with Application to Label Ranking," INFORMS Journal on Computing, INFORMS, vol. 36(2), pages 308-326, March.
    6. Alwyn Lim & Shawn Pope, 2022. "What drives companies to do good? A “universal” ordering of corporate social responsibility motivations," Corporate Social Responsibility and Environmental Management, John Wiley & Sons, vol. 29(1), pages 233-255, January.
    7. Carrizosa, Emilio & Guerrero, Vanesa & Romero Morales, Dolores, 2019. "Visualization of complex dynamic datasets by means of mathematical optimization," Omega, Elsevier, vol. 86(C), pages 125-136.
    8. Christopher P. Chambers & Nicolas S. Lambert, 2021. "Dynamic Belief Elicitation," Econometrica, Econometric Society, vol. 89(1), pages 375-414, January.
    9. Saeed Hayati & Kenji Fukumizu & Afshin Parvardeh, 2024. "Kernel mean embedding of probability measures and its applications to functional data analysis," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 51(2), pages 447-484, June.
    10. Azar, Pablo D. & Micali, Silvio, 2018. "Computational principal agent problems," Theoretical Economics, Econometric Society, vol. 13(2), May.
    11. Angelica Gianfreda & Francesco Ravazzolo & Luca Rossini, 2023. "Large Time‐Varying Volatility Models for Hourly Electricity Prices," Oxford Bulletin of Economics and Statistics, Department of Economics, University of Oxford, vol. 85(3), pages 545-573, June.
    12. Koessler, Frédéric & Skreta, Vasiliki, 2016. "Informed seller with taste heterogeneity," Journal of Economic Theory, Elsevier, vol. 165(C), pages 456-471.
    13. Tobias Fissler & Yannick Hoga, 2024. "How to Compare Copula Forecasts?," Papers 2410.04165, arXiv.org.
    14. Davide Pettenuzzo & Francesco Ravazzolo, 2016. "Optimal Portfolio Choice Under Decision‐Based Model Combinations," Journal of Applied Econometrics, John Wiley & Sons, Ltd., vol. 31(7), pages 1312-1332, November.
    15. Rubio, F.J. & Steel, M.F.J., 2011. "Inference for grouped data with a truncated skew-Laplace distribution," Computational Statistics & Data Analysis, Elsevier, vol. 55(12), pages 3218-3231, December.
    16. Basora, Luis & Viens, Arthur & Chao, Manuel Arias & Olive, Xavier, 2025. "A benchmark on uncertainty quantification for deep learning prognostics," Reliability Engineering and System Safety, Elsevier, vol. 253(C).
    17. Hwang, Eunju, 2022. "Prediction intervals of the COVID-19 cases by HAR models with growth rates and vaccination rates in top eight affected countries: Bootstrap improvement," Chaos, Solitons & Fractals, Elsevier, vol. 155(C).
    18. R de Fondeville & A C Davison, 2018. "High-dimensional peaks-over-threshold inference," Biometrika, Biometrika Trust, vol. 105(3), pages 575-592.
    19. Armantier, Olivier & Treich, Nicolas, 2013. "Eliciting beliefs: Proper scoring rules, incentives, stakes and hedging," European Economic Review, Elsevier, vol. 62(C), pages 17-40.
    20. Domenico Piccolo & Rosaria Simone, 2019. "The class of cub models: statistical foundations, inferential issues and empirical evidence," Statistical Methods & Applications, Springer;Società Italiana di Statistica, vol. 28(3), pages 389-435, September.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2206.08149. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.