
HW
Hanyang Wang, Juergen Branke, Matthias Poloczek
· 1 min read
ResearcharXiv cs.LG
MOBO-CAPS: Multi-Objective Bayesian Optimization with Cardinality-Aware Pareto Selection
arXiv:2611.19999v1 Announce Type: new
Abstract: Multi-objective Bayesian optimization (MOBO) traditionally aims to approximate the entire Pareto front, but, due to resource constraints, real-world deployment is often limited to testing a small, representative subset of solutions. Hence current methods first approximate the full front before selecting solutions, potentially wasting costly evaluations. We formalize this problem as Multi-objective Bayesian Optimization with Cardinality-aware Pareto Selection (MOBO-CAPS), where the goal is to identify a set of exactly M solutions with high hypervolume. We propose two practical cardinality-aware acquisition strategies: REHVI, a replacement-aware approximation to expected hypervolume improvement, and CHO-UCB, which constructs an optimistic M-point set by optimizing a collective UCB-based hypervolume objective. We prove a sublinear simple regret bound for the batched version of CHO-UCB, and empirically show that cardinality-aware acquisition design improves over standard MOBO followed by post-hoc subset selection across nine benchmarks.
Original source
This story was published by arXiv cs.LG and written by Hanyang Wang, Juergen Branke, Matthias Poloczek. SyncAI.news shows a preview; the complete article is on the publisher's site.
Read the full story on arxiv.org


