Pith. sign in

REVIEW 4 cited by

In-the-loop Hyper-Parameter Optimization for LLM-Based Automated Design of Heuristics

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 2410.16309 v1 pith:OAHU462F submitted 2024-10-07 cs.NE cs.AI

classification cs.NEcs.AI
keywords optimizationcodeframeworkhyper-parameterllamea-hpoalgorithmicapproachcomputational
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Large Language Models (LLMs) have shown great potential in automatically generating and optimizing (meta)heuristics, making them valuable tools in heuristic optimization tasks. However, LLMs are generally inefficient when it comes to fine-tuning hyper-parameters of the generated algorithms, often requiring excessive queries that lead to high computational and financial costs. This paper presents a novel hybrid approach, LLaMEA-HPO, which integrates the open source LLaMEA (Large Language Model Evolutionary Algorithm) framework with a Hyper-Parameter Optimization (HPO) procedure in the loop. By offloading hyper-parameter tuning to an HPO procedure, the LLaMEA-HPO framework allows the LLM to focus on generating novel algorithmic structures, reducing the number of required LLM queries and improving the overall efficiency of the optimization process. We empirically validate the proposed hybrid framework on benchmark problems, including Online Bin Packing, Black-Box Optimization, and the Traveling Salesperson Problem. Our results demonstrate that LLaMEA-HPO achieves superior or comparable performance compared to existing LLM-driven frameworks while significantly reducing computational costs. This work highlights the importance of separating algorithmic innovation and structural code search from parameter tuning in LLM-driven code optimization and offers a scalable approach to improve the efficiency and effectiveness of LLM-based code generation.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

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

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

    cs.SE 2025-04 conditional novelty 6.0 of 10

    BLADE is an open-source, modular benchmark suite for evaluating LLM-driven automated algorithm discovery on continuous black-box optimization problems.

  2. Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing

    cs.NE 2025-01 accept novelty 6.0 of 10

    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.

  3. Language Models for Code Optimization: Survey, Challenges and Future Directions

    cs.SE 2025-01 accept novelty 5.0 of 10

    A systematic review of 53 papers on using large language models for code optimization, with a taxonomy, five challenges, and eight future research directions.

  4. Controlling the Mutation in Large Language Models for the Efficient Evolution of Algorithms

    cs.NE 2024-12 conditional novelty 5.0 of 10

    Dynamic mutation prompts sampled from a power-law distribution improve the convergence speed of LLaMEA when driven by GPT-4o, but not GPT-3.5-turbo.

Pith tools