SkillSeek: Revisiting Agent Skill Retrieval at Marketplace Scale

Guanqun Yang, Wenlong Zhang, Tian Shi, Ping Wang

Stevens Institute of Technology · Independent Researcher

Published September 30, 2026 · on the feed October 1, 2026 · ▲ 6 · arXiv 2609.38822

AgentsRetrieval, memory & search Code arXiv ↗Hugging Face ↗

The abstract

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 times 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.

The Brief

2:39

A short podcast summary of the paper. Written and voiced by AI.

Transcript

SkillSeek. Revisiting Agent Skill Retrieval at Marketplace Scale. By Guanqun Yang and three others, from the Stevens Institute of Technology and Independent Researcher. Published on the thirtieth of September. Its code repository is public and real: about twenty source files.

Anthropic's Agent Skills package reusable procedural know-how for a language model agent into SKILL dot md directories. Open-source collections of them have grown past two hundred and thirty thousand skills, so the bottleneck is no longer writing skills but choosing among them. The standing answer has been to hand that choice to the agent: an LLM-mediated retrieval loop that rewrites queries and refines candidates inside the agent's decision loop, paying for language model tokens on every task. This paper's claim is that the standard information retrieval recipe does just as well, at essentially no extra cost.

The recipe is SkillSeek, an open-source two-stage skill retriever. A BGE-base bi-encoder feeds a small cross-encoder, and the whole thing is exposed over MCP. The comparison is a grid of four by eleven, crossing skill pool, backbone, and method, on the SkillsBench benchmark of eighty-nine tasks. Nothing in this retriever is new, and that is the point of the exercise. It is the standard two-stage arrangement from information retrieval, applied to skills, and it asks for no language model tokens to rewrite queries or refine candidates along the way.

Across that grid, SkillSeek reaches observed parity with the LLM-mediated loop of Liu and colleagues. Even plain bm25 on its own records a pass rate at or above their refined loop in three of the four settings. In the fourth, the small cross-encoder closes the remaining difference. The authors explain the pattern by a recall ceiling in the first stage. Cost moves the other way: total spend per trial falls from fifty-one point three zero US dollars to twenty-seven point five four, which lands within fifty cents of the baseline that uses no skills at all.

The authors bound the conclusion themselves. It holds under the SkillsBench tasks and the OpenHands harness they tested. Within that setting, the standard recipe is positioned as a strong default for retrieving agent skills, not as a replacement in every case. LLM-mediated retrieval remains a natural fit where deterministic methods fall short.

This is a paper that revisits a question rather than introducing a new kind of machinery, and its contribution is to put the standard recipe head to head with the agent-driven loop, on the same tasks and the same grid. At two hundred and thirty thousand skills, a reasonable instinct is that only an agent can choose well. The measured result points the other way, at least on this benchmark. A cheap retriever finds what the expensive loop finds, and using skills then costs barely more than not using them.

Paper Quest · 7 chapters · about 40 min

Play this paper

Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.

Chapter 1 🧩 · The problem

The skill shelves are overflowing. Finding the right one has become the hard part.

Open collections of agent skills have grown past 230,000 entries. Writing skills is no longer the bottleneck; picking the right ones for each task is.

The road ahead

  1. 1 · The problem ~6 min With hundreds of thousands of agent skills available, the hard part is choosing the right ones, and the usual way of choosing costs tokens on every task.
  2. 2 · What came before ~3 min
  3. 3 · The key idea ~9 min Treat skill selection as ordinary search: a fast bi-encoder shortlists skills, a small cross-encoder reranks them, and the agent fetches them over MCP with no LLM tokens.
  4. 4 · Choose your own research ~3 min
  5. 5 · Build the method ~8 min A query passes through a BGE-base bi-encoder, then a small cross-encoder, and the top skills return to the agent through an MCP tool.
  6. 6 · The experiment ~6 min You’ll guess: On the 89-task SkillsBench, how did plain bm25 alone compare with the LLM-refined retrieval loop of Liu et al.?
  7. 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Join free to play the whole quest ›

Free, with Google or an email address. Your stars and progress are kept.

KipQuest: the day’s AI research, as podcasts and quests. All papers Android app Privacy Contact Episodes are written and voiced by AI from each paper. Summaries can contain mistakes: the paper is the source.