SwarmResearch: Orchestrating Coding Agents for Open-Ended Discovery
About
Long-running coding agents such as autoresearch can persistently discover optimizations for open-ended problems. However, they tend to converge onto a single high-level approach, then proceed with low-level edits while missing other superior approaches to the problem. We hypothesize two harness-level design choices contribute to this behavior: accumulating context in a single long-running agent and only exposing a single program state to edit. We introduce SwarmResearch, an orchestrator-subagent harness in which a Shepherd Agent uses global context to steer a population of Search Agents, each operating with local context in their respective git branch. On open-ended optimization tasks, SwarmResearch discovers better or comparable solutions to state-of-the-art LLM-guided evolution and multi-agent techniques on 13/15 tasks, driven by higher-level exploration. Compared with fixed scaling of serial and parallel agents, SwarmResearch's orchestrator-guided scaling discovers better-performing solutions by adapting parallelism at different search depths.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Mathematical Optimization | Signal Processing | -- | 16 | |
| Systems Optimization | LLM-SQL | Final Score0.7331 | 15 | |
| Mathematical Optimization | MMD-14-3 | Final Score4.1658 | 9 | |
| Mathematical Optimization | 3rd-Autocorr | Final Score1.4565 | 9 | |
| Systems Optimization | EPLB | Final Score0.1436 | 9 | |
| Systems Optimization | PRISM | Final Score26.26 | 9 | |
| Systems Optimization | Cloudcast | Final Score618 | 9 | |
| Mathematical Optimization | Mathematics Circle-Packing | Score2.636 | 7 | |
| Heuristic Optimization | Territory AHC008 | Score1.30e+3 | 4 | |
| Heuristic Optimization | Halloween Candy AHC015 | Score2.54e+3 | 4 |