Metraipolis › archive › dc_9b720efe0a3c
FrugalEvo: Towards Cost-Aware LLM-Guided Program Evolution — arXiv:2610.03675
- Source
- arXiv
- Original
- https://arxiv.org/abs/2610.03675
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-05T22:50:48.028Z
- SHA-256 of the archived text
842c625c137ca07cc1e141142204fc93bafcb8409294182998b50abb9ac226cd- Stable URL of this page
https://metraipolis.com/documento/dc_9b720efe0a3c
How to cite
FrugalEvo: Towards Cost-Aware LLM-Guided Program Evolution — arXiv:2610.03675 — arXiv, https://arxiv.org/abs/2610.03675 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9b720efe0a3c (Metraipolis archive dc_9b720efe0a3c, sha256 842c625c137ca07cc1e141142204fc93bafcb8409294182998b50abb9ac226cd)
BibTeX
@misc{dc9b720efe0a3c,
title = {FrugalEvo: Towards Cost-Aware LLM-Guided Program Evolution — arXiv:2610.03675},
howpublished = {arXiv},
url = {https://arxiv.org/abs/2610.03675},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9b720efe0a3c; sha256 842c625c137ca07cc1e141142204fc93bafcb8409294182998b50abb9ac226cd},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv, https://arxiv.org/abs/2610.03675. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
LLM-guided evolutionary methods, such as AlphaEvolve, have emerged as powerful approaches for challenging computational optimization problems, such as circle packing. However, prior work typically optimizes performance gain over a fixed number of iterations. We argue that practical optimization should maximize gain per unit cost. To this end, we propose FrugalEvo, a cost-aware evolutionary framework where a stronger, higher-cost LLM explores solution strategies, and a cheaper LLM implements them and iteratively refines the resulting code. We also design a cache-efficient evolution process, where our harness and prompts maximize the sharing of prefixes across different evolution steps, to improve cache reuse. To measure solution quality throughout a fixed cost budget, we introduce Budget-Aware Area Under the Curve (BA-AUC), defined as the area under the best-so-far evaluation score curve over cumulative LLM cost, up to the budget. Across 10 mathematical and systems optimization tasks, FrugalEvo matches or surpasses state-of-the-art baselines, including OpenEvolve, ShinkaEvolve, AdaEvolve, and EvoX, in final solution quality and achieves higher BA-AUC on 9 tasks. It also achieves higher average performance than these baselines on 10 algorithmic optimization tasks from ALE-Bench-Lite. Notably, on circle packing, FrugalEvo achieves new state-of-the-art performance with GPT-5.6 Terra and Luna for only 1.68 USD and with GLM-5.3 and its Flash variant for only 0.55 USD, matching or surpassing all baselines, including multi-agent methods such as CORAL and SwarmResearch, which cost approximately 50 USD on average. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno). Categorie arXiv: Neural and Evolutionary Computing (cs.NE) ; Artificial Intelligence (cs.AI); Computation and Language (cs.CL). Pagina del lavoro: https://arxiv.org/abs/2610.03675 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-05T22:45:55.881Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).