Pareto Optimal
Pareto optimality describes solutions to multi-objective optimization problems where improving one objective necessitates worsening another; the goal is to identify the set of all such non-dominated solutions (the Pareto set). Current research focuses on efficiently approximating Pareto sets, particularly for complex problems like neural architecture search and multi-task learning, employing techniques such as Pareto set learning (PSL) with various model architectures (e.g., neural networks, hypernetworks, mixture of experts) and algorithms (e.g., Bayesian optimization, evolutionary algorithms). This research is significant because finding Pareto optimal solutions enables informed decision-making across diverse fields, from resource-constrained AI deployments to optimizing the trade-offs between competing objectives in engineering and medicine.
Papers
Reinvestigating the R2 Indicator: Achieving Pareto Compliance by Integration
Lennart Schäpermeier, Pascal Kerschke
Joint Pruning and Channel-wise Mixed-Precision Quantization for Efficient Deep Neural Networks
Beatrice Alessandra Motetti, Matteo Risso, Alessio Burrello, Enrico Macii, Massimo Poncino, Daniele Jahier Pagliari