Metraipolis › archive › dc_db88ee6d33d2

Component-Aware Feedback for Self-Evolving Programs — arXiv:2609.38639

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.38639
License (as archived)
CC0-1.0
Archived
2026-10-07T12:41:59.045Z
SHA-256 of the archived text
b339b22da41125d15ccdd5f8ba22cd1d3ae5f48d9e8319a6115e801bda9dc290
Stable URL of this page
https://metraipolis.com/documento/dc_db88ee6d33d2

How to cite

Component-Aware Feedback for Self-Evolving Programs — arXiv:2609.38639 — arXiv (en), https://arxiv.org/abs/2609.38639 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_db88ee6d33d2 (Metraipolis archive dc_db88ee6d33d2, sha256 b339b22da41125d15ccdd5f8ba22cd1d3ae5f48d9e8319a6115e801bda9dc290)
BibTeX
@misc{dcdb88ee6d33d2,
  title = {Component-Aware Feedback for Self-Evolving Programs — arXiv:2609.38639},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.38639},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_db88ee6d33d2; sha256 b339b22da41125d15ccdd5f8ba22cd1d3ae5f48d9e8319a6115e801bda9dc290},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.38639. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

LLM-guided evolutionary search can discover complex programs, but existing methods mostly only save candidate programs and fitness scores while discarding which component edits produced which fitness metric changes. Existing methods force the mutator LLM to infer the effect of prior edits from cluttered histories, making program search slow and unstable. This is especially true for locally servable LLMs to evolve multi-component systems. We introduce component-aware feedback, which compares each evaluated program with its parent, identifies the components that changed, and logs them with the associated metric differences into an attribution memory that later mutations read. The memory keeps each change in two reference frames, local against the parent it came from and global against the seed program, which shows both the immediate effect of a change and the cumulative progress made since the seed. We study this on LLM reranking, a multi-objective optimization problem where a multi-stage pipeline must balance quality against serving cost. Across twelve \textsc{Bright} datasets, our method reaches the strongest baseline's final quality after a median of one third of the search budget and ends 7.2\% higher in held-out nDCG@10, and under a cost-aware objective it finds pipelines that are on average more accurate while using 11\% fewer tokens per query, showing component-aware feedback to be a promising direction for more efficient self-evolving systems.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-10-01 in cs.AI).
Categorie arXiv: Artificial Intelligence (cs.AI) ; Information Retrieval (cs.IR).
Pagina del lavoro: https://arxiv.org/abs/2609.38639 — 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-07T12:14:13.652Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).