arXiv cs.CL· Siheng Xiong, Ali Payani, Faramarz Fekri·· 11 小时前AI 评分34
用结构化多层级建模增强语言模型推理能力:MLR 方法
Enhancing Language Model Reasoning with Structured Multi-Level Modeling
AI 导读
研究者提出 Multi-Level Reasoning(MLR),将长链式推理重构为高层规划器与低层执行器交替的“规划—执行”两级随机过程,高层用轻量 LoRA 模块实现、低层复用基础模型。
正文 · 原文
Abstract:Inference-time scaling enhances a model's reasoning by extending its chain-of-thought (CoT). However, existing approaches typically rely on a single policy trained with outcome-reward reinforcement learning (RL), which often suffers from long-horizon plan failures where the implicit plan drifts from valid strategies, especially for small LMs with limited capacity. To address this, we propose Multi-Level Reasoning (MLR), which reformulates long-CoT generation as a two-level stochastic process. A high-level planner generates structured step descriptors specifying both the reasoning mode and the semantic subgoal. The low-level executor then produces detailed reasoning conditioned on these descriptors, forming an alternating plan--execute loop. To maintain scalability, we adopt a minimal design where the base model serves as the low-level policy and a lightweight LoRA module implements the high-level policy. For training, we observe that outcome-reward RL provides sparse and delayed feedback for long trajectories (e.g., several thousand tokens), hindering credit assignment. We therefore introduce iterative Step-DPO, a process-level preference optimization scheme that leverages Twisted Sequential Monte Carlo (TSMC) to provide scalable stepwise supervision. This yields more effective training, improved stability, and higher accuracy. Extensive experiments on challenging math, science, and logical reasoning benchmarks show that, under the same reduced data budget (10% SFT and 5% preference relative to the DeepSeek-R1 distillation setup), MLR outperforms both SFT-based distillation and strong RL/preference-optimization baselines across multiple base models and tasks. Moreover, MLR exhibits slower performance degradation on long-horizon reasoning, demonstrating stronger robustness under extended CoT generation.
| Comments: | ICLR 2026 |
| Subjects: | Computation and Language (cs.CL) |
| Cite as: | arXiv:2611.00616 [cs.CL] |
| (or arXiv:2611.00616v1 [cs.CL] for this version) | |
| https://doi.org/10.48550/arXiv.2611.00616 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Siheng Xiong [view email]
[v1]
Sat, 31 Oct 2026 04:33:35 UTC (414 KB)
来源:arXiv cs.CL · arxiv.org