SyncAI.news, a Varaisys broadcasting
AtomSearch: Evidence-Grounded Tree Search for Agent Skill Optimization
JT

Jia Tong, Senyou Deng, Min Peng, Jianfeng Pan

· 1 min read

ResearcharXiv cs.CL

AtomSearch: Evidence-Grounded Tree Search for Agent Skill Optimization

arXiv:2610.19951v1 Announce Type: new Abstract: Agent skills adapt frozen models through editable external instructions. Revising several rules at once makes changes difficult to inspect, while judging each local edit only by its immediate score can discard useful intermediate states. We introduce AtomSearch, which keeps revision actions local while using subsequent skill states to guide search. Contrastive atomic editing links each primitive rule edit to failed and successful executions, a behavioral hypothesis, and an intended scope. Skill-State Tree Search (STS) evaluates short edit compositions and selectively retains them as executable states that can be revisited and extended. Outcome memory supplies later proposals with observed repair and regression statistics. We evaluate AtomSearch across four tasks and five target models. With deepseek-v4-flash, it exceeds SkillOpt on three of four tasks, including a 9.68-percentage-point gain on LiveMathematicianBench, and SkillOpt's final skills contain 2.3-19.7 times as many characters. In 67% of completed searches, the best validation state passes through an ancestor that was not highest-scoring at its depth. These results show how local rule edits can support the exploration of useful revision paths and yield compact skills, with additional offline evaluations used to explore alternative states.

Original source

This story was published by arXiv cs.CL and written by Jia Tong, Senyou Deng, Min Peng, Jianfeng Pan. SyncAI.news shows a preview; the complete article is on the publisher's site.

Read the full story on arxiv.org

Similar News