arXiv AI By Bingxiang He, Pengqi Sun, Shihao Peng, Shaoxuan Li, Huiyu Xiao, Hongjian Shi, Zixuan Fu, Ziqing Qiao, Yuxin Zuo, Cheng Qian, Xinqiang Yu, Jiayi Li, Xiusi Chen, Yizhen Song, Xiangyang Wang, Iofai Lei, Yudong Wang, Ning Ding, Zhiyuan Liu, Xiaozhi Wang, Chaojun Xiao

AutoSFT: An Agentic System for Automated Data Research in Supervised Fine-Tuning

Read the original on arXiv AI →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Oct 27

ParetoRSI-Gym: Can AI Agents Improve Language Models Across Multiple Domains?

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.

By Haojin Wang, Yangzhen Wu, Zeyi Chen, Jian Xie, Jiaying Ye, Lili Meng, Shuyun Tang, Shangding Gu, Dawn Song
arXiv Computation and Language
Oct 15

Interlock: From Local Correctness to Task Completion in Long-Horizon Agents

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.

By Linji Hao, Yanji He, Zihan Wang, Hansi Yang, Jiayuan Zhang, Hongyan Hao, Qi Gu, Yan Feng, Han Wu
arXiv AI
Sep 3

Belief-Calibrated Optimization: An Explicit World Model for Agentic Optimization

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.

By Yuhan Chen, Zhihua Tian, Mahavir Dabas, Charith Peris, Rahul Gupta, Ming Jin, Feiyang Kang, Siyuan Zhang, Nan Wang, Ruoxi Jia