跳到主要导航 跳到搜索 跳到主要内容

RouteGoT: Node-Adaptive Routing for Cost-Efficient Graph of Thoughts Reasoning

  • Yuhang Liu
  • , Ruijie Wang
  • , Yunlong Chu
  • , Bing Hao
  • , Yumeng Lin
  • , Shengzhong Liu
  • , Minglai Shao*
  • *此作品的通讯作者
  • School of New Media and Communication
  • Tianjin University
  • Shanghai Jiao Tong University

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

摘要

Large Language Models (LLMs) excel at multi-step reasoning, yet increasing the structural complexity of inference does not consistently improve system-level returns. Methods such as Tree of Thoughts (ToT), Graph of Thoughts (GoT), and Adaptive Graph of Thoughts (AGoT) can boost accuracy on some benchmarks, but often introduce substantial overhead in token consumption and latency, and their gains can be unstable across task distributions-sometimes underperforming simpler Chain-of-Thought (CoT) or direct input-output prompting (IO). We attribute this inefficiency to stage-wise and node-wise heterogeneity inside GoT-style reasoning pipelines: high-quality planning and final synthesis are globally coupled and typically benefit from strong models, whereas many intermediate subtasks are localized and can be solved accurately by lighter models with far fewer tokens. Motivated by these observations, we propose RouteGoT, a budget-controllable, node-adaptive routing framework for graph-structured reasoning. RouteGoT performs data-driven in-graph routing by prioritizing strong models for planning and synthesis, while dynamically allocating lightweight models and cost-effective strategies to leaf subtasks based on learned success and budget signals. It further integrates explicit budget constraints into a global inference scheduler to control graph expansion (depth/branching) under a user-specified token budget, enabling predictable performance-cost trade-offs. Experiments across reasoning, retrieval, and multi-hop QA benchmarks show that RouteGoT matches or improves accuracy while substantially reducing token usage; specifically, it achieves an average 8.1 percentage points accuracy improvement and 79.1% output token reduction compared to AGoT. Furthermore, RouteGoT outperforms existing routing baselines by maintaining a superior cost-accuracy trade-off, demonstrating improved robustness under varying budget targets and task distributions. Our code is available at https://github.com/karmaisacat-13/RouteGoT.

源语言英语
主期刊名KDD 2026 - Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2
出版商Association for Computing Machinery
页3342-3353
页数12
ISBN(电子版)9798400722592
DOI
出版状态已出版 - 8 8月 2026
活动32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1, KDD 2026 - Jeju Island, 韩国
期限: 9 8月 2026 → 13 8月 2026

丛书

姓名Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
卷2-B
ISSN(印刷版)2154-817X

会议

会议32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1, KDD 2026
国家/地区韩国
市Jeju Island
时期9/08/26 → 13/08/26

学术指纹

探究 'RouteGoT: Node-Adaptive Routing for Cost-Efficient Graph of Thoughts Reasoning' 的科研主题。它们共同构成独一无二的学术指纹。

引用此