arXiv:2605.29270cs.AI2026-05

用大模型自建服务分类树,高效检索海量服务。

Indexing the Unreadable: LLM-Native Recursive Construction and Search of Service Taxonomies

论文配图:Indexing the Unreadable: LLM-Native Recursive Construction and Search of Service Taxonomies
图 1 · 摘自论文原文
  • 大模型自动生成分层服务目录,按需逐层查询。
  • 检索准确率提升20点以上,提示词消耗降为1/9。
  • 适合需要快速发现复杂服务的智能体系统。

互联网代理时代(IoA)正在形成:大模型代理需通过不断增长的MCP服务器、A2A端点、可复用技能及其他大模型可调用服务来完成用户目标。但大模型在长文本上下文中存在结构性缺陷:有效上下文是稀缺资源,无法随服务数量扩展。将数千个服务描述拼接进提示词会超出上下文窗口,即使窗口足够大,模型也普遍忽略中间信息(即‘迷失于中间’现象)。这本质上是服务发现中的上下文管理问题。为此,我们提出一种大模型原生的渐进式披露方案及其具体实现A2X(Agent-to-Anything服务发现):一个由大模型驱动的流水线,自动将注册服务组织成层次化分类体系,并在查询时逐层遍历,确保每次大模型调用仅面对与用户查询高度相关的候选集。该方法将有效上下文稀缺性与注册规模解耦,显著降低令牌消耗并提升检索精度。相比全量上下文输入,A2X在提示词消耗仅为1/9的情况下,命中率提升6.2点;相比当前最优开源基于嵌入的基线,命中率提升超过20点。

原文摘要 · Abstract (English)

The era of the Internet of Agents (IoA) is taking shape: LLM agents are expected to fulfill user goals by orchestrating fast-growing populations of Model Context Protocol (MCP) servers, Agent-to-Agent (A2A) endpoints, reusable skills, and other LLM-callable services. Yet LLMs face a structural mismatch with this regime: effective context is a scarce resource that does not scale with the number of services. Concatenating thousands of service descriptions into a prompt overflows the context window, and even when the window is large enough, models systematically under-attend to information in the middle of long inputs, the well-documented Lost-in-the-Middle phenomenon. This is fundamentally a question of context management for service discovery. To address this, we propose an LLM-native progressive-disclosure scheme and its concrete instantiation, A2X (Agent-to-Anything service discovery): an LLM-driven pipeline that automatically organizes the registered services into a hierarchical taxonomy and walks it layer by layer at query time, so that every LLM call sees only a small candidate set highly relevant to the user query. This decouples effective-context scarcity from registry size and significantly reduces token consumption while improving retrieval accuracy. Compared to full-context dumping, A2X achieves a 6.2-point Hit Rate gain at one-ninth the prompt-token cost; compared to the state-of-the-art open-source embedding-based baseline, A2X improves Hit Rate by more than 20 points.

服务发现大模型分类树上下文管理

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。