Adaptive Meta Black-box Optimization (ABOM)

• ABOM is a meta-optimization framework that integrates offline meta-learning, surrogate modeling via an Attentive Neural Process, and Bayesian optimization for rapid adaptation to unseen tasks.
• It constructs a diverse meta-dataset through parallel simulation and uses well-calibrated uncertainty estimates to significantly reduce the number of expensive online evaluations.
• Empirical evaluations in urban traffic management demonstrate ABOM's ability to lower waiting vehicles and improve throughput with fewer than 100 trials.

The Adaptive Meta Black-box Optimization Model (ABOM) formalizes a class of meta-optimization frameworks that leverage offline meta-learning and modern surrogate modeling to enable rapid, data-efficient adaptation to unseen black-box optimization tasks. The paradigm is motivated by real-world applications such as urban traffic network design, where conventional optimization or heuristic controllers fail to generalize due to heterogeneity and limited sample budgets. ABOM, as introduced in traffic light management (Yun et al., 2024), combines an offline meta-dataset of task–design–performance pairs, a meta-learned Attentive Neural Process (ANP) surrogate, and Bayesian optimization to deliver sample-efficient, uncertainty-aware optimization of system-level designs such as traffic phase configurations and timing.

1. Formulation of the Meta-Black-box Optimization Problem

ABOM considers a family of black-box optimization tasks defined by an unknown distribution ρ. Each task (e.g., a traffic pattern) p induces a black-box objective $f_p: \mathbb{R}^d \to \mathbb{R}$ that evaluates high-level design variables $x$ (e.g., intersection phase combinations, green-time allocations). The core challenge is to efficiently optimize $x^* = \arg\max_x f_p(x)$ for a new, unseen pattern $p^{unseen}$, using as few expensive function evaluations as possible.

ABOM operates in a meta-learning regime: it is provided with an offline meta-dataset $D = \{ D^n \}_{n=1}^N$, where each $D^n=\{(x^n_m, y^n_m)\}_{m=1}^M$ comprises design–performance pairs $(x, y = f_{p^n}(x)+\epsilon)$ collected under $N$ historical tasks (traffic scenarios). This meta-dataset is used to inform and “warm-start” the search for $x^*$ in a new task $p^{unseen}$, given a limited budget $x$0 of online simulations.

Key components:

• Variable: global traffic-light design vector $x$1, with $x$2 for $x$3 intersections and $x$4 choices each.
• Objective: $x$5, noisy, nonconvex, and non-differentiable.
• Data: $x$6 aggregates prior realizations of $x$7 for $x$8.
• Goal: Use $x$9 to minimize the number of online evaluations needed to solve $x^* = \arg\max_x f_p(x)$0.

2. Construction and Role of the Offline Meta-Dataset

Data collection is performed entirely offline in parallelized simulation. For each reference pattern $x^* = \arg\max_x f_p(x)$1, $x^* = \arg\max_x f_p(x)$2 candidate designs $x^* = \arg\max_x f_p(x)$3 are sampled uniformly from the design space (phase-combination one-hot logits, or unnormalized green-time splits). Their simulated performance $x^* = \arg\max_x f_p(x)$4 yields $x^* = \arg\max_x f_p(x)$5 without sequential dependency, ensuring the dataset is unbiased and exploits parallel compute.

This process is repeated independently for each $x^* = \arg\max_x f_p(x)$6 ($x^* = \arg\max_x f_p(x)$7 in large-scale experiments; $x^* = \arg\max_x f_p(x)$8), yielding a meta-dataset $x^* = \arg\max_x f_p(x)$9 that covers a diverse spectrum of traffic conditions and associated interventions. The data supports learning a prior over the mapping from designs to outcomes, enabling generalization to unseen traffic scenarios in a principled few-shot adaptation framework.

A held-out validation split ($p^{unseen}$0 train/val over $p^{unseen}$1) is used for hyperparameter tuning of the meta-surrogate.

3. Attentive Neural Process Surrogate: Architecture and Training

3.1 Latent Neural Process Structure

The ABOM surrogate is an Attentive Neural Process (ANP), modeling the conditional stochastic process $p^{unseen}$2:

• For any context set $p^{unseen}$3 and any target set $p^{unseen}$4:
  • ANP introduces a global latent vector $p^{unseen}$5 with prior $p^{unseen}$6 and defines:

  $p^{unseen}$7

• Encoder: $p^{unseen}$8 for each context; updated via self-attention to $p^{unseen}$9 and aggregated $D = \{ D^n \}_{n=1}^N$0.

• Recognition model: $D = \{ D^n \}_{n=1}^N$1.

• Decoder: $D = \{ D^n \}_{n=1}^N$2, where $D = \{ D^n \}_{n=1}^N$3 is a cross-attention over $D = \{ D^n \}_{n=1}^N$4 conditioned on query $D = \{ D^n \}_{n=1}^N$5.

3.2 Training Objective

The surrogate is meta-trained across all $D = \{ D^n \}_{n=1}^N$6 tasks to maximize the evidence lower bound (ELBO):

$D = \{ D^n \}_{n=1}^N$7

This process alternates between random context/target splits of each $D = \{ D^n \}_{n=1}^N$8, encouraging the model to learn transferable structure for rapid adaptation. The ANP models predictive mean and variance, naturally encoding epistemic uncertainty critical for Bayesian optimization.

3.3 Inference

During online adaptation on $D = \{ D^n \}_{n=1}^N$9, the ANP receives $D^n=\{(x^n_m, y^n_m)\}_{m=1}^M$0 (the current online trials) as context and returns:

• Predictive mean: $D^n=\{(x^n_m, y^n_m)\}_{m=1}^M$1

• Predictive variance: $D^n=\{(x^n_m, y^n_m)\}_{m=1}^M$2 These are estimated via Monte Carlo or moment matching.

4. Bayesian Optimization with the ANP Surrogate

ABOM applies Bayesian optimization (BO) to maximize $D^n=\{(x^n_m, y^n_m)\}_{m=1}^M$3 using the ANP as a probabilistic surrogate. Standard acquisition functions are employed:

• Upper Confidence Bound (UCB):

$D^n=\{(x^n_m, y^n_m)\}_{m=1}^M$4

• Expected Improvement (EI):

$D^n=\{(x^n_m, y^n_m)\}_{m=1}^M$5

• Probability of Improvement (PI):

$D^n=\{(x^n_m, y^n_m)\}_{m=1}^M$6

Constraints are enforced:

• For phase time allocation: simplex constraints on each $D^n=\{(x^n_m, y^n_m)\}_{m=1}^M$7: $D^n=\{(x^n_m, y^n_m)\}_{m=1}^M$8 and $D^n=\{(x^n_m, y^n_m)\}_{m=1}^M$9.

• For phase combinations: argmax over $(x, y = f_{p^n}(x)+\epsilon)$0 softmax probabilities ensures valid discrete selection.

Acquisition maximization over feasible $(x, y = f_{p^n}(x)+\epsilon)$1 is solved with L-BFGS-B on the continuous logits.

Optimization Loop

At each online trial:

1. Compute surrogate mean/variance given current $(x, y = f_{p^n}(x)+\epsilon)$2.

2. Maximize the acquisition function $(x, y = f_{p^n}(x)+\epsilon)$3 under the constraints to propose next $(x, y = f_{p^n}(x)+\epsilon)$4.

3. Evaluate $(x, y = f_{p^n}(x)+\epsilon)$5 via simulation.

4. Augment online context with new $(x, y = f_{p^n}(x)+\epsilon)$6. The best $(x, y = f_{p^n}(x)+\epsilon)$7 found is returned.

5. Algorithmic Workflow and Pseudocode

Phase 1: Offline Data Collection

• For $(x, y = f_{p^n}(x)+\epsilon)$8 to $(x, y = f_{p^n}(x)+\epsilon)$9: sample $N$0 designs, evaluate under $N$1, store in $N$2.

Phase 2: Meta-training ANP

• Until convergence: randomly select $N$3, split into context/target, update ANP via stochastic gradient ascent on the ELBO.

Phase 3: Online Adaptation on New Task

• Initialize $N$4.

• For $N$5:

  • Compute $N$6 given ANP and $N$7.
  • Maximize acquisition $N$8 (UCB, EI, or PI) under constraints.
  • Query $N$9, record $x^*$0.
• Return $x^*$1 with best observed $x^*$2.

6. Empirical Evaluation and Impact

ABOM was instantiated on both synthetic $x^*$3 to $x^*$4 grids and real networks (Hangzhou $x^*$5, Manhattan $x^*$6 and $x^*$7). Meta-dataset: $x^*$8, $x^*$9. Baselines included basic BBO (GA, PSO, CMA-ES), meta BBO (LGA, LES, RGPE, ABLR, FSBO), and RL 1-step MDP controllers (e.g., DQN, PPO).

Key results:

• On Hangzhou $p^{unseen}$0 (phase combination), ABOM: $p^{unseen}$1 vs. best baseline $p^{unseen}$2 average waiting vehicles.
• On Manhattan $p^{unseen}$3 (time allocation), ABOM: $p^{unseen}$4 vs. $p^{unseen}$5 next best.
• ABOM reduced waiting vehicles by $p^{unseen}$6 across all networks, converged in $p^{unseen}$7 trials.
• Real deployment: 26 intersections, $p^{unseen}$8 vehicle throughput improvement over baseline when run hourly for a week.
• Ablations: robust to halved meta-dataset, all three acquisition criteria give similar improvements, ANP preferred over transformer NPs for the available data scale.

7. Interpretation and Significance

ABOM demonstrates that offline meta-learning of surrogate models (ANP) over diverse design–performance datasets, combined with probabilistic BO, enables high sample-efficiency black-box optimization in complex, real-world system design settings. The approach achieves rapid adaptation beyond traditional BBO and RL variants, robustly outperforms a range of meta and naïve baselines on metrics relevant to practice (e.g., waiting vehicles, throughput), and is deployable at urban scale without domain-specific tuning (Yun et al., 2024). The framework is general and could be extended to other black-box systems where acquiring task-generalizable learned surrogates with well-calibrated uncertainty is feasible.

Empirical findings confirm the following:

• Parallel offline data generation (random design sampling) is highly effective for meta-surrogate training and allows for maximal use of simulation infrastructure.
• Well-calibrated epistemic uncertainty from the ANP is critical for BO sample efficiency, irrespective of acquisition function.
• Robustness to meta-dataset size and acquisition choice confirms that meta-BBO with few-shot adaptation is a practical architecture for scalable, adaptive design in high-stake black-box domains.

---

Principal Reference:

"An Offline Meta Black-box Optimization Framework for Adaptive Design of Urban Traffic Light Management Systems" (Yun et al., 2024)