AffRankNet +:使用标记信息对影响进行排序
AffRankNet+: Ranking Affect Using Privileged Information
摘要:
许多影响建模任务在训练和测试时间之间呈现不对称的信息分布;给出了有关训练数据的附加信息,但在测试时不可用。在这种情况下的学习被称为在已知信息下学习(LUPI)。同时,由于情感注释的有序性,将情感建模任务制定为监督学习排名问题在情感计算研究社区中越来越普遍。基于上述两个事实,在这项研究中,我们引入了一个排名模型,该模型将有关训练数据的额外信息视为特权信息,以准确地对情感状态进行排名。我们的排名模型将著名的RankNet模型扩展到LUPI范式,因此命名为AffRankNet+。据我们所知,这是第一次基于神经网络的排名模型利用特权信息。我们评估了所提出的模型在公共可用的Afew-VA数据集上的性能,并将其与不使用特权信息的RankNet模型进行了比较。实验评估表明,AffRankNet+模型可以产生显着更好的性能。
英文摘要:
Many of the affect modelling tasks present an asymmetric distribution of information between training and test time; additional information is given about the training data, which is not available at test time. Learning under this setting is called Learning Under Privileged Information (LUPI). At the same time, due to the ordinal nature of affect annotations, formulating affect modelling tasks as supervised learning ranking problems is gaining ground within the Affective Computing research community. Motivated by the two facts above, in this study, we introduce a ranking model that treats additional information about the training data as privileged information to accurately rank affect states. Our ranking model extends the well-known RankNet model to the LUPI paradigm, hence its name AffRankNet+. To the best of our knowledge, it is the first time that a ranking model based on neural networks exploits privileged information. We evaluate the performance of the proposed model on the public available Afew-VA dataset and compare it against the RankNet model, which does not use privileged information. Experimental evaluation indicates that the AffRankNet+ model can yield significantly better performance.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。