AIDB Daily Papers
LLMが言語を創り出す:効率的なマルチエージェント推論のための記号コミュニケーション
※ 日本語タイトル・ポイントはAIによる自動生成です。正確な内容は原論文をご確認ください。
ポイント
- LLMエージェントが自律的にコンパクトな記号言語を生成・進化させ、推論タスクに活用するフレームワークを提案した。
- 自然言語による冗長な思考過程を効率的な記号プロトコルに置き換えることで、推論精度とトークン効率のトレードオフを最適化できる点が新しい。
- 標準的なChain-of-Thoughtと比較して、精度を維持しつつ生成トークン数を3〜6倍削減することに成功した。
Abstract
Chain-of-Thought (CoT) improves large language models (LLMs) on difficult reasoning tasks, but it often incurs long natural-language rationales that are poorly aligned with efficient machine reasoning. We propose Communicative Language Symbolism Routing (CLSR), a test-time framework in which multiple LLM agents autonomously invent, evolve, and share compact Language Symbolism Frameworks (LSFs), while a latent-free router adaptively selects and composes these languages per query to optimize the accuracy-token trade-off. Unlike prompt optimization that refines surface instructions, CLSR treats each LSF as a reusable symbolic protocol with compact symbols, usage rules, and a message-passing contract, and improves it through an evolutionary loop driven by correctness and token cost. At inference time, the router may invoke a single low-cost LSF call, ensemble multiple LSFs, or execute a multi-round LSF composition protocol on harder queries. Across challenging benchmarks, CLSR reduces latency-oriented generated token completion by 3∼6× compared to standard CoT while maintaining accuracy. We further derive an information-theoretic lower bound on token cost under arbitrary symbolism and show that, under an interpreter-realizability premise, multi-round LSF protocols conditionally subsume program-execution pipelines. Code is publicly available (this https URL).
Paper AI Chat
この論文のPDF全文を対象にAIに質問できます。
質問の例: