Large language model (LLM) agents increasingly rely on external skills, but routing user requests over large skill registries is difficult because many skills are functionally redundant while complex tasks often require complementary skill sets. Existing skill routers typically rank candidates independently by query relevance, which can waste context budget on redundant skills. We propose Diverse Skill Routing (DSR), a diversity-aware reranking framework that uses a Determinantal Point Process to balance relevance and non-redundancy. DSR introduces a query-residual diversity kernel that penalizes redundant skill overlap while reducing penalties caused only by shared query relevance. On the SkillRouter benchmark, DSR improves recall and full coverage over a strong pointwise reranking baseline, with larger gains on multi-skill queries. These results suggest that skill routing should be treated not only as relevance ranking, but also as complementary set selection.
Figures & tables
Recall
Full Coverage
Method
@10
@20
@50
@10
@20
@50
All queries (75)
SkillRouter
.705
.754
.754
.520
.560
.560
DSR
.712
.768
.808
.527
.573
.633
Multi-skill (51)
SkillRouter
.659
.704
.704
.424
.458
.458
Table 1: Full-pipeline results on the SkillRouter benchmark. Both methods use SR-Emb-0.6B retrieval and SR-Rank-0.6B relevance scores. SkillRouter applies pointwise reranking, while DSR applies query-residual DPP selection. For SkillRouter, Recall@50 and Full Coverage@50 equal the corresponding @20 values because its released output is truncated at 20. Bold indicates the best result in each column.
Kernel
Quality
R@10
Multi-FC@10
Pointwise baseline
–
Reranker quality
.705
.424
Standard cosine kernel
Cosine
Embedding quality
.540
.178
Cosine
Reranker quality
.534
.254
Query-residual kernel
Table 2: Ablation study of DSR design choices. All DSR variants use SR-Emb-0.6B retrieval over the top 50 candidates. Embedding quality uses normalized query-skill embedding similarity as qi(x) , while reranker quality uses SR-Rank-0.6B scores. R@10 is averaged over all queries; Multi-FC@10 is Full Coverage@10 on multi-skill queries.
Single-skill
Multi-skill
Method
R@10
FC@10
R@10
FC@10
Top- k retrieval
.875
.875
.630
.381
LLM ranker
.719
.719
.616
.331
SkillRouter
.875
.875
.659
.424
DSR
.875
.875
.668
.432
Table 3: Comparison of ranking and selection strategies for single-skill and multi-skill queries. Top- k retrieval ranks skills by embedding similarity without reranking. The LLM ranker uses Qwen3-8B in a zero-shot reranking setting. SkillRouter uses the learned SR-Rank-0.6B pointwise reranker. DSR applies diversity-aware selection using reranker quality and the query-residual kernel.
MRR
Recall
Full Coverage
Method
@10
@20
@50
@10
@20
@50
@10
@20
@50
All queries (75)
SkillRouter
.788
.790
.790
.705
.754
.754
.520
.560
.560
DSR
.784
.785
.785
.712
.768
.808
.527
.573
.633
Multi-skill queries (51)
SkillRouter
.792
.793
.793
.659
.704
.704
.424
.458
.458
Table 4: Full-pipeline results with MRR included as an early-precision diagnostic. Both methods use SR-Emb-0.6B retrieval and SR-Rank-0.6B relevance scores. The main paper focuses on Recall and Full Coverage because multi-skill routing requires recovering complete skill sets.
Reusable skills let LLM agents package task-specific procedures, tool affordances, and execution guidance into modular building blocks. As skill ecosystems grow to tens of thousands of entries, exposing every skill at inference time becomes infeasible. This creates a skill-routing problem: given a user task, the system must identify relevant skills before downstream planning or execution. Existing agent stacks often rely on progressive disclosure, exposing only skill names and descriptions while hiding the full implementation body. We examine this design choice on a SkillsBench-derived benchmark with approximately 80K candidate skills, targeting the practically important setting of large skill registries with heavy overlap. Across representative dense and reranking baselines on this setting, hiding the skill body causes a 37-44 percentage point drop in routing accuracy. Stronger controls show that the missing signal is body-resident rather than a simple length artifact: body-distilled descriptions recover part of the gap, but remain 7-21 points below direct all-field routing, while a metadata-only encoder trained with the same data remains 14.0 points below its all-field counterpart. Motivated by this finding, we present Skillrouter, a compact 1.2B body-aware retrieve-and-rerank pipeline. Skillrouter achieves 74.0% Hit@1 on our benchmark -- the strongest average top-1 routing performance among the baselines we evaluate -- while using 13× fewer parameters and running 5.8× faster than the strongest base pipeline. The ranking gains further generalize to a supplementary benchmark independently constructed from three skill sources. In a complementary end-to-end study across four coding agents, routing gains transfer to improved task success, with larger gains for more capable agents.
The rapid expansion of reusable skill repositories makes skill routing a critical capability for large language model (LLM) agents. Existing methods treat routing as task-only semantic matching. However, when users with incompatible constraints issue an identical request, this assumption conflates task relevance with skill suitability: a task-only router can select a semantically plausible skill that is unsuitable for the requesting user. To expose this failure mode, we formulate personalized skill routing as profile-conditioned retrieval, in which relevance depends jointly on the task and the user profile. We first introduce a profile-counterfactual benchmark, in which the task is held fixed while changes in the user profile induce changes in the reference skill. We further construct paired counterfactual supervision and propose SkillFeed, a progressive retrieve-and-rerank framework that first establishes task--skill alignment and then learns profile-conditioned discrimination. By retrieving body-level evidence and reranking semantically similar but profile-conflicting candidates, SkillFeed identifies skills that satisfy both task requirements and user constraints. On SkillFeed-Bench, SkillFeed attains 75.1% top-1 retrieval accuracy, a 23.1-point improvement over the corresponding pretrained routing baseline. Adding profile conditioning yields a 35.1-point gain on queries where user profile changes the reference skill. This contrast shows that user profiles are most consequential precisely when they change skill suitability. Our website is publicly available at http://www.aiskillfeed.com .
Tianle Wang, Yanghe Zou, Xiang Liu +3
College of Software Engineering, Southeast University · School of Computer Science and Engineering, Southeast University · Department of Computer Science and Engineering, The Chinese University of Hong Kong +1
Anthropic's Agent Skills package reusable procedural know-how for an LLM agent into SKILL.md directories, and open-source aggregations have grown past 230,000 skills, making selection rather than authoring the bottleneck. The standing answer in the literature outsources selection to the agent itself: an LLM-mediated retrieval loop that rewrites queries and refines candidates inside the agent's decision loop, paying LLM tokens on every task. We present SkillSeek, an open-source two-stage skill retriever built from the standard IR recipe (a BGE-base bi-encoder feeding a small cross-encoder, exposed over MCP). Across a 4×11 grid of pool, backbone, and method on the 89-task SkillsBench benchmark, SkillSeek reaches observed parity with the LLM-mediated loop of Liu et al. at essentially no extra cost: plain bm25 alone records a pass rate at or above their refined loop on three of four settings, and a small cross-encoder covers the remaining difference on the fourth. A first-stage recall ceiling explains the pattern, and total per-trial spend drops from USD 51.30 to USD 27.54 (within fifty cents of the no-skill baseline). Under the SkillsBench tasks and OpenHands harness we tested, this positions the standard IR recipe as a strong default for agent-skill retrieval, with LLM-mediated alternatives a natural fit for cases where deterministic methods fall short.
Guanqun Yang, Wenlong Zhang, Tian Shi +1
Stevens Institute of Technology, Hoboken, NJ, USA · Independent Researcher