NTH

FrugalEvo: Towards Cost-Aware LLM-Guided Program Evolution

AuthorsHui Chen, Xuan Qi, James Xu Zhao, Zhaopeng Feng, Shilong Liu, Kuang Xu, Pang Wei Koh, Bryan Hooi

AffiliationsNational University of Singapore · University of Washington · Princeton University

October 13, 2026 2 min read
Watch on YouTube
The one-line take

FrugalEvo makes LLM-driven program evolution more practical by combining stronger strategic models, cheaper implementers, and cache-aware search to achieve competitive results at far lower cost.

Key results

20
Optimization tasks evaluated

Total mathematical, systems, and algorithmic optimization tasks.

9
Tasks with higher BA-AUC

Of 10 mathematical and systems optimization tasks.

2.635990
Circle Packing score

Sum of radii using GLM-5.3 and GLM-5.3 Flash.

0.55
Circle Packing cost

USD to reach the 2.635990 score with GLM-5.3 and GLM-5.3 Flash.

What the paper found

FrugalEvo reframes LLM-guided program evolution around solution quality per dollar rather than progress per iteration. Its key design splits the work: a stronger model proposes distinct optimization strategies, while a cheaper model implements and iteratively refines code; cache-friendly prompt ordering also reuses shared prefixes to reduce inference costs. A new metric, Budget-Aware Area Under the Curve, integrates the best score over cumulative LLM cost, measuring progress throughout a fixed budget. Across 20 mathematical, systems, and algorithmic optimization tasks, FrugalEvo achieves higher BA-AUC than baselines on 9 of 10 mathematical and systems tasks, and leads average performance on ALE-Bench-Lite. On circle packing, GLM-5.3 paired with GLM-5.3 Flash reaches a sum of radii of 2.635990 for $0.55, matching or exceeding established methods including AlphaEvolve; an OpenAI GPT-5.6 Terra-and-Luna configuration reaches 2.635996 for $1.68. The results show that assigning strategy discovery and code refinement to models with different costs can improve both final solutions and search efficiency.

Original abstract

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.

Read the original paper

More in Efficient AI

Browse all 61 papers →