Understanding the Challenges in Iterative Generative Optimization with LLMs

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Nie, Allen, Daull, Xavier, Kuang, Zhiyi, Akkiraju, Abhinav, Chaudhuri, Anish, Piasevoli, Max, Rong, Ryan, Yuan, YuCheng, Choudhary, Prerit, Xiao, Shannon, Fakoor, Rasool, Swaminathan, Adith, Cheng, Ching-An
Format: Preprint
Veröffentlicht: 2026
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866916048796647424
author Nie, Allen
Daull, Xavier
Kuang, Zhiyi
Akkiraju, Abhinav
Chaudhuri, Anish
Piasevoli, Max
Rong, Ryan
Yuan, YuCheng
Choudhary, Prerit
Xiao, Shannon
Fakoor, Rasool
Swaminathan, Adith
Cheng, Ching-An
author_facet Nie, Allen
Daull, Xavier
Kuang, Zhiyi
Akkiraju, Abhinav
Chaudhuri, Anish
Piasevoli, Max
Rong, Ryan
Yuan, YuCheng
Choudhary, Prerit
Xiao, Shannon
Fakoor, Rasool
Swaminathan, Adith
Cheng, Ching-An
contents Generative optimization uses large language models (LLMs) to iteratively improve artifacts (such as code, workflows or prompts) using execution feedback. It is a promising approach to building self-improving agents, yet in practice remains brittle: despite active research, only 9% of surveyed agents used any automated optimization. We argue that this brittleness arises because, to set up a learning loop, an engineer must make ``hidden'' design choices: What can the optimizer edit and what is the "right" learning evidence to provide at each update? We investigate three factors that affect most applications: the starting artifact, the credit horizon for execution traces, and batching trials and errors into learning evidence. Through case studies in MLAgentBench, Atari, and BigBench Extra Hard, we find that these design decisions can determine whether generative optimization succeeds, yet they are rarely made explicit in prior work. Different starting artifacts determine which solutions are reachable in MLAgentBench, truncated traces can still improve Atari agents, and larger minibatches do not monotonically improve generalization on BBEH. We conclude that the lack of a simple, universal way to set up learning loops across domains is a major hurdle for productionization and adoption. We provide practical guidance for making these choices.
format Preprint
id arxiv_https___arxiv_org_abs_2603_23994
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Understanding the Challenges in Iterative Generative Optimization with LLMs
Nie, Allen
Daull, Xavier
Kuang, Zhiyi
Akkiraju, Abhinav
Chaudhuri, Anish
Piasevoli, Max
Rong, Ryan
Yuan, YuCheng
Choudhary, Prerit
Xiao, Shannon
Fakoor, Rasool
Swaminathan, Adith
Cheng, Ching-An
Machine Learning
Artificial Intelligence
Generative optimization uses large language models (LLMs) to iteratively improve artifacts (such as code, workflows or prompts) using execution feedback. It is a promising approach to building self-improving agents, yet in practice remains brittle: despite active research, only 9% of surveyed agents used any automated optimization. We argue that this brittleness arises because, to set up a learning loop, an engineer must make ``hidden'' design choices: What can the optimizer edit and what is the "right" learning evidence to provide at each update? We investigate three factors that affect most applications: the starting artifact, the credit horizon for execution traces, and batching trials and errors into learning evidence. Through case studies in MLAgentBench, Atari, and BigBench Extra Hard, we find that these design decisions can determine whether generative optimization succeeds, yet they are rarely made explicit in prior work. Different starting artifacts determine which solutions are reachable in MLAgentBench, truncated traces can still improve Atari agents, and larger minibatches do not monotonically improve generalization on BBEH. We conclude that the lack of a simple, universal way to set up learning loops across domains is a major hurdle for productionization and adoption. We provide practical guidance for making these choices.
title Understanding the Challenges in Iterative Generative Optimization with LLMs
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2603.23994