REVIEW 7 cited by
LLaMEA: A Large Language Model Evolutionary Algorithm for Automatically Generating Metaheuristics
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
Signed reviews
read the original abstract
Large Language Models (LLMs) such as GPT-4 have demonstrated their ability to understand natural language and generate complex code snippets. This paper introduces a novel Large Language Model Evolutionary Algorithm (LLaMEA) framework, leveraging GPT models for the automated generation and refinement of algorithms. Given a set of criteria and a task definition (the search space), LLaMEA iteratively generates, mutates and selects algorithms based on performance metrics and feedback from runtime evaluations. This framework offers a unique approach to generating optimized algorithms without requiring extensive prior expertise. We show how this framework can be used to generate novel black-box metaheuristic optimization algorithms automatically. LLaMEA generates multiple algorithms that outperform state-of-the-art optimization algorithms (Covariance Matrix Adaptation Evolution Strategy and Differential Evolution) on the five dimensional black box optimization benchmark (BBOB). The algorithms also show competitive performance on the 10- and 20-dimensional instances of the test functions, although they have not seen such instances during the automated generation process. The results demonstrate the feasibility of the framework and identify future directions for automated generation and optimization of algorithms via LLMs.
Forward citations
Cited by 7 Pith papers
-
SCOPE: Synthetic Conditional Objectives for Policy Evolution in Black-Box Combinatorial Optimization
SCOPE evolves LLM-generated auxiliary objective functions and selects a validated portfolio of them to guide fixed combinatorial search engines under strict black-box query budgets.
-
Large Language Model-Driven Surrogate-Assisted Evolutionary Algorithm for Expensive Optimization
LLM-SAEA uses an LLM scoring expert and an LLM decision expert to dynamically select surrogate models and infill criteria, and it reports competitive results on expensive-optimization benchmarks, though the gain over ...
-
Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing
Across 6,064 bin-packing instances from 12 datasets, the hand-designed Best-Fit heuristic outperforms most LLM-evolved heuristics, which do not generalize beyond their training distributions.
-
Improving Existing Optimization Algorithms with LLMs
A GPT-4o-proposed age-aware heuristic for the CMSA metaheuristic outperforms the expert degree-based heuristic on Maximum Independent Set instances across three graph families.
-
Language Models for Code Optimization: Survey, Challenges and Future Directions
A systematic review of 53 papers on using large language models for code optimization, with a taxonomy, five challenges, and eight future research directions.
-
Advanced For-Loop for QML algorithm search
The paper sketches an LLM-based multi-agent framework that generated quantum variants of MLP, forward-forward, and backpropagation, but with no reproducible evidence that the search works.
-
The Paradox of Success in Evolutionary and Bioinspired Optimization: Revisiting Critical Issues, Key Studies, and Methodological Pathways
A survey argues that bioinspired optimization suffers from a 'paradox of success' in which many metaphor-based algorithms lack real novelty, and lays out methodological remedies.
Discussion (0). Continue with ORCID to comment.