arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2204.06901cs.NEcs.AIcs.HC
收藏

RankNEAT:在偏好学习任务中优于随机梯度搜索

RankNEAT: Outperforming Stochastic Gradient Search in Preference Learning Tasks

University of Malta(马耳他大学)

Kosmas Pinitas, Konstantinos Makantasis, Antonios Liapis, Georgios N. Yannakakis

摘要:

随机梯度下降(SGD)是一种用于训练神经网络的高级优化方法,特别是用于学习客观定义的标签,如图像对象和事件。当一个神经网络面对的是主观定义的标签时--比如人类的演示或注释--SGD可能很难探索由人类固有的偏见和主观性造成的欺骗性和噪声损失。虽然神经网络通常通过偏好学习算法来训练,以消除这种数据噪声,但实际上的训练方法依赖于梯度下降。出于缺乏实证研究的影响,进化搜索的偏好学习者的培训,我们介绍了RankNEAT算法,学习排名通过神经进化的增强拓扑结构。我们测试的假设,RankNEAT优于传统的基于梯度的偏好学习的情感计算域,特别是预测注释的玩家唤醒从三个不同的游戏的游戏画面。在大多数实验中,RankNEAT与基于梯度的偏好学习器(RankNet)相比具有更好的性能,因为其架构优化能力可以作为一种有效的特征选择机制,从而消除过拟合。结果表明,RankNEAT是一个可行的和高效的进化选择偏好学习。

英文摘要:

Stochastic gradient descent (SGD) is a premium optimization method for training neural networks, especially for learning objectively defined labels such as image objects and events. When a neural network is instead faced with subjectively defined labels--such as human demonstrations or annotations--SGD may struggle to explore the deceptive and noisy loss landscapes caused by the inherent bias and subjectivity of humans. While neural networks are often trained via preference learning algorithms in an effort to eliminate such data noise, the de facto training methods rely on gradient descent. Motivated by the lack of empirical studies on the impact of evolutionary search to the training of preference learners, we introduce the RankNEAT algorithm which learns to rank through neuroevolution of augmenting topologies. We test the hypothesis that RankNEAT outperforms traditional gradient-based preference learning within the affective computing domain, in particular predicting annotated player arousal from the game footage of three dissimilar games. RankNEAT yields superior performances compared to the gradient-based preference learner (RankNet) in the majority of experiments since its architecture optimization capacity acts as an efficient feature selection mechanism, thereby, eliminating overfitting. Results suggest that RankNEAT is a viable and highly efficient evolutionary alternative to preference learning.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑