RankNEAT: Outperforming Stochastic Gradient Search in Preference Learning Tasks
Kosmas Pinitas, Konstantinos Makantasis, Antonios Liapis, Georgios N., Yannakakis

TL;DR
This paper introduces RankNEAT, an evolutionary algorithm that outperforms traditional gradient-based methods in preference learning tasks, especially in noisy, subjective data scenarios like affective computing.
Contribution
RankNEAT is a novel neuroevolution approach that enhances preference learning by optimizing neural network architecture, reducing overfitting, and improving performance over gradient-based methods.
Findings
RankNEAT outperforms RankNet in most experiments.
Architecture optimization acts as an effective feature selection.
RankNEAT reduces overfitting in preference learning tasks.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsFeature Selection
