{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T04:50:09Z","timestamp":1791435009581,"version":"4.3.3"},"reference-count":27,"publisher":"Institute of Mathematical Statistics","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann. Statist."],"published-print":{"date-parts":[[2025,12,1]]},"abstract":"<jats:p>Across science and policy, decision-makers often need to draw conclusions about the best candidate among competing alternatives. For instance, researchers may seek to infer the effectiveness of the most successful treatment or determine which demographic group benefits most from a specific treatment. Similarly, in machine learning, practitioners are often interested in the population performance of the model that performs best empirically. However, cherry-picking the best candidate leads to the winner\u2019s curse: the observed performance for the winner is biased upwards, rendering conclusions based on standard measures of uncertainty invalid. We introduce the zoom correction, a novel approach for valid inference on the winner. Our method is flexible: it can be employed in both parametric and nonparametric settings, can handle arbitrary dependencies between candidates, and automatically adapts to the level of selection bias. The method easily extends to important related problems, such as inference on the top k winners, inference on the value and identity of the population winner, and inference on \u201cnear-winners.\u201d<\/jats:p>","DOI":"10.1214\/25-aos2553","type":"journal-article","created":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T06:15:31Z","timestamp":1766470531000},"page":"2516-2535","source":"Crossref","is-referenced-by-count":1,"title":["A flexible defense against the winner\u2019s curse"],"prefix":"10.1214","volume":"53","author":[{"given":"Tijana","family":"Zrnic","sequence":"first","affiliation":[{"name":"Stanford Data Science & Department of Statistics, Stanford University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"William","family":"Fithian","sequence":"additional","affiliation":[{"name":"Department of Statistics, University of California, Berkeley"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"108","reference":[{"key":"4","doi-asserted-by":"publisher","unstructured":"<small>Bradley, R. A.<\/small> and <small>Terry, M. E.<\/small> (1952). Rank analysis of incomplete block designs. I. The method of paired comparisons. <i>Biometrika<\/i> <b>39<\/b> 324\u2013345.","DOI":"10.2307\/2334029"},{"key":"12","doi-asserted-by":"publisher","unstructured":"<small>KIVARANOVIC, D.<\/small> and <small>LEEB, H.<\/small> (2021). On the length of post-model-selection confidence intervals conditional on polyhedral constraints. <i>J. Amer. Statist. Assoc.<\/i> <b>116<\/b> 845\u2013857.","DOI":"10.1080\/01621459.2020.1732989"},{"key":"19","doi-asserted-by":"publisher","unstructured":"<small>RASINES, D. G.<\/small> and <small>YOUNG, G. A.<\/small> (2023). Splitting strategies for post-selection inference. <i>Biometrika<\/i> <b>110<\/b> 597\u2013614.","DOI":"10.1093\/biomet\/asac070"},{"key":"13","doi-asserted-by":"publisher","unstructured":"<small>Lee, J. D.<\/small>, <small>Sun, D. L.<\/small>, <small>Sun, Y.<\/small> and <small>Taylor, J. E.<\/small> (2016). Exact post-selection inference, with application to the lasso. <i>Ann. Statist.<\/i> <b>44<\/b> 907\u2013927.","DOI":"10.1214\/15-AOS1371"},{"key":"21","doi-asserted-by":"publisher","unstructured":"<small>Tian, X.<\/small> and <small>Taylor, J.<\/small> (2018). Selective inference with a randomized response. <i>Ann. Statist.<\/i> <b>46<\/b> 679\u2013710.","DOI":"10.1214\/17-AOS1564"},{"key":"7","doi-asserted-by":"crossref","unstructured":"<small>Deng, J.<\/small>, <small>Dong, W.<\/small>, <small>Socher, R.<\/small>, <small>Li, L.-J.<\/small>, <small>Li, K.<\/small> and <small>Fei-Fei, L.<\/small> (2009). Imagenet: A large-scale hierarchical image database. In 2009 <i>IEEE Conference on Computer Vision and Pattern Recognition<\/i> 248\u2013255. IEEE.","DOI":"10.1109\/CVPR.2009.5206848"},{"key":"27","doi-asserted-by":"publisher","unstructured":"<small>ZRNIC, T.<\/small> and <small>JORDAN, M. I.<\/small> (2023). Post-selection inference via algorithmic stability. <i>Ann. Statist.<\/i> <b>51<\/b> 1666\u20131691.","DOI":"10.1214\/23-aos2303"},{"key":"2","doi-asserted-by":"crossref","unstructured":"<small>ANDREWS, I.<\/small>, <small>KITAGAWA, T.<\/small> and <small>MCCLOSKEY, A.<\/small> (2024). Inference on winners. <i>Q. J. Econ.<\/i> <b>139<\/b> 305\u2013358.","DOI":"10.1093\/qje\/qjad043"},{"key":"8","doi-asserted-by":"publisher","unstructured":"<small>DICKHAUS, T.<\/small> (2014). <i>Simultaneous Statistical Inference<\/i>: <i>With Applications in the Life Sciences<\/i>. Springer, Heidelberg.","DOI":"10.1007\/978-3-642-45182-9"},{"key":"10","doi-asserted-by":"publisher","unstructured":"<small>FUENTES, C.<\/small>, <small>CASELLA, G.<\/small> and <small>WELLS, M. T.<\/small> (2018). Confidence intervals for the means of the selected populations. <i>Electron. J. Stat.<\/i> <b>12<\/b> 58\u201379.","DOI":"10.1214\/17-EJS1374"},{"key":"20","doi-asserted-by":"crossref","unstructured":"<small>RASP, S.<\/small>, <small>DUEBEN, P. D.<\/small>, <small>SCHER, S.<\/small>, <small>WEYN, J. A.<\/small>, <small>MOUATADID, S.<\/small> and <small>THUEREY, N.<\/small> (2020). WeatherBench: A benchmark data set for data-driven weather forecasting. <i>J. Adv. Model. Earth Syst.<\/i> <b>12<\/b> e2020MS002203.","DOI":"10.1029\/2020MS002203"},{"key":"23","unstructured":"<small>VENTER, J.<\/small> (1988). Confidence bounds based on the largest treatment mean. <i>South Afr. J. Sci.<\/i> <b>84<\/b> 340."},{"key":"9","unstructured":"<small>FITHIAN, W.<\/small>, <small>SUN, D.<\/small> and <small>TAYLOR, J.<\/small> (2014). Optimal inference after model selection. Preprint. Available at arXiv:<a href=\"https:\/\/arxiv.org\/abs\/1410.2597\">1410.2597<\/a>."},{"key":"14","doi-asserted-by":"publisher","unstructured":"<small>LEINER, J.<\/small>, <small>DUAN, B.<\/small>, <small>WASSERMAN, L.<\/small> and <small>RAMDAS, A.<\/small> (2025). Data fission: Splitting a single data point. <i>J. Amer. Statist. Assoc.<\/i> <b>120<\/b> 135\u2013146.","DOI":"10.1080\/01621459.2023.2270748"},{"key":"1","doi-asserted-by":"crossref","unstructured":"<small>ANDREWS, I.<\/small>, <small>BOWEN, D.<\/small>, <small>KITAGAWA, T.<\/small> and <small>MCCLOSKEY, A.<\/small> (2022). Inference for losers. In <i>AEA Papers and Proceedings<\/i> <b>112<\/b> 635\u2013640. American Economic Association.","DOI":"10.1257\/pandp.20221065"},{"key":"3","unstructured":"<small>BENJAMINI, Y.<\/small>, <small>HECHTLINGER, Y.<\/small> and <small>STARK, P. B.<\/small> (2019). Confidence intervals for selected parameters. Preprint. Available at arXiv:<a href=\"https:\/\/arxiv.org\/abs\/1906.00505\">1906.00505<\/a>."},{"key":"5","unstructured":"<small>CHIANG, W.-L.<\/small>, <small>ZHENG, L.<\/small>, <small>SHENG, Y.<\/small>, <small>ANGELOPOULOS, A. N.<\/small>, <small>LI, T.<\/small>, <small>LI, D.<\/small>, <small>ZHU, B.<\/small>, <small>ZHANG, H.<\/small>, <small>JORDAN, M.<\/small> et al. (2024). Chatbot arena: An open platform for evaluating LLMs by human preference. In <i>Forty-First International Conference on Machine Learning<\/i>."},{"key":"6","unstructured":"<small>DANESCU-NICULESCU-MIZIL, C.<\/small>, <small>SUDHOF, M.<\/small>, <small>JURAFSKY, D.<\/small>, <small>LESKOVEC, J.<\/small> and <small>POTTS, C.<\/small> (2013). A computational approach to politeness with application to social factors. In 51<i>st Annual Meeting of the Association for Computational Linguistics<\/i> 250\u2013259. ACL."},{"key":"11","doi-asserted-by":"publisher","unstructured":"<small>HUNG, K.<\/small> and <small>FITHIAN, W.<\/small> (2019). Rank verification for exponential families. <i>Ann. Statist.<\/i> <b>47<\/b> 758\u2013782.","DOI":"10.1214\/17-AOS1634"},{"key":"15","doi-asserted-by":"crossref","unstructured":"<small>MILLER, R. G. JR.<\/small> (1981). <i>Simultaneous Statistical Inference<\/i>, 2nd ed. <i>Springer Series in Statistics<\/i>. Springer, New York.","DOI":"10.1007\/978-1-4613-8122-8"},{"key":"16","doi-asserted-by":"crossref","unstructured":"<small>MOGSTAD, M.<\/small>, <small>ROMANO, J. P.<\/small>, <small>SHAIKH, A. M.<\/small> and <small>WILHELM, D.<\/small> (2024). Inference for ranks with applications to mobility across neighbourhoods and academic achievement across countries. <i>Rev. Econ. Stud.<\/i> <b>91<\/b> 476\u2013518.","DOI":"10.1093\/restud\/rdad006"},{"key":"17","unstructured":"<small>NEUFELD, A.<\/small>, <small>DHARAMSHI, A.<\/small>, <small>GAO, L. L.<\/small> and <small>WITTEN, D.<\/small> (2024). Data thinning for convolution-closed distributions. <i>J. Mach. Learn. Res.<\/i> <b>25<\/b> Paper No. [57], 35."},{"key":"18","unstructured":"<small>PERRY, R.<\/small>, <small>XU, Z.<\/small>, <small>MCGOUGH, O.<\/small> and <small>WITTEN, D.<\/small> (2024). Infer-and-widen versus split-and-condition: Two tales of selective inference. Preprint. Available at arXiv:<a href=\"https:\/\/arxiv.org\/abs\/2408.06323\">2408.06323<\/a>."},{"key":"22","unstructured":"<small>TORCHVISION MAINTAINERS AND CONTRIBUTORS<\/small> (2016). TorchVision: PyTorch\u2019s Computer Vision library. <a href=\"https:\/\/github.com\/pytorch\/vision\">https:\/\/github.com\/pytorch\/vision<\/a>. GitHub repository."},{"key":"24","doi-asserted-by":"publisher","unstructured":"<small>ZRNIC, T.<\/small> and <small>FITHIAN, W.<\/small> (2024). Locally simultaneous inference. <i>Ann. Statist.<\/i> <b>52<\/b> 1227\u20131253.","DOI":"10.1214\/24-aos2391"},{"key":"25","doi-asserted-by":"crossref","unstructured":"<small>ZRNIC, T.<\/small> and <small>FITHIAN, W.<\/small> (2025). Supplement to \u201cA flexible defense against the winner\u2019s curse.\u201d <a href=\"https:\/\/doi.org\/10.1214\/25-AOS2553SUPP\">https:\/\/doi.org\/10.1214\/25-AOS2553SUPP<\/a>","DOI":"10.1214\/25-AOS2553SUPP"},{"key":"26","doi-asserted-by":"crossref","unstructured":"<small>ZRNIC, T.<\/small> and <small>FITHIAN, W.<\/small> (2025). A flexible defense against the winner\u2019s curse: Code.","DOI":"10.1214\/25-AOS2553"}],"container-title":["The Annals of Statistics"],"original-title":[],"deposited":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T16:22:40Z","timestamp":1791390160000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/annals-of-statistics\/volume-53\/issue-6\/A-flexible-defense-against-the-winners-curse\/10.1214\/25-AOS2553.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,1]]},"references-count":27,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2025,12,1]]}},"URL":"https:\/\/doi.org\/10.1214\/25-aos2553","relation":{},"ISSN":["0090-5364","2168-8966"],"issn-type":[{"value":"0090-5364","type":"print"},{"value":"2168-8966","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,1]]}}}