Agent skills encapsulate reusable procedural knowledge that enables LLM agents to perform tasks, and they can be improved automatically using trajectories from interactions with the environment. This is the classic problem of skill evolution. Existing approaches predominately follow a linear evolution paradigm, in which updates are sequentially applied to the latest skill-library version. As a result, they inevitably fall into local optima, leaving many promising evolution paths unexplored. We propose SkillVine, an automatic skill-evolution framework that formulates skill evolution as a graph search problem and employs a branching exploration strategy. Equipped with a trunk-branch collaborative searching mechanism, an intelligent parent-node selector, and an adaptive-granularity update rule, SkillVine achieves a balance between exploration and exploitation. We evaluate SkillVine on 5 benchmarks with two LLMs. Results show that SkillVine discovers better skill-library versions along branches than along the linear trunk and achieves the best test performance in nine of ten benchmark-model combinations.
Figures & tables
Figure 1: Overview of SkillVine. SkillVine organizes skill library versions into a graph, maintains a continuous trunk, selects branch nodes based on quality, exploration, and complementarity, and adapts branch-update granularity based on whether the trunk update is accepted.
Algorithm 1 SkillVine
Model
Method
Benchmark Score
Spreadsheet
LiveMath
SearchQA
OfficeQA
TABVERSE
DeepSeek-V4 -flash
Linear
48.04
43.40
73.36
47.30
63.88
Best-of-3
64.41
50.00
73.14
45.27
64.49
Random
53.38
46.23
74.14
52.70
64.08
SkillOpt
62.99
47.17
73.50
46.62
63.47
SkillOpt-Lite
66.19
50.48
73.14
37.84
61.84
Table 1: Main results across benchmarks. Higher values indicate better performance.
Model
Ablation
Benchmark Score
Spreadsheet
LiveMath
SearchQA
OfficeQA
TABVERSE
w/o Selector & AGBU
53.38
46.23
74.14
52.70
64.08
w/o Selector
67.26
46.23
72.93
47.30
63.47
w/o AGBU
65.84
50.00
74.57
52.03
63.27
w/o Comp
71.53
53.77
73.36
55.41
60.82
DeepSeek-V4 -flash
SkillVine
71.53
53.77
74.43
55.41
67.35
Table 2: Ablation study results. Higher values indicate better performance.
Figure 5
Figure 5: Impact of system parameters on validation and test scores with DeepSeek-V4-flash. Panels (a) and (b) use SpreadsheetBench; panel (c) includes both SpreadsheetBench and LiveMath.
Table 3: Evolution paths to the final best nodes across the ten benchmark–model combinations. Each vXXXX is a skill library version number within that run. M:vXXXX denotes a node on the trunk; D:vXXXX denotes a side-branch node generated using a discovery selector; R:vXXXX denotes a side-branch node generated using a refinement selector. † means that AGBU rejects at least one edit during the update.
Case 1: DeepSeek-V4-flash × SpreadsheetBench
Version Node
Skill Capability
Unique / Lost
Typical Validation Samples
Final Gain
Trunk M:v0002 Branch R:v0007
R:v0007 adds Python-based calculation beyond M:v0002 ’s workbook inspection and preservation. M:v0002 rules: Inspect headers and cell types; read cached formula values while preserving the workbook. R:v0007 rules: Compute in Python and write values directly; infer the intended operation from the actual table when the supplied formula is flawed.
M:v0002 0 / 7 R:v0007 7 / 0
10747: Two-key profit lookup M:v0002 : None (fail) R:v0007 : -10600 (pass) 51556: Conditional average M:v0002 : None (fail) R:v0007 : 82 (pass) The branch also solves all 21 examples solved by the trunk.
Final best D:v0030 outperforms the best trunk M:v0028 by 20.51 on validation and 23.49 on test.
Case 2: DeepSeek-V4-flash × SearchQA
Version Node
Skill Capability
Unique / Lost
Typical Validation Samples
Final Gain
Trunk M:v0031 Branch D:v0010
D:v0010 handles wordplay and answer forms missed by M:v0031 ; M:v0031 better resolves associated entities in the examples shown. M:v0031 rule: For a bare entity name, identify the associated category or relationship from context. D:v0010 rules: Match the source answer form; for word transformations, return both the original and transformed terms.
M:v0031 5 / 9 D:v0010 9 / 5
“Adam Levine” M:v0031 : Maroon 5 (pass) D:v0010 : Adam Levine (fail) Holes on postage stamps M:v0031 : perforation (fail) D:v0010 : perforations (pass) Hawaiian wreath becoming a sheltered area M:v0031 : lee (fail) D:v0010 : lei & lee (pass)
Final best R:v0187 outperforms the best trunk M:v0134 by 5.00 on validation and 1.07 on test.
Appendix
Table 4: Two examples of selected complementary nodes.
Proposed rule: Return the full cell text, such as “Middelkerke, Belgium”, rather than one part. Result: The update included this rule. It lost three previously solved samples and only gained two: 45/70 → 44/70 ( −1.43 ), so it was rejected.
AGBU kept one edit and rejected two . The kept edit selects the correct column and computes durations from date ranges: 47/70 → 49/70. An edit with the same full-cell rule then reduced the score to 43/70 ( −8.57 ), so AGBU rejected it.
The accepted child R:v0007 † improved over D:v0004 : 47/70 → 49/70, +2 samples ( +2.86 ).
Proposed rule: Shorten names: use “Webster” instead of “Noah Webster” and “the Colorado” instead of “Colorado River”. Result: The update included this rule. The score fell from 152/200 to 148/200 ( −2.00 ), so it was rejected.
AGBU kept two edits and rejected two . An edit with the same name-shortening rule reduced the score from 147/200 to 141/200 ( −3.00 ), so it was rejected. The kept edits select the specific answer type and use “&” for paired answers such as “Nina & Pinta”. Together, they raised the score to 151/200.
The accepted child D:v0066 † improved over M:v0002 : 147/200 → 151/200, +4 samples ( +2.00 ).
Appendix
Table 5: Two examples of harmful edits rejected by AGBU.
Figure 6: Evolution path of DeepSeek-V4-flash on SpreadsheetBench. Nodes are labeled with their version numbers and validation scores. Gray dashed nodes denote rejected candidate versions. Blue arrows denote accepted trunk updates, while orange and green arrows denote accepted side-branch updates using the discovery and refinement selectors, respectively. † marks updates for which AGBU rejects at least one edit.
Skill documents are becoming the default adaptation surface for frozen large language model (LLM) agents, but current skill generators face two key limitations. First, humans and different LLMs differ in how they organize procedural knowledge and approach task solving. Skills authored from a human or single-model perspective may therefore fail to align with the reasoning behaviors of other backbones, limiting cross-model generalization. Second, sequential skill descriptions inadequately represent procedures with parallel branches and explicit dependencies, while existing skill optimizers primarily operate on prose and lack explicit support for graph-structured skill evolution. We introduce MultiEvoSkill, a skill-optimization framework comprising three core components: 1) Skill compiler casts the skill as a typed graph with tailored operators, producing a compact, informative representation with explicit procedural topology; 2) Heterogeneous agent system proposes revision advices using collective intelligence, where minimal and informative issues are identified based on multiple sets of experiences. 3) Structure-aware debate and evolution mechanism organizes candidate edits into a heterogeneous graph, resolves them under dependency and importance constraints, and distills the collective proposal into the artifact. Multi-dimensional gating ensures the information gain and topological correctness of each evolution. Optimal skills are then obtained when the system converges at a consistent state. Various experiments and ablations against SOTA methods validate the effectiveness and generalization of MultiEvoSkill.
Kounianhua Du, Jianxing Liu, Ruoshui Shan +4
Shanghai Jiao Tong University Shanghai, China · Purdue · Tencent
Although agent skills equip LLMs with reusable procedural knowledge, manual maintenance suffers from high costs, unscalability, and misalignment. Real-world deployments thus require autonomous, on-demand skill evolution at test time, constrained by limited interaction budgets and a lack of training or validation sets. This setting introduces a severe sparse reward challenge, where outcomes conflate multiple latent failure causes. Under such ambiguity, existing methods that greedily refine a single incumbent skill are particularly vulnerable to an exploitation trap, allowing early misdiagnoses to exhaust limited trials along unproductive trajectories. To address this, we introduce SkillHEX, a closed-loop framework coupling hypothesis-driven self-verification with evidence-guided tree search. SkillHEX translates falsifiable failure hypotheses into executable tests, producing diagnostic evidence as dense reward without additional environment attempts. This evidence guides a search over persistent skill-revision branches, dynamically balancing the exploitation of supported edits with the exploration of plausible alternatives. Evaluated on 87 tasks from SkillsBench, SkillHEX outperforms existing self-evolving methods and achieves an average pass rate of 55.9% and 57.9% using GPT-5.3-Codex and Claude Opus 4.7 under a five-iteration budget, respectively.
Yuru Feng, Yaoqi Chen, Beidi Zhao +7
Microsoft · University of California, San Diego · University of Science and Technology of China +1
Agent skills provide a lightweight way to adapt LLM agents to specialized domains by storing reusable procedural knowledge in structured files. However, whether downloaded from third parties or self-generated, these skills are often unreliable, incomplete, or outdated. Existing skill-evolution methods often address these deficiencies through heuristic reflections without an explicit optimization formulation. In this paper, we propose SkillGrad, a gradient-descent-inspired framework for optimizing agent skills. SkillGrad treats the skill package as a structured parameter to optimize in a gradient descent fashion: task executions provide trajectory-level loss evidence, automatic diagnoses then provide text-based gradients that indicate the correction directions. To stabilize optimization across iterations, a momentum agent accumulates recurring diagnostic patterns into a persistent memory overlay. Finally, an LLM-based patcher executes the parameter update by applying layer-aware edits to the skill package. Evaluated on SpreadsheetBench Verified and WikiTableQuestions, SkillGrad consistently outperforms training-based skill evolution baselines across two backbone LLMs, improving over the strongest training-based baseline by 6.7 percentage points on average. Ablations further show that momentum and contrastive diagnosis both contribute to the final skill quality.
Hanyu Wang, Yifan Lan, Bochuan Cao +2
College of Information Sciences and Technology The Pennsylvania State University University Park, PA, USA