One Feedback Pass Takes Skill-Chain Decomposition From 51% to 68% Accuracy
Notes on Compositional Skill Routing for LLM Agents: Decompose, Retrieve, and Compose (arXiv:2606.18051) — Xueping Gao · June 2026
Note published · written by SkillFed’s research pipeline from the paper above · how these notes are made
AI-assisted notes · reviewed by SkillFed Skill retrievalCompositional skill routing formalizes what happens when a query needs more than one skill: decompose it into atomic sub-tasks, retrieve a skill for each, then compose the results into an executable plan. SkillWeaver, the framework built to do this, has three parts — an LLM decomposer, a bi-encoder retriever indexed with FAISS, and a dependency-aware DAG planner that orders and parallelizes the resulting steps. To measure it, the authors built CompSkillBench: 300 compositional queries (150 easy/2-skill, 100 medium/3-skill, 50 hard/4-to-5-skill) run against 2,209 real skills pulled from the public Model Context Protocol (MCP) server ecosystem and sorted into 24 functional categories.
The headline result flips where most routing work spends its effort: retrieval isn't the weak link, decomposition is. Standard LLM decomposition gets the sub-task count right only 51.0% of the time (decomposition accuracy) and lands the correct skill category at rank 1 (category recall@1) just 34.2% of the time on the full 2,209-skill pool. Feed the retriever's own top candidates back into a second decomposition pass — Skill-Aware Decomposition (SAD) — and decomposition accuracy jumps to 67.7% in a single iteration; get the step count exactly right and category recall at rank 1 climbs to 41.2%. The gains hold even when whole categories or a fifth of the skill pool are withheld from retrieval (+35.6% and +23.2% relative decomposition-accuracy gains, respectively), and the full pipeline needs roughly 1,160 tokens of skill context per query versus ~884K for exposing the entire catalog — a cut of over 99%.
Key numbers
| Category recall@1, vanilla decomposition (2,209-skill pool) | 34.2% |
| Decomposition accuracy, before → after one SAD feedback pass | 51.0% → 67.7% |
| Context tokens per query vs. exposing the full catalog | ~1,160 vs ~884K (−99.9%) |
| LLM-Direct baseline: category recall@1 despite 90% decomposition accuracy | 21.1% |
| Benchmark scale | 300 queries / 2,209 MCP skills / 24 categories |
Skills related to this research
Related notes
- A 3.9M-parameter skill sequencer closes 80% of the gap to hand-picked "gold" skill sets →
- Skill Routing Loses 37-44 Points When It Can't See the Body →
- Even a Purpose-Built Reranker Nails the Full Skill Set Only 32% of the Time →
- A typed skill graph gives up just 3.5 retrieval points across a 10x library scale-up →
- Cut Skill Bodies 39%, Task Success Rises 2.8% →
- A skill graph beats context-stuffing: +25.55% reward, -56.72% tokens →
- Letting a robot invent its own practice tasks adds 20.6 points of task success →
- Compose agents from skills, not fixed roles: +2 points over the best topology-only baseline, only a 0.96-point dip when the skill library changes →
- Zero of 8 production agent systems verify skill-in-use →
References
- Xueping Gao. "Compositional Skill Routing for LLM Agents: Decompose, Retrieve, and Compose." arXiv:2606.18051 (2026).
- Zheng et al. "SkillRouter: Retrieve-and-Rerank Skill Selection for LLM Agents at Scale." arXiv:2603.22455 (2025).
- Yuan et al. "CRAFT: Customizing LLMs by Creating and Retrieving from Specialized Toolsets." ICLR (2025).
- Karpukhin et al. "Dense Passage Retrieval for Open-Domain Question Answering." EMNLP (2020).
- Johnson, Douze, and Jégou. "Billion-Scale Similarity Search with GPUs." IEEE Transactions on Big Data (2019).