An Interactive Evolutionary Multiobjective Optimization Algorithm Based on Interpretable Active Preference Learning
Thomas Quadt, Boris Čule, Roy Lindelauf, Herman Monsuur, Mark Voskuijl
Abstract
Many decision-making tasks are inherently multi-objective. Interactive evolutionary multi-objective optimization algorithms (iEMOAs) are particularly well-suited to help the decision-maker find their most preferred solution. However, many of these algorithms employ black-box preference models. For high-stakes decision-making tasks, like healthcare and defense, a high level of transparency is needed, for instance to support accountability. We propose an interpretable iEMOA which uses active learning to efficiently learn a tree-based preference model directly from pairwise comparisons. The survival operator of NSGA-II and NSGA-III is extended with the learned preference model to guide the algorithm towards the region of interest. An extensive experimental study compares the proposed method to a state-of-the-art black-box model and a state-of-the-art interpretable model. Results indicate that our proposed model outperforms the alternatives in terms of finding the most preferred solution at the cost of a slightly worse average final population. Finally, a case study on a real-life engineering problem illustrates how inspecting the learned model reveals which objectives drive the decision-maker's preferences.
Create a lesson
Related papers
GNBG-C: A Unified and Configurable Benchmark Generator for Constrained Continuous Optimization
Ali Ghasemzadeh, Erfan Babakhani, Armin Khosravi et al.
Characterizing Privacy Leakage in Spiking Neural Networks: A Systematic Analysis of Temporal Dynamics, Stochasticity, Neuronal Dynamics and Learning Mechanisms
Ayana Moshruba, Maryam Parsa
TRON: Transferring Naturally Evolved Network Architectures into Neuroevolution
Konstantinos Zacharopoulos, Alexandra Bekou, Jose M Serradell et al.
Understanding the Co-evolutionary Solution Exchange of the MOEA/D: Already the Smallest Communication Radius Gives the Best-Possible Speed-Up
Benjamin Doerr, Moaad Elmoutassim, Martin S. Krejca et al.
A Dynamic Decomposition Strategy for the MOEA/D With Proven Performance Guarantees
Benjamin Doerr, Martin S. Krejca, Noé Weeks
Optimal Connectivity of Random Boolean Networks for Reservoir Computing
Christopher Michael Skeide Vibe, Aliaksandr Hubin, Stefano Nichele