mlsanityData to 7 Oct 2026

BLADE: Benchmark suite for LLM-driven Automated Design and Evolution of iterative optimisation heuristics

arXiv 2504.20183 ↗First posted 28 Apr 2025cs.SE cs.AI cs.NEcited by 9

Not on the map. Why?

Abstract (arXiv)

The application of Large Language Models (LLMs) for Automated Algorithm Discovery (AAD), particularly for optimisation heuristics, is an emerging field of research. This emergence necessitates robust, standardised benchmarking practices to rigorously evaluate the capabilities and limitations of LLM-driven AAD methods and the resulting generated algorithms, especially given the opacity of their design process and known issues with existing benchmarks. To address this need, we introduce BLADE (Benchmark suite for LLM-driven Automated Design and Evolution), a modular and extensible framework specifically designed for benchmarking LLM-driven AAD methods in a continuous black-box optimisation context. BLADE integrates collections of benchmark problems (including MA-BBOB and SBOX-COST among others) with instance generators and textual descriptions aimed at capability-focused testing, such as generalisation, specialisation and information exploitation. It offers flexible experimental setup options, standardised logging for reproducibility and fair comparison, incorporates methods for analysing the AAD process (e.g., Code Evolution Graphs and various visualisation approaches) and facilitates comparison against human-designed baselines through integration with established tools like IOHanalyser and IOHexplainer. BLADE provides an `out-of-the-box' solution to systematically evaluate LLM-driven AAD approaches. The framework is demonstrated through two distinct use cases exploring mutation prompt strategies and function specialisation.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 17 of its 39 references that are in the map. First posted on arXiv 28 Apr 2025.

Builds on

17 of 39 references.

References · 17

  1. 2024Gemini 1.5: Unlocking multimodal understanding across millions of tokens of contextcited by 3,175
  2. 2016COCO: A Platform for Comparing Continuous Optimizers in a Black-Box Settingcited by 135
  3. 2024LLaMEA: A Large Language Model Evolutionary Algorithm for Automatically Generating Metaheuristicscited by 92
  4. 2024A Systematic Survey on Large Language Models for Algorithm Designcited by 65
  5. 2020Benchmarking in Optimization: Best Practice and Open Issuescited by 35
  6. 2024In-the-loop Hyper-Parameter Optimization for LLM-Based Automated Design of Heuristicscited by 28
  7. 2020IOHanalyzer: Detailed Performance Analyses for Iterative Optimization Heuristicscited by 20
  8. 2021Tuning as a Means of Assessing the Benefits of New Ideas in Interplay with Existing Algorithmic Modulescited by 20
  9. 2021Reproducibility in Evolutionary Computationcited by 12
  10. 2023MA-BBOB: A Problem Generator for Black-Box Optimization Using Affine Combinations and Shiftscited by 11
  11. 2022BBOB Instance Analysis: Landscape Properties and Algorithm Performance across Problem Instancescited by 10
  12. 2024Explainable Benchmarking for Iterative Optimization Heuristicscited by 10
5 more
  1. 2025Code Evolution Graphs: Understanding Large Language Model Driven Design of Algorithmscited by 10
  2. 2024Controlling the Mutation in Large Language Models for the Efficient Evolution of Algorithmscited by 6
  3. 2024Generalization Ability of Feature-based Performance Prediction Models: A Statistical Analysis across Benchmarkscited by 4
  4. 2025Optimizing Photonic Structures with Large Language Model Driven Algorithm Discoverycited by 4
  5. 2023Analysis of modular CMA-ES on strict box-constrained problems in the SBOX-COST benchmarking suitecited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 5; 2026: 4.

9 papers.