MO-SMAC: Multi-objective Sequential Model-based Algorithm Configuration
Abstract
Automated algorithm configuration aims at finding well-performing parameter configurations for a given problem, and it has proven to be effective within many AI domains, including evolutionary computation. Initially, the focus was on excelling in one performance objective, but, in reality, most tasks have a variety of (conflicting) objectives. The surging demand for trustworthy and resource-efficient AI systems makes this multiobjective perspective even more prevalent. We propose a new general-purpose multiobjective automated algorithm configurator by extending the widely-used SMAC framework. Instead of finding a single configuration, we search for a nondominated set that approximates the actual Pareto set. We propose a pure multiobjective Bayesian optimization approach for obtaining promising configurations by using the predicted hypervolume improvement as acquisition function. We also present a novel intensification procedure to efficiently handle the selection of configurations in a multiobjective context. Our approach is empirically validated and compared across various configuration scenarios in four AI domains, demonstrating superiority over baseline methods, competitiveness with MO-ParamILS on individual scenarios, and an overall best performance.
Details
- Organisation(s)
-
Machine Learning Section
Institute of Artificial Intelligence
L3S Research Centre
- External Organisation(s)
-
University of Twente (UT)
Paderborn University
Leiden University
RWTH Aachen University
University of British Columbia
- Type
- Article
- Journal
- Evolutionary computation
- Volume
- 34
- Pages
- 29-52
- No. of pages
- 24
- ISSN
- 1063-6560
- Publication date
- 01.03.2026
- Publication status
- Published
- Peer reviewed
- Yes
- ASJC Scopus subject areas
- Computational Mathematics
- Electronic version(s)
-
https://doi.org/10.1162/evco_a_00371 (Access:
Closed
)
