← Back to all news
arXiv Machine Learning By Halil Alperen Gozeten, Xuechen Zhang, Emrullah Ildiz, Ege Onur Taga, Tara Javidi, Samet Oymak

Evolutionary Multi-Task Optimization for LLM-Guided Program Discovery

Read the original on arXiv Machine Learning →

The paper introduces EMO-STA, a two‑stage evolutionary multi‑task optimization framework for large‑language‑model (LLM) guided program discovery. First, it evolves a shared archive of executable programs across a family of related tasks; then it adapts selected shared candidates to each target task using strategies such as warm‑starting, best‑average, or best‑per‑task adaptation. Experiments on eight diverse task families show that EMO‑STA outperforms single‑task evolution under matched budgets, with balanced shared and adaptation budgets yielding the best results and shared evolution helping to reduce overfitting in low‑evidence scenarios.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv AI
Aug 12

EvoMem: Memory-Augmented Evolution for Code Optimization

arXiv:2608. 10795v1 Announce Type: new Abstract: Successful mutation strategies in evolutionary code search may contain reusable knowledge that is useful beyond a single run, and in some cases may transfer across related tasks and domains.

By Viktor Volkov, Valentin Khrulkov, Andrey V. Galichin, Danil Sivtsov, Nikita Glazkov, Olga Volkova, Konstantin Pchelin, Iaroslav Bespalov, Dmitry V. Dylov, Petr Anokhin, Ivan Oseledets
llmsnlpbenchmarks
More like this →
Hugging Face Trending Papers
Aug 11

EvoMem: Memory-Augmented Evolution for Code Optimization

Successful mutation strategies in evolutionary code search may contain reusable knowledge that is useful beyond a single run, and in some cases may transfer across related tasks and domains. However, existing LLM-driven evolutionary frameworks largely discard such knowledge, repeatedly rediscovering similar ideas and limiting opportunities for cross-run and cross-task learning.

llmsnlpbenchmarks
More like this →
arXiv AI
Oct 5

FrugalEvo: Towards Cost-Aware LLM-Guided Program Evolution

FrugalEvo introduces a cost‑aware evolutionary framework that pairs a high‑cost, powerful LLM with a cheaper LLM to explore and refine program solutions, respectively. It incorporates a cache‑efficient evolution process that maximizes prefix reuse across steps and defines a Budget‑Aware Area Under the Curve (BA‑AUC) metric to evaluate solution quality within a fixed cost budget. Across ten mathematical and systems optimization tasks, FrugalEvo matches or surpasses state‑of‑the‑art baselines in final solution quality and achieves higher BA‑AUC on nine tasks, while delivering new state‑of‑the‑art performance on circle packing for costs as low as $0.55 to $1.68.

By Hui Chen, Xuan Qi, James Xu Zhao, Zhaopeng Feng, Shilong Liu, Kuang Xu, Pang Wei Koh, Bryan Hooi
llmsagentsbenchmarks
More like this →
arXiv AI
Oct 15

TurboEvolve: Towards Fast and Robust LLM-Driven Program Evolution

TurboEvolve is a multi‑island evolutionary framework that enhances LLM‑driven program evolution by improving sample efficiency and stability within fixed API‑cost budgets. It introduces Verbalized Sampling to generate multiple diverse candidates in a single LLM call, an adaptive scheduler that adjusts the number of offspring based on progress, and island‑aware initialization that clusters seed programs and mixes subpopulations with elitist preservation. The authors also provide a reusable cross‑task solution‑pool dataset and demonstrate that TurboEvolve achieves better cost‑quality trade‑offs and more stable performance on mathematical discovery and GPU‑kernel optimization tasks compared to controlled baselines.

By Yang Yang, Zining Zhong, Jindong Li, Jiemin Wu, Kaishen Yuan, Wenshuo Chen, Menglin Yang, Yutao Yue
llms
More like this →