arXiv AI

Step-Tagging: Toward controlling the generation of Language Reasoning Models through step monitoring

arXiv:2512. 14332v2 Announce Type: replace-cross Abstract: The field of Language Reasoning Models (LRMs) has been very active over the past few years with advances in training and inference techniques enabling LRMs to reason longer, and more accurately.

arXiv Computation and Language
Aug 28

TRACES: Tagging Reasoning Steps for Adaptive Cost-Efficient Early-Stopping

TRACES (Tagging Reasoning Steps for Adaptive Cost‑Efficient Early‑Stopping) is a lightweight framework that tags reasoning steps of large‑language models in real time, enabling adaptive, cost‑efficient early stopping during inference. By monitoring the types of steps generated, the method identifies when models shift their reasoning after arriving at a correct answer, allowing for interpretable stopping criteria. Experiments on mathematical reasoning benchmarks (MATH500, GSM8K, AIME) and knowledge benchmarks (MMLU, GPQA) show token reductions of 20–50% while preserving accuracy, with more conservative thresholds needed for harder tasks such as BeyondAIME and IMO AnswerBench.

By Yannis Belkhiter, Seshu Tirupathi, Giulio Zizzo, John D. Kelleher
arXiv Machine Learning
Aug 11

Are Latent Reasoning Models Easily Interpretable?

arXiv:2604. 04902v2 Announce Type: replace Abstract: Latent reasoning models (LRMs) have attracted significant research interest due to their low inference cost (relative to explicit reasoning models) and theoretical ability to explore multiple reasoning paths in parallel.

By Connor Dilgren, Sarah Wiegreffe
arXiv Computation and Language
Aug 24

Self-Speculation for Faster Reasoning Models

arXiv:2608.20359v1 Announce Type: new Abstract: Large language models (LLMs) are deployed for increasingly complex tasks involving planning and multi-step decision making, but high-quality performanc...

By Ravisri Valluri, Tung Nguyen, Aditya Grover
arXiv Computation and Language
Sep 1

Reasoning over Grammar: Can Synthetic Linguistic Reasoning Traces Enhance Low-Resource Machine Translation?

The paper explores whether structured linguistic reasoning traces can improve low‑resource machine translation by guiding large language models (LLMs). It proposes a pipeline that automatically generates step‑by‑step reasoning traces from Universal Dependencies treebanks, dictionaries, and grammar‑rule banks, and evaluates these traces in in‑context learning, supervised fine‑tuning, and reinforcement fine‑tuning on Xibe and Chintang. The results show that providing reliable reasoning traces at inference time significantly boosts translation quality, whereas using them as training data yields smaller, less consistent gains, indicating that LLMs can benefit from grammatical guidance but struggle to generate accurate analyses themselves.

By Renhao Pei, Yihong Liu, Sampo Pyysalo, Hinrich Sch\"utze, Shaoxiong Ji
arXiv AI
Sep 7

Harnessing the Reasoning Economy: A Survey of Efficient Reasoning for Large Language Models

The paper surveys efficient reasoning in large language models, contrasting fast intuitive (System 1) and slow deep (System 2) reasoning. It analyzes why System 2 is computationally costly yet more accurate, and why System 1 is efficient but less effective. The survey covers causes of inefficiency, patterns of reasoning behavior, and potential solutions to balance performance and computational budgets, offering actionable insights and an open‑source repository for ongoing research.

By Rui Wang, Hongru Wang, Boyang Xue, Jianhui Pang, Shudong Liu, Yi Chen, Jiahao Qiu, Derek Fai Wong, Heng Ji, Kam-Fai Wong
arXiv Machine Learning
Jun 16

Pushing the Boundaries of Natural Reasoning: Interleaved Bonus from Formal-Logic Verification

arXiv:2601. 22642v2 Announce Type: replace Abstract: Large Language Models (LLMs) show remarkable capabilities, yet their stochastic next-token prediction creates logical inconsistencies and reward hacking that formal symbolic systems avoid.

By Chuxue Cao, Jinluan Yang, Haoran Li, Kunhao Pan, Zijian Zhao, Zhengyu Chen, Yuchen Tian, Lijun Wu, Conghui He, Sirui Han, Yike Guo