AutoSFT: An Agentic System for Automated Data Research in Supervised Fine-Tuning
Organizations: Tsinghua University · Beijing University of Posts and Telecommunications · ModelBest Inc. · University of Illinois Urbana-Champaign ·
Abstract
Language model agents increasingly automate post-training, but when given the full training stack they converge on supervised fine-tuning and spend most effort revising training data. Existing systems give the agent one kind of control, selecting rows from a fixed pool or calling a generator, whereas a human data engineer adjusts proportions, prunes, repairs, replaces and synthesizes the data. We design a data action space for these changes and ask whether an automated system can make the full range rather than one of them, and what structure that requires. We first run this loop with a single agent, and it reaches only one action, adjusting category proportions, while its context fills with execution output and is discarded mid-search. We therefore introduce AutoSFT, a multi-agent system where a meta agent separates execution from analysis, gathers proposals from independent angles, and calls a synthesis subagent for capabilities the pool cannot cover, with the model, the trainer, and the budget fixed within each comparison. Adding each component in turn helps: the executor halves context loss, the analysis subagents lift the best IFEval by , and synthesis adds IFEval and IFBench. The same loop transfers to code, where analysis adds MBPP+ over a single agent that does not improve. Every result comes from runs that retrain from the base model each round, so each component's effect is individually attributable. Our findings suggest that automating SFT data research depends more on covering diverse data actions than on a stronger single action.
Figures & tables
Appendix figures & tables13 assets
Supplementary material from the paper’s appendix.
Appendix
| Round | Action | Rows | IFEval | IFBench | Round | Action | Rows | IFEval | IFBench |
| 1 | W | 34,860 | 0.6550 | 0.3728 | 17 | W | 32,812 | 0.6286 | 0.3595 |
| 2 | W | 34,765 | 0.6630 | 0.3535 | 18 | W | 37,806 | 0.6631 | 0.3674 |
| 3 | W | 34,721 | 0.6541 | 0.3643 | 19 | W | 37,433 | 0.6327 | 0.3876 |
| 4 | W | 34,431 | 0.6511 | 0.3618 | 20 | W | 37,532 | 0.6492 | 0.3868 |
| 5 | W | 32,545 | 0.6588 | 0.3657 | 21 | W | 36,974 | 0.6395 | 0.3552 |
| 6 | W | 31,246 | 0.6572 | 0.3438 | 22 | W | 37,342 | 0.6428 | 0.3819 |
| Source | Bytes | Share |
| Agent reasoning | 1,610,649 | 16.3% |
| Training output | 1,322,501 | 13.4% |
| Re-reading the run record | 1,167,202 | 11.8% |
| Applying the data action | 953,273 | 0 9.7% |
| Tool-call records | 903,931 | 0 9.2% |
| Other file reads | 889,396 | 0 9.0% |
| Role | Skill | Purpose |
| Meta agent | recipe authoring | Assemble the round’s training set from the pool under the token budget. |
| synthesis handbook | Describe the role of synthesis, the structure and update rules of its pool, and how to use its outputs. | |
| Executor | training submission | Submit a training job to the cluster. |
| job lifecycle | Monitor, collect, and stop cluster jobs. | |
| checkpoint conversion | Convert a trained checkpoint for evaluation. | |
| evaluation submission | Submit one evaluation job per benchmark. |
| Data action | With analysis | Base | ||
| Mixture | ||||
| Constraint type | 33.3% | (10/30) | 17.2% | (5/29) |
| Number of constraints | 34.8% | (8/23) | 14.3% | (1/7) |
| Rare constraint types | 16.7% | (1/6) | 33.3% | (2/6) |
| Language | 25.0% | (4/16) | 0.0% | (0/2) |
| Pool-wide selection | 50.0% | (2/4) | 9.1% | (1/11) |
| Component | Setting |
| Agent | |
| Harness | OpenAI Codex |
| Research agent | GPT-5.5, medium reasoning effort |
| Generation backend | DeepSeek V4 Flash |
| Training | |
| Base model | Qwen3-1.7B-Base |
| Analysis | Synthesis | Code | |
| Initial pool | Open ifeval-like pool ( Section 3 ) | 742,842 Python pairs | |
| Token budget | 3M | 100M | 100M |
| Sequence length | 32,768 | 32,768 | 8,192 |
| Benchmarks | IFEval | IFEval, IFBench | MBPP+ |
| Evaluation | avg@10 | avg@10 | avg@3 |
Supervised Fine-Tuning
Supervised fine-tuning adapts pretrained models by learning from labeled examples, instructions, demonstrations, and task-specific trajectories.
See all 223 papers