Procedural Graphs: Self-Evolving Execution Structures for LLM Agents
Procedural Graphs externalize an agent’s workflow, guide each action from the relevant subgraph, and refine the structure from failed and working runs. This targets drift and repeated tool mistakes on long tasks.
A **Procedural Graph** represents what to do as linked procedure-relation-procedure triples. At each decision, the system locates the active node and converts its surrounding subgraph into guidance for the solver’s next action.
For long-running coding agents, this suggests making workflow state explicit instead of relying only on an expanding transcript. The refinement loop can compare failed and working trajectories, then update the graph while preserving changes that help held-out validation.
A **Procedural Graph** represents what to do as linked procedure-relation-procedure triples. At each decision, the system locates the active node and converts its surrounding subgraph into guidance for the solver’s next action. For long-running coding agents, this suggests making workflow state explicit instead of relying only on an expanding transcript. The refinement loop can compare failed and working trajectories, then update the graph while preserving changes that help held-out validation. The material reports consistent gains over memory-based baselines across multiple datasets, task types, and models, but gives no result sizes here. The approach also adds a guidance model, a refiner, and validation machinery to the harness.
This turns durable agent state from a passive record into an executable, locally retrieved workflow that can be revised from outcomes. It gives the prior long-running harness patterns a concrete adaptive structure, while raising the bar for curation: graph updates need held-out validation so accumulated experience does not encode regressions.