设计可聚焦重要区域的损失函数,提升关键预测精度
Selective Matching Losses -- Not All Scores Are Created Equal
- 用可调斜率的链接函数构造选择性损失,强化高敏感区域
- 在停留时间预测等任务中,相比传统损失提升显著性能
- 适合需要区分重要程度的场景,如排序、大模型对齐
学习系统需将预测得分与观测值匹配。某些区域的预测精度至关重要,而其他区域则不那么关键。本文通过设计随得分域变化的递增链接函数,构建选择性匹配损失。损失为链接函数的积分,链接定义了损失对得分的敏感度,使高斜率区域(高敏感)比平坦区域更受重视。损失不对称性引导模型在重要区域表现更好,并区分高低重要性区域。可使用缩放平移的Sigmoid和双曲正弦链接设计多种单标量选择性损失。但这些性质不适用于多分类。按维度应用会丧失基于分数排名的重要性感知能力。为此,我们引入复合Softmax函数,建立多维选择性损失框架。克服了标准Softmax在分类有效但难以区分相邻得分的局限。在停留时间预测、检索、排序(点式、成对、列表式损失)、知识蒸馏及大语言模型微调对齐等任务中,选择性损失相较传统损失有显著优势。
原文摘要 · Abstract (English)
Learning systems match predicted scores to observations over some domain. Often, it is critical to produce accurate predictions in some subset (or region) of the domain, yet less important to accurately predict in other regions. We construct selective matching loss functions by design of increasing link functions over score domains. A matching loss is an integral over the link. A link defines loss sensitivity as function of the score, emphasizing high slope high sensitivity regions over flat ones. Loss asymmetry drives a model and resolves its underspecification to predict better in high sensitivity regions where it is more important, and to distinguish between high and low importance regions. A large variety of selective scalar losses can be designed with scaled and shifted Sigmoid and hyperbolic sine links. Their properties, however, do not extend to multi-class. Applying them per dimension lacks ranking sensitivity that assigns importance according to class score ranking. Utilizing composite Softmax functions, we develop a framework for multidimensional selective losses. We overcome limitations of the standard Softmax function, that is good for classification, but not for distinction between adjacent scores. Selective losses have substantial advantage over traditional losses in applications with more important score regions, including dwell-time prediction, retrieval, ranking with either pointwise, contrastive pairwise, or listwise losses, distillation problems, and fine-tuning alignment of Large Language Models (LLMs).
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。