Multi-Objective Optimization
Overview
The field studies problems where improving one objective—such as accuracy, cost, safety, energy use, or fairness—can worsen another, and represents the alternatives as a Pareto frontier. Common approaches include evolutionary algorithms such as NSGA-II, Bayesian optimization for expensive evaluations, gradient-based methods for learning systems, and reinforcement-learning or generative methods for sequential and design tasks. Researchers also develop preference elicitation and constraint-handling methods so people can select useful trade-offs without always computing an entire frontier. A central tension is balancing broad, reliable coverage of feasible trade-offs against evaluation cost, while scalarization, objective scaling, and changing preferences can all affect which solutions are found.
Latest papers
287 papers23 papers in the last four weeks, down 42% on the four weeks before. 0.2% of all new papers.
A Large-Scale Sparse Multiobjective Optimization Algorithm Based on Optimal Performance Scores
QDEvo: A Multi-Objective Quality-Diversity Framework for Automated Heuristic Design
Population-Based Multi-Objective Training of Discriminators for Semi-Supervised GANs
Optimization Algorithms for Joint OFDM Waveform Design and RIS Configuration in 6G Networks: From Convex Relaxation to Foundation Models
Personalizing Marketplace Policies with Competing Objectives and Constrained Experiments: Evidence from a Job Marketplace
Partition-Guided Distance Saliency: Bridging Decision and Objective Spaces in Many-Objective Optimization
cognitive drought'' in identifying relevant trade-offs or specifying target regions without a priori knowledge. To bridge this interpretability gap, we introduce the {Partition-Guided Distance Saliency (PGDS)} framework, a novel XAI approach designed for continuous optimization landscapes. Our framework automates the explanation process through a three-stage pipeline that prioritizes geometric intuition over abstract rules. First, we employ a surrogate model that learns how geometric distances in the decision space map to proximity in the objective space. Second, to address the difficulty of manual target selection in high dimensions, the framework automatically partitions the objective landscape into distinct regions and identifies local Dominating Points'' to serve as automated targets for improvement. Third, we quantify how sensitive a solution's position is to each decision variable by measuring the distance shifts induced by perturbations to each variable. This allows PGDS to categorize features as either Drivers'' which facilitate convergence toward preferred regions, or Blockers'' which represent geometric constraints hindering further progress. Validation on 10-objective benchmarks and a physics-informed engineering problem (Welded Beam) demonstrates that PGDS provides differentiated, actionable insights that traditional visualization and rule-based XAI methods fail to provide.