arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2411.18569stat.MLmath.STstat.MEstat.TH
收藏

一种针对赢家诅咒的灵活防御方法

A Flexible Defense Against the Winner's Curse

Tijana Zrnic, William Fithian

AI总结:

针对从竞争备选方案中挑选最佳候选者时出现的赢家诅咒问题,本文提出缩放校正方法,可在参数与非参数设置中处理候选者任意依赖关系并自适应选择偏倚,还能扩展至前k个赢家等相关推断场景。

摘要:

在科学和政策领域,决策者通常需要从竞争的备选方案中得出关于最佳候选者的结论。例如,研究人员可能会试图推断最成功的治疗方法的有效性,或者确定哪个人口群体从特定治疗中获益最多。同样,在机器学习中,从业者通常对经验上表现最佳的模型的总体性能感兴趣。然而,挑选最佳候选者会导致赢家诅咒:赢家的观察性能向上偏倚,使得基于标准不确定性度量的结论无效。我们引入了缩放校正(zoom correction),一种用于对赢家进行有效推断的新方法。该方法具有灵活性:它可以在参数和非参数设置中使用,可以处理候选者之间的任意依赖关系,并自动适应选择偏倚的程度。该方法还可以轻松扩展到重要的相关问题,例如对前k个赢家的推断、对总体赢家的价值和身份的推断,以及对“近赢家”的推断。

英文摘要:

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's 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 "near-winners."

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑