通过学习密度比实现拒识分类
Rejection via Learning Density Ratios
AI总结:
本文提出一种基于分布视角的带拒识分类方法,通过优化带α-散度正则化的损失风险寻找理想化数据分布,并利用密度比实现拒识决策,在干净和含噪数据集上验证了框架的有效性。
摘要:
带拒识的分类作为一种学习范式出现,允许模型弃权(不执行)而不做出预测。主流方法通过增强典型损失函数来改变监督学习流程,使模型拒识产生的损失低于错误预测。相反,我们提出一种不同的分布视角,旨在寻找一个理想化的数据分布,以最大化预训练模型的性能。这可以通过优化带有φ-散度正则化项的损失风险来形式化。通过该理想化分布,可以利用该分布与数据分布之间的密度比来做出拒识决策。我们专注于φ-散度由α-散度族指定的设定。我们的框架在干净和含噪数据集上进行了实证测试。
英文摘要:
Classification with rejection emerges as a learning paradigm which allows models to abstain from making predictions. The predominant approach is to alter the supervised learning pipeline by augmenting typical loss functions, letting model rejection incur a lower loss than an incorrect prediction. Instead, we propose a different distributional perspective, where we seek to find an idealized data distribution which maximizes a pretrained model's performance. This can be formalized via the optimization of a loss's risk with a $φ$-divergence regularization term. Through this idealized distribution, a rejection decision can be made by utilizing the density ratio between this distribution and the data distribution. We focus on the setting where our $φ$-divergences are specified by the family of $α$-divergence. Our framework is tested empirically over clean and noisy datasets.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。