Meta-Black-Box Optimization Can Do Search Guidance for Expensive Constrained Multi-Objective Optimization
This work addresses the challenge of efficient search in expensive constrained multi-objective optimization, offering a novel approach that improves performance over existing methods.
MetaSG-SAEA introduces a bi-level MetaBBO framework for expensive constrained multi-objective optimization, where a meta-policy provides search guidance to a surrogate-assisted evolutionary algorithm. It outperforms state-of-the-art baselines across diverse benchmarks and generalizes across problem distributions.
Existing Meta-Black-Box Optimization (MetaBBO) methods focus on how to search when controlling optimizers, but largely overlook where to search. We propose MetaSG-SAEA, a bi-level MetaBBO framework for expensive constrained multi-objective optimization problems (ECMOPs), in which a meta-policy provides search guidance to the low-level Surrogate-Assisted Evolutionary Algorithm (SAEA). To achieve this, we introduce Max-Min Constraint-Calibrated Inequality (MM-CCI), a compact, problem-agnostic region abstraction that maps heterogeneous constraint evaluations to an ordered scalar level; we further provide a theoretical analysis of its fundamental properties. Building on this region abstraction, we adopt diffusion-based population initialization to translate the meta-policy's region-level guidance into solution-level priors for the SAEA. To make MetaSG-SAEA scalable, we construct an attention-based state representation across varying problem dimensions, population sizes, and numbers of objectives and constraints. Experimental results demonstrate that MetaSG-SAEA outperforms state-of-the-art baselines across diverse benchmarks and exhibits the ability to generalize across problem distributions.