AIDB Daily Papers
LLMの適応的複雑性推論のための階層的フレームワーク:経済的に思考する
※ 日本語タイトル・ポイントはAIによる自動生成です。正確な内容は原論文をご確認ください。
ポイント
- LLMの推論能力を向上させるため、計算資源をタスクやステップの要求に応じて最適に配分する階層的適応型バジェッター(HAB)を提案した。
- 従来の効率化手法が均一な圧縮を行うのに対し、本研究は問題間およびステップ内の推論複雑性の不均一性を考慮し、より経済的な思考を促す点が重要である。
- 実験の結果、HABは標準的なCoTよりも高い精度を達成しつつトークン使用量を削減し、性能と効率のトレードオフを改善した。
Abstract
Chain-of-Thought (CoT) has significantly enhanced LLM reasoning, yet often incurs substantial computational overhead due to "overthinking": generating excessively long rationales without commensurate accuracy gains. Existing efficiency methods typically apply uniform compression, which overlooks a critical observation that reasoning complexity is heterogeneous at two distinct granularity: across different problems and within individual reasoning steps. This motivates our principle of Thinking Economically: intelligently allocating computational resources based on intrinsic task and step demands rather than pursuing uniform brevity. We propose Hierarchical Adaptive Budgeter (HAB), a training framework that operationalizes this principle through coarse-to-fine budgeting. At the inter-step level, HAB predicts the optimal reasoning depth for each problem. At the intra-step level, HAB learns step-specific token budgeting signals from PPL-derived step comparisons and an adaptive Pareto optimization objective that captures the local quality-efficiency trade-off, while a Fisher Information-based pruner further provides fine-grained training-time guidance, thereby encouraging the generator to internalize more economical reasoning patterns. Experiments on GSM8K and MATH500 show that HAB not only surpasses standard CoT in accuracy but also reduces token usage, achieving a stronger performance-efficiency trade-off than the compared baselines.
Paper AI Chat
この論文のPDF全文を対象にAIに質問できます。
質問の例: