Pareto sensitivity, most-changing sub-fronts, and knee solutions
Tommaso Giovannelli, Marcos Medeiros Raimundo, Luis Nunes Vicente

TL;DR
This paper introduces a sensitivity-based method to identify Pareto knee solutions and most-changing sub-fronts in multi-objective optimization, enhancing the understanding of solution robustness and trade-offs.
Contribution
The paper proposes the sensitivity knee (snee) approach using Pareto sensitivity to compute knee solutions based on minimal maximal change, applicable to scalarized problems.
Findings
The snee approach effectively identifies Pareto knee solutions.
It computes local most-changing sub-fronts around nondominated points.
Numerical results demonstrate the approach's benefits on synthetic problems.
Abstract
When dealing with a multi-objective optimization problem, obtaining a comprehensive representation of the set of Pareto optimal solutions can be computationally expensive. However, identifying the most representative solutions can be difficult and sometimes ambiguous, since what constitutes a representative solution depends on the decision maker's preferences. A popular selection are the so-called Pareto knee solutions, which correspond to nondominated points on the Pareto front where a small improvement in any objective leads to a large deterioration in at least one other objective. In this paper, using Pareto sensitivity, we show how to compute Pareto knee solutions according to their verbal (informal) definition of least maximal change. We refer to the resulting approach as the sensitivity knee (snee) approach, and we apply it to unconstrained and constrained problems. Pareto…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Optimization Algorithms Research
