深度不平衡分类的top-K校准铰链损失的随机平滑
Stochastic smoothing of the top-K calibrated hinge loss for deep imbalanced classification
摘要:
在现代分类任务中,标签的数量越来越大,实践中遇到的数据集的大小也越来越大。随着类别数量的增加,类别模糊性和类别不平衡性变得越来越难以实现高的top-1准确度。与此同时,Top-K指标(允许K猜测的指标)已经变得流行,特别是对于性能报告。然而,提出为深度学习量身定制的前K损失仍然是一个挑战,无论是理论上还是实践上。在本文中,我们介绍了一个随机的top-K铰链损失的启发最近的事态发展的top-K校准损失。我们的建议是基于灵活的“扰动优化器”框架上的前K运营商建设的平滑。我们表明,我们的损失函数在平衡数据集的情况下表现非常好,同时受益于比最先进的top-K损失函数显著更低的计算时间。此外,我们提出了一个简单的变种,我们的损失不平衡的情况下。在重尾数据集上的实验表明,我们的损失函数显着优于其他基线损失函数。
英文摘要:
In modern classification tasks, the number of labels is getting larger and larger, as is the size of the datasets encountered in practice. As the number of classes increases, class ambiguity and class imbalance become more and more problematic to achieve high top-1 accuracy. Meanwhile, Top-K metrics (metrics allowing K guesses) have become popular, especially for performance reporting. Yet, proposing top-K losses tailored for deep learning remains a challenge, both theoretically and practically. In this paper we introduce a stochastic top-K hinge loss inspired by recent developments on top-K calibrated losses. Our proposal is based on the smoothing of the top-K operator building on the flexible "perturbed optimizer" framework. We show that our loss function performs very well in the case of balanced datasets, while benefiting from a significantly lower computational time than the state-of-the-art top-K loss function. In addition, we propose a simple variant of our loss for the imbalanced case. Experiments on a heavy-tailed dataset show that our loss function significantly outperforms other baseline loss functions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。