arXiv:2511.22442cs.PFcs.AI2025-11被引 2

找到最优精确率与召回率权衡点,发现F1 rarely是最佳选择

What Is the Optimal Ranking Score Between Precision and Recall? We Can Always Find It and It Is Rarely $F_1$

  • 用肯德尔相关优化排名,寻找精确率与召回率的最优折衷
  • 证明F1及其变体并非最优,存在更优的β值可实现更好平衡
  • 提供闭式解与代码工具,适用于任意性能分布的场景

基于性能对排序方法进行评估至关重要,但因性能本质为多维而复杂。分类任务中,精确率与召回率具有概率解释,二者互补且常产生部分矛盾的排序。实践中需在两者间建立折衷以获得单一全局排序。过去五十年来普遍采用加权调和平均(即Fβ、F-measure)。然而,平均基本指标所得分数未必带来有意义的排序,也未必是最优折衷。本文提出:(1) 证明Fβ诱导的排序具有意义,并定义了精确率与召回率排序间的最短路径;(2) 将两得分间折衷问题建模为肯德尔秩相关优化问题,表明F1及其抗偏版本远非最优;(3) 提供理论工具与闭式表达式,用于计算任意性能分布下的最优β值,并在六个案例研究中验证其应用。代码已公开于https://github.com/pierard/cvpr-2026-optimal-tradeoff-precision-recall。

原文摘要 · Abstract (English)

Ranking methods or models based on their performance is of prime importance but is tricky because performance is fundamentally multidimensional. In the case of classification, precision and recall are scores with probabilistic interpretations that are both important to consider and complementary. The rankings induced by these two scores are often in partial contradiction. In practice, therefore, it is extremely useful to establish a compromise between the two views to obtain a single, global ranking. Over the last fifty years or so, it has been proposed to take a weighted harmonic mean, known as the F-score, F-measure, or $F_β$. Generally speaking, by averaging basic scores, we obtain a score that is intermediate in terms of values. However, there is no guarantee that these scores lead to meaningful rankings and no guarantee that the rankings are good tradeoffs between these base scores. Given the ubiquity of $F_β$ scores in the literature, some clarification is in order. Concretely: (1) We establish that $F_β$-induced rankings are meaningful and define a shortest path between precision- and recall-induced rankings. (2) We frame the problem of finding a tradeoff between two scores as an optimization problem expressed with Kendall rank correlations. We show that $F_1$ and its skew-insensitive version are far from being optimal in that regard. (3) We provide theoretical tools and a closed-form expression to find the optimal value for $β$ for any distribution or set of performances, and we illustrate their use on six case studies. Code is available at https://github.com/pierard/cvpr-2026-optimal-tradeoff-precision-recall.

排序优化精确率召回率机器学习评估

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。