Weak Pareto Boundary: The Achilles' Heel of Evolutionary Multi-Objective Optimization
Ruihao Zheng, Jingda Deng, and Zhenkun Wang

TL;DR
This paper analyzes the weak Pareto boundary's impact on multi-objective evolutionary algorithms, revealing how its attributes hinder algorithm performance and highlighting the need for improved methods.
Contribution
It provides a systematic theoretical and experimental analysis of the weak Pareto boundary's attributes and their effects on MOEA performance.
Findings
Different categories of WPB induce DRSs with distinct asymptotic growth rates.
Experimental results confirm the theoretical analysis of WPB attributes.
Current MOEAs are highly sensitive to certain WPB attributes, limiting their effectiveness.
Abstract
The weak Pareto boundary () refers to a boundary in the objective space of a multi-objective optimization problem, characterized by weak Pareto optimality rather than Pareto optimality. The brings severe challenges to multi-objective evolutionary algorithms (MOEAs), as it may mislead the algorithms into finding dominance-resistant solutions (DRSs), i.e., solutions that excel on some objectives but severely underperform on the others, thereby missing Pareto-optimal solutions. Although the severe impact of the on MOEAs has been recognized, a systematic and detailed analysis remains lacking. To fill this gap, this paper studies the attributes of the . In particular, the category of a , as an attribute derived from its weakly Pareto-optimal property, is theoretically analyzed. The analysis reveals that the dominance resistance degrees of DRSs induced by different…
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.
