arXiv AI

DoubtLess: Training-Free Contrastive Decoding for Efficient Reasoning

arXiv AI
Aug 11

Reason Wide, Not Deep: Amortizing the Reasoning Premium into Distilled Skills

arXiv:2608. 07885v1 Announce Type: new Abstract: Reasoning modes of language models outperform their non-reasoning counterparts on multi-step agentic tasks, but pay a 3-6x premium in output tokens on every episode -- much of it spent re-deriving procedures that are shared across episodes of the same domain.

By Agamdeep Singh, Srishti Gautam, Priyanshu Gupta, Nikita Mehrotra, Tanmay Bakshi, Sumit Gulwani
arXiv AI
Jun 30

Reconsidering Overthinking: Penalizing Internal and External Redundancy in CoT Reasoning

arXiv:2508. 02178v3 Announce Type: replace Abstract: Large reasoning models (LRMs) often exhibit overthinking, producing verbose Chain-of-Thought (CoT) traces that increase inference cost and obscure the underlying reasoning process.

By Taihang Zhen, Jialiang Hong, Kai Chen, Guang Yang, Junlan Feng, Wenpeng Zhu, Jing Huo, Yang Gao, Depeng Wang, Haitao Wan, Xi Yang, Fanyu Meng, Yuyao Zhang, Ji Qi, Xiangyu Zhou
arXiv AI
Oct 5

Efficient Reasoning Training Does Not Always Harm CoT Faithfulness and Monitorability

The paper investigates how training large language models to use fewer tokens in chain-of-thought (CoT) reasoning impacts the faithfulness and monitorability of the generated explanations. Three efficiency methods—fixed generation budget, per-example length target, and group-relative length reward—were applied during fine‑tuning, and the resulting models were evaluated on how well their CoT reflects decision processes and whether it signals changes due to input interventions. Results show that while faithfulness generally decreases because models become less consistent, monitorability remains relatively robust, with models still indicating the influence of input changes even when CoT is shortened.

By Samuel Lewis-Lim, Xingwei Tan, Mario Sanger, Zhixue Zhao, Nikolaos Aletras
arXiv AI
Aug 21

Learning When to Think: Adaptive Reasoning for Test-Time Compute Allocation

arXiv:2608. 20256v1 Announce Type: new Abstract: Reasoning language models trained with reinforcement learning typically operate under a fixed token budget rather than an explicitly adaptive one, which can lead to over-computation on easy problems and insufficient computation on difficult ones.

By Gijs Kassenaar, Zhao Yang, Vincent Fran\c{c}ois-Lavet