AIDB Daily Papers
SkillPager:意味的ノード検索によるクエリ適応型スキル内ナビゲーション
※ 日本語タイトル・ポイントはAIによる自動生成です。正確な内容は原論文をご確認ください。
ポイント
- 本研究では、LLMエージェントが長大な手順文書を利用する際の課題に対し、意味的ノード検索による効率的なコンテキスト選択手法を提案した。
- 提案手法SkillPagerは、文書を意味的ノードに解析し、クエリに応じて最小限かつ実行に必要な情報を抽出することで、トークン消費を大幅に削減する。
- 実験の結果、SkillPagerは既存手法と比較して同等以上のコンテキストの十分性を保ちつつ、トークン数を約47%削減し、効率的なスキル実行を可能にした。
Abstract
Skill-based LLM agents increasingly rely on long procedural documents, but full-document prompting wastes tokens and dilutes information critical to execution. We study this setting as intra-skill retrieval, where the goal is to select a minimal, execution-sufficient context from a known skill document given a query. We present SkillPager, a two-stage framework that parses each Markdown skill into typed semantic nodes offline and leverages Maximal Marginal Relevance (MMR) to perform global, query-conditioned node selection online. On a benchmark of 395 skills and 1,975 queries, SkillPager achieves 78.89% LLM-judged context sufficiency, compared to 82.23% for the exhaustive full-document baseline, while reducing prompt tokens by 47.04%. A granularity ablation shows that applying the same retrieval algorithm to raw fixed-length chunks reaches a comparable 81.77% sufficiency but increases token cost by 28.81%, demonstrating that efficiency gains are driven by typed semantic granularity rather than the retrieval algorithm alone. Among graph-based baselines, SkillPager outperforms the strongest baseline by a margin of 12.16%. Further ablations show that supporting content is most effective when retained in the candidate pool and selected adaptively rather than removed by static heuristics. These results identify typed intra-document retrieval as a distinct access problem for skill-based agents.
Paper AI Chat
この論文のPDF全文を対象にAIに質問できます。
質問の例: