Lexicase Selection's Robustness to Contradictory Objectives
Core Concepts
Lexicase and π-lexicase selection can effectively optimize contradictory objectives within specific parameter ranges.
Abstract
Lexicase and π-lexicase selection are effective for many-objective optimization.
The study explores the performance of lexicase selection on contradictory objectives.
Analyzes the impact of parameters like population size, dimensionality, and value limit.
Provides insights into the reachability of Pareto-optimal solutions under different conditions.
Discusses the implications for algorithm selection and parameter choice.
On the Robustness of Lexicase Selection to Contradictory Objectives
Stats
"π-lexicase outperformed NSGA-II on DTLZ problems with 5 or more objectives."
"π-lexicase performed well on a larger suite of problems with five or more objectives."
"Lexicase selection's performance is further harmed when objectives have more intense trade-offs with each other."
Quotes
"Lexicase and π-lexicase selection each have a region of parameter space where they are incapable of optimizing contradictory objectives."
"Adjusting π based on the current population reduces the size of the region where π-lexicase selection struggles."