Autoresearch agents get stuck in local optima — the fix may be making them forget

eshorten300 · x · 2026-11-03

On the 149th Weaviate Podcast, UC Berkeley PhD student Shangyin Tan explains why long-running autoresearch agents stall like numeric optimizers: as the history of attempts piles up in context, the agent anchors on it and every new idea becomes a small tweak of what already exists.

The fix is simple: throw the history away. Keep the best solution, drop the path that led to it, and let the agent explore without conditioning on extra context.

The work builds on GEPA and its successor optimizeanything, extending these ideas from prompt optimization to code, GPU kernels, and agent harnesses. Tan also draws a sharp distinction: prompts and harnesses are generalization tests, while a single kernel is pure optimization.

Original post →

More from coding & agent

coding & agent channel →