面向鲁棒分类的分布损失函数 / Distributional Loss for Robust Classification
1️⃣ 一句话总结
本文提出一种新的分类损失函数,通过将模型输出拟合为双峰高斯分布而非强制匹配单一标签,来隐含处理类别模糊性、减少过拟合,从而在不增加额外标注信息的情况下,让分类器学到更鲁棒的决策边界,尤其在数据量较少时效果显著。
This paper proposes a novel loss concept for supervised classification tasks. Rather than enforcing a direct mapping from each input sample to a single assigned label, we define an optimization objective over all classifier outputs as a bimodal Gaussian distribution. This softer target formulation implicitly captures class ambiguity, mitigates overfitting, and encourages the learning of more robust decision boundaries, all without requiring additional label information. Experimental results demonstrate consistent improvements in robustness, with particularly pronounced gains in low-data regimes, while requiring only minimal modifications to standard training pipelines.
面向鲁棒分类的分布损失函数 / Distributional Loss for Robust Classification
本文提出一种新的分类损失函数,通过将模型输出拟合为双峰高斯分布而非强制匹配单一标签,来隐含处理类别模糊性、减少过拟合,从而在不增加额外标注信息的情况下,让分类器学到更鲁棒的决策边界,尤其在数据量较少时效果显著。
源自 arXiv: 2606.13223