最小化排序范围和的学习
Learning by Minimizing the Sum of Ranked Range
摘要:
在形成学习目标时,人们通常需要将一组个体值集合到单个输出中。这种情况发生在聚合损失中,它结合了每个训练样本上学习模型的个体损失,以及多标签学习的个体损失,它结合了所有类别标签上的预测分数。在这项工作中,我们介绍了排名范围(SoRR)的总和作为一种通用的方法来形成学习目标。排序范围是一组实数的排序值的连续序列。用差分凸算法(DCA)求解SoRR的最小化问题。我们探索SoRR框架的最小化在机器学习中的两个应用,即二进制分类的AoRR总损失和多标签/多类分类的TKML个体损失。我们的实证结果突出了所提出的优化框架的有效性,并证明了使用合成和真实数据集的建议损失的适用性。
英文摘要:
In forming learning objectives, one oftentimes needs to aggregate a set of individual values to a single output. Such cases occur in the aggregate loss, which combines individual losses of a learning model over each training sample, and in the individual loss for multi-label learning, which combines prediction scores over all class labels. In this work, we introduce the sum of ranked range (SoRR) as a general approach to form learning objectives. A ranked range is a consecutive sequence of sorted values of a set of real numbers. The minimization of SoRR is solved with the difference of convex algorithm (DCA). We explore two applications in machine learning of the minimization of the SoRR framework, namely the AoRR aggregate loss for binary classification and the TKML individual loss for multi-label/multi-class classification. Our empirical results highlight the effectiveness of the proposed optimization framework and demonstrate the applicability of proposed losses using synthetic and real datasets.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。