From Heuristic Selection to Automated Algorithm Design: LLMs Benefit from Strong Priors

· Source: cs.NE updates on arXiv.org · Field: Technology & Digital — Artificial Intelligence & Machine Learning, Emerging Technologies & Innovation, Mathematics & Computational Sciences · Depth: Expert, extended

Summary

A new study introduces the Benchmark-Assisted Guided evolutionary approach (BAG) for LLM-driven black-box optimization (BBO), demonstrating that providing high-quality algorithmic code examples significantly improves LLM performance. The research utilized AttnLRP to analyze token-wise prompt attribution, revealing that code-related content and associated strategy instructions exert the strongest influence on generated algorithmic code. Building on this, BAG integrates prior benchmark algorithms into an elitist search strategy, guiding LLMs towards promising search regions. Extensive experiments on 23 pseudo-Boolean optimization (pbo) problems and 24 continuous BBO (bbob) problems, using Gemini 2.0 Flash, GPT 5 Nano, and Qwen3 Coder Flash LLMs, show BAG consistently outperforms five state-of-the-art LLM-driven optimization methods, achieving up to a 14% improvement in average AUC on bbob problems. The findings highlight the value of fusing benchmark data to enhance the efficiency and robustness of LLM-driven BBO.

Key takeaway

For research scientists developing LLM-driven optimization methods, you should prioritize integrating established benchmark algorithms and high-quality code examples into your prompt designs. This strategy, as demonstrated by the BAG approach, significantly enhances the efficiency and robustness of algorithm generation, particularly for black-box optimization problems. Focusing on code-centric prompt guidance rather than solely linguistic instructions will lead to superior and more reliable algorithmic outcomes.

Key insights

Integrating benchmark code examples into prompts significantly enhances LLM-driven algorithm optimization performance and robustness.

Principles

Method

The Benchmark-Assisted Guided (BAG) approach uses an (1+1) elitist search strategy, initializing with a promising benchmark algorithm and iteratively refining or creating new algorithms, with periodic benchmark algorithm injections.

In practice

Topics

Code references

Best for: Research Scientist, AI Researcher, AI Scientist, Prompt Engineer

Related on AIssential

Open in AIssential →

Editorial summary, takeaway, and curation by AIssential. Original article published by cs.NE updates on arXiv.org.