AutoSFT introduces a multi‑agent framework for automated data research in supervised fine‑tuning, where a meta agent separates execution from analysis, gathers diverse proposals, and invokes a synthesis subagent when the data pool is insufficient. The system demonstrates that adding an executor, analysis subagents, and synthesis progressively improves performance on IFEval, IFBench, and MBPP benchmarks, with each component’s impact clearly attributable. These results suggest that effective automation of SFT data research relies on covering a wide range of data actions rather than relying on a single powerful action.
arXiv:2610.34500v1 Announce Type: new Abstract: Data curation is a first-order design choice in machine learning, yet tailoring training data to a downstream model and task remains costly in labor, e...
The paper introduces ParetoRSI-Gym, a framework for evaluating recursive self‑improvement (RSI) in language models across multiple domains—math, code, finance, medicine, and science—by having agents iteratively search for, curate, and train on data while keeping the base model, toolset, and training pipeline fixed. Experiments with three agent systems and three base models show that the best system (Claude Code with Opus‑5) improves generalization scores by an average of 9.2% relative to the starting model, with domain‑specific gains up to 63%. The study highlights that both the harness and the agent’s data‑selection strategy significantly influence outcomes, underscoring the need for realistic multi‑domain evaluation of RSI systems.
Interlock is a framework that transforms long‑horizon tasks into typed completion graphs, linking evidence, decisions, and required effects through grounding, coupling, and realization edges. It compiles these graphs into a resettable workspace, a public request, and an evaluation rubric, and uses source‑coverage, public‑input, and agent‑as‑judge reviews to ensure that all mandatory requirements are met. Fine‑tuning Qwen3.6 backbones on Interlock‑generated trajectories improves pass rates on AutomationBench, JobBench, and Harvey LAB, showing that the synthesized experience benefits external task environments.
Data curation is a first-order design choice in machine learning, yet tailoring training data to a downstream model and task remains costly in labor, expertise, and compute. Datasets are therefore oft...
arXiv:2603. 23420v2 Announce Type: replace Abstract: If autoresearch is itself a form of research, then autoresearch can be applied to research itself.
The paper introduces Belief-Calibrated Optimization (BCO), a method that records and updates a persistent in‑context document representing an agent’s belief about how the environment responds to edits. By continually revising this world model as new candidates are evaluated, BCO improves the performance of frozen LLM agents across five benchmarks, outperforming a control lacking the world model. An offline ablation shows that the document’s content provides reusable, accurate predictions of environmental responses, beyond mere form.
arXiv:2606. 01667v1 Announce Type: new Abstract: Test-time scaling has become a major way to improve large language model reasoning, but its orchestration has remained designer-engineered: a fixed sample budget, a fixed refinement loop, a fixed scoring rule, or a fixed search policy decides how compute is spent, leaving the model in charge of solving but not of orchestration.
arXiv:2607. 06764v1 Announce Type: new Abstract: Recent progress on ARC-AGI-1 from disclosed architectures has come broadly from two regimes: heavy test-time compute over frontier models (evolutionary search, exhaustive sampling, extended chain-of-thought), or benchmark-specific training in which small models are fine-tuned on ARC data, often with task-specialized architectures.
The paper introduces agentic meta‑reasoning, a structured inference‑time framework that explicitly manages control decisions—such as selecting partial work, restarting, or stopping—during long‑horizon agentic tasks. By delegating task execution to workers and consolidating decisions through a lightweight controller that references persistent memory, the method reduces the need to replay full histories. Experiments on ProgramBench and other benchmarks show that meta‑reasoning improves performance over direct control baselines, especially as computation budgets increase, and reveals greater reuse of earlier work and higher solution coverage.
arXiv:2608.31076v1 Announce Type: cross Abstract: Autonomous scientific research agents are increasingly applied to end-to-end scientific workflows, including literature review, data analysis, experi...
EMMA is a framework that treats the configuration of a multi‑agent system—controller routing, specialist prompts, and procedural skills—as structured episodic memory. It explicitly assigns ownership and limits updates through a reflector and backbone‑independent guards, ensuring edits are scoped, incremental, and bounded. Experiments on KramaBench, AppWorld, and BBEH show EMMA outperforms four baselines, achieving up to 32.5% higher performance and reducing training executions by 17–38%.
RankEvolve is an auto‑research framework that evolves generative ranking models by orchestrating multiple large‑language‑model coding agents through an Executable Operating Protocol (EOP). The system compiles a state machine that enforces phases, gates, branches, and loops, while a meta‑meta‑harness lets agents review and repair each other’s code. In budget‑matched experiments, heterogeneous composition of agents raised execution accuracy from 45.8 % to 62.5 % and reduced silent critical‑defect rates, achieving notable gains on the HSTU recommender and other benchmarks.