SOURCE-LINKED INTELLIGENCE

Self Improvement via Fast Tree-search

arXiv · Artificial Intelligence · article · Sep 17, 2026 · UTC

Coding agents can recursively modify their own implementations, forming a loop of self-improvement. While prior work shows this can boost performance on coding benchmarks, existing approaches are costly and compute-intensive. We introduce a simple, sample-efficient self-improvement framework that significantly improves coding performance under strict budget constraints. We identify evaluation of candidate self-modifications as the main runtime bottleneck since prior approaches estimate their effectiveness by re-running a subset of benchmark tasks with the modified agent, which is time-consumin

Read original source ↗ Open in workspace

recordType

paper

region

Global