Pith. sign in

REVIEW 1 cited by

Neural Exploratory Landscape Analysis for Meta-Black-Box-Optimization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2408.10672 v3 pith:236MV2UC submitted 2024-08-20 cs.LG cs.NE

classification cs.LGcs.NE
keywords metabbolandscapeneuralneurelaanalysisexploratoryperformancealgorithms
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recent research in Meta-Black-Box Optimization (MetaBBO) have shown that meta-trained neural networks can effectively guide the design of black-box optimizers, significantly reducing the need for expert tuning and delivering robust performance across complex problem distributions. Despite their success, a paradox remains: MetaBBO still rely on human-crafted Exploratory Landscape Analysis features to inform the meta-level agent about the low-level optimization progress. To address the gap, this paper proposes Neural Exploratory Landscape Analysis (NeurELA), a novel framework that dynamically profiles landscape features through a two-stage, attention-based neural network, executed in an entirely end-to-end fashion. NeurELA is pre-trained over a variety of MetaBBO algorithms using a multi-task neuroevolution strategy. Extensive experiments show that NeurELA achieves consistently superior performance when integrated into different and even unseen MetaBBO tasks and can be efficiently fine-tuned for further performance boost. This advancement marks a pivotal step in making MetaBBO algorithms more autonomous and broadly applicable. The source code of NeurELA can be accessed at https://github.com/GMC-DRL/Neur-ELA.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. ConfigX: Modular Configuration for Evolutionary Algorithms via Multitask Reinforcement Learning

    cs.LG 2024-12 reject novelty 6.0 of 10

    A unified RL policy can configure modular evolutionary algorithms within a family, but the claimed universal zero-shot generalization across algorithm families is not supported.

Pith tools