The Between-Round Decision in Autonomous Research: An LLM Controller That Reads the Whole Trajectory
Organizations: University of Electronic Science and Technology of China, Chengdu, China · Zhejiang University, Hangzhou, China
Abstract
Executing an idea often changes how promising it looks, so the next step in autonomous research should rest on results, not on proposals. After each round of experiments, the system must decide whether to refine the best solution or start a new direction, which solution to build from, and what goal to set. We call this the between-round decision. Existing systems wrap it in machinery such as rules, scores, search trees, and schedules; where an LLM makes it, what the LLM needs to read is left open. We ask whether an LLM can make this decision from accumulated evidence, without a search structure around it, and how much of that evidence it needs to read. We present BRED (Between-Round Evidence-based Decision), an LLM-based controller that maintains the best verified solution so far (the Champion) and a log of past rounds, and makes one decision per round. On three widely used research-agent benchmark tasks, BRED improves on the task baselines by 4.80% in MAE on ETTh1 (to 0.4172) and by 3.44 and 3.43 points of accuracy on SST-2 (to 95.07%) and CIFAR-100 (to 84.63%), ahead of the published results. When the controller does not read the accumulated evidence, the same loop gains less: with no history it reaches 0.4299 on ETTh1 and 83.71% on CIFAR-100, whereas the full controller's MAE is 2.95% lower and its accuracy 0.92 points higher. On a new task, speech-based depression detection under a leakage-free protocol, it reaches a macro-F1 of 0.6164 on seeds held out from selection, 5.5 points above its baseline and 4.0 above the strongest published system. Code is available at https://github.com/learninginvision/BRED.
Figures & tables
| InternAgent | vs. | ||||||
|---|---|---|---|---|---|---|---|
| Task (dataset) | Metric | Baseline | Dolphin | published | re-run † | Ours | best prior |
| AutoTSF (ETTh1) | MAE | 0.4382 | 0.4627 | 0.4331 | 0.4245 | ||
| AutoClsSST (SST-2) | Acc. | 91.63 | 92.50 | 93.50 | 92.78 | pp | |
| AutoCls2D (CIFAR-100) | Acc. | 81.20 | 82.00 | 83.30 | 83.44 | pp | |
| AutoDepDAIC (DAIC-WOZ) | Macro-F1 | 56.10 | — | — | — | pp | |
| Decide reads | AutoTSF | AutoCls2D |
|---|---|---|
| MAE | Acc. | |
| No history | ||
| 1-round history | ||
| Full history (ours) |
Appendix figures & tables6 assets
Supplementary material from the paper’s appendix.
Appendix
| Left out | Intended purpose | Replacement |
|---|---|---|
| Pattern–action table | Map history to next action | LLM decision over the log |
| Research forest, revive states | Return to old directions | The log plus a new line from the baseline |
| Composite mechanism stack | Track accumulated solution | Champion signature plus code |
| Multi-axis round plan | Express fine-grained intent | Goal-level instruction plus hard constraints |
| Phase | Implementation role |
|---|---|
| Decide | New controller LLM node over the Champion and the log |
| Generate | Existing search planner, retriever, and idea generator |
| Run | Existing code runner and scheduler |
| Record | New log writer and Champion updater |
| Base copying | Existing parent-workspace copy mechanism, if available |
| R | Decide (mode/base) | #cand. | #fail | Best MAE |
|---|---|---|---|---|
| 1 | explore /baseline | 3 | 0 | 0.4608 |
| 2 | explore /baseline | 3 | 0 | 0.4947 |
| 3 | explore /baseline | 3 | 1 | 0.5443 |
| 4 | explore /baseline | 3 | 0 | 0.4226 |
| 5 | explore / iter_4_idea_3 | 3 | 0 | 0.4193 |
| 6 | explore / iter_5_idea_1 | 3 | 1 | 0.4184 |
| R | Decide (mode/base) | #cand. | #fail | Best Acc |
|---|---|---|---|---|
| 1 | explore /baseline | 3 | 1 | 94.61 |
| 2 | exploit / iter_1_idea_1 | 3 | 0 | 94.15 |
| 3 | explore /baseline | 3 | 0 | 94.95 |
| 4 | exploit / iter_3_idea_3 | 3 | 0 | 94.04 |
| 5 | explore /baseline | 3 | 0 | 93.81 |
| 6 | explore / iter_3_idea_3 | 3 | 0 | 94.27 |
| R | Decide (mode/base) | #cand. | #fail | Best Acc |
|---|---|---|---|---|
| 1 | explore /baseline | 4 | 0 | 82.20 |
| 2 | explore / iter_1_idea_5 | 4 | 1 | 83.57 |
| 3 | explore / iter_2_idea_2 | 4 | 1 | 83.91 |
| 4 | explore / iter_3_idea_4 | 4 | 0 | 83.39 |
| 5 | explore /baseline | 4 | 0 | 81.62 |
| 6 | explore /baseline | 4 | 1 | 80.51 |
| R | Decide (mode/base) | #cand. | #fail | Best Macro-F1 |
|---|---|---|---|---|
| 1 | explore /baseline | 5 | 0 | 56.58 |
| 2 | explore / iter_1_idea_6 | 5 | 0 | 59.94 |
| 3 | explore / iter_2_idea_2 | 5 | 1 | 55.65 |
| 4 | explore /baseline | 5 | 5 | — |
| 5 | explore / iter_2_idea_2 | 5 | 5 | — |
| 6 | explore /baseline | 5 | 0 | 56.52 |
Autonomous Research Agents
Autonomous research agents use language models and tools to search literature, design and run experiments, analyze results, and support scientific discovery.
See all 350 papers