Pith. sign in

REVIEW 4 major objections 6 minor 1 cited by

When Can Large Reasoning Models Save Thinking? Mechanistic Analysis of Behavioral Divergence in Reasoning

T0 review · 4 major / 6 minor · reviewed 2026-08-07 · deepseek-v4-flash

Pith's one-line read Prompted to save thinking, a reinforcement-learning-trained reasoning model splits into three distinct modes: skipping thought cuts output length drastically but sacrifices accuracy, while re-engaging in thinking keeps accuracy with…

desk verdict The behavioral taxonomy and the NT accuracy collapse are solid and useful; the mechanistic story is correlational and over-claimed, but the paper deserves a serious referee after revision. read the letter →

arxiv 2505.15276 v1 pith:6IULY3BD submitted 2025-05-21 cs.AI cs.CL

classification cs.AIcs.CL
keywords largereasoningmodelsoverthinkingthinkingmodesattentionanalysispromptefficiencyreinforcementlearningQwQ-32Bchain-of-thought
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper tries to establish why an RL-trained reasoning model like QwQ-32B responds inconsistently when told to save thinking. When the model is given a pre-filled thinking segment ending in '', it sometimes skips further thought, sometimes thinks explicitly again, and sometimes thinks without closing the tag. By examining internal softmax confidence at the token and layer-wise attention patterns, the paper argues that these three modes correspond to distinct internal states that emerge before the first answer token is generated. The practical stakes are efficiency versus reliability: skipping thinking saves over 99% of output tokens but collapses accuracy, while explicit rethinking preserves or even improves accuracy while reducing output length. The paper concludes that current RL training has not produced a stable internal control signal for deciding when thinking is done, so adaptive methods are needed.

What carries the argument

The organizing object is the three-mode taxonomy of NT, ET, and IT. The analysis is carried by three internal measurements: softmax confidence metrics (top-1 probability, entropy, and difference from the second-best candidate) on the prediction of the </think> token after the pre-filled segment; layer-wise attention activation vectors summarized with PCA and a Davies-Bouldin clustering index; and attention from the first generated token to the 'user' role token and to prompt sections. These measurements show that the behavioral split correlates with internal states that are visible before any new token is produced, and that the divergence between modes appears early in the network.

What would settle it

An intervention study would settle the causal question: if early-layer attention is the cause, steering representations away from the pre-filled thinking section toward the user token before the first generated token should flip NT samples into ET or IT behavior. If mode rates do not move under such activation steering, the early attention patterns are not the causal mechanism, even though the behavioral taxonomy and performance differences could remain true.

Watch

Extended reading notes

Core claim

The central discovery is that when QwQ-32B receives a pre-filled thinking prompt, its behavior separates into three modes: no thinking (NT), explicit thinking (ET), and implicit thinking (IT). At the moment the model predicts the </think> token that would end the pre-filled segment, NT questions show higher top-1 probability, lower entropy, and a larger gap to the second-best token, indicating the model is 'ready' to answer directly. Layer-wise attention activations between NT and ET diverge sharply from around layer 5 onward, and NT samples concentrate attention on the pre-filled thinking section rather than on the user's question. Behaviorally, NT shrinks output length by over 99% but drops accuracy from 94.09% to 37.76% on GSM8K and from 99.15% to 52.54% on MATH500; ET, by contrast, cuts output length by roughly 13-33% while preserving or slightly exceeding baseline accuracy. The paper's claim is that the mode is not a formatting artifact but an early, sustained internal decision about whether the prompt's 'thinking is finished' signal should be trusted.

Load-bearing premise

The load-bearing premise is that the early-layer attention divergence and </think>-token confidence are causes of the mode decision rather than effects or correlates of it; the paper observes correlations and clustering but performs no intervention to establish that causal direction.

Editorial extensions

If this is right

  • A single save-thinking prompt cannot be trusted as a general efficiency lever: for questions where the model chooses NT, the length savings are enormous but accuracy collapses, so naive deployment would be unsafe.
  • The confidence in the </think> token correlates with NT accuracy, meaning the pre-filled segment itself could serve as a cheap indicator of when direct answering is likely to succeed.
  • ET and IT show that the model can compress its visible reasoning without losing accuracy, suggesting that efficiency gains are available if the model can be steered into these modes rather than NT.
  • Because the attention divergence appears in early layers, early-layer representations could potentially be used as a control signal for routing questions to different reasoning policies.
  • The behavioral divergence of this RL-trained model, contrasted with SFT-distilled models that follow the same prompt more consistently, points to training objective as a key factor in thinking control.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the early-layer divergence is causal, a lightweight probe on early activations could decide at runtime whether to skip thinking, re-engage thinking, or keep standard reasoning, adapting per question rather than per prompt.
  • The confidence-accuracy correlation in NT suggests a threshold-based policy: only allow skipping when </think> confidence is high, otherwise force a short verification pass.
  • The near-miss errors in NT, where answers differ by a single digit, suggest that skipping removes a verification step rather than the underlying computation; a minimal second-pass check might recover much of the lost accuracy at a fraction of full-thinking cost.
  • Extending this analysis to other RL-trained reasoning models and to non-mathematical reasoning tasks would test whether the three modes are a general property of RL-trained chain-of-thought models or specific to the QwQ-32B checkpoint and math distribution.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 6 minor

Summary. This paper studies QwQ-32B, an RL-trained reasoning model, under a prompt that pre-fills a 'finished thinking' segment and asks the model to answer directly. The authors manually label the resulting outputs into three modes—no thinking (NT), explicit thinking (ET), and implicit thinking (IT)—on GSM8K and MATH500. They report three internal-state analyses: next-token confidence at the pre-filled </think> boundary (Table 2), layer-wise attention activation clustering (Figures 2–3), and attention to prompt sections (Tables 3, Figures 4–5). They then compare accuracy and output length against a no-prefill baseline (Table 4), finding that NT saves length but hurts accuracy, while ET and IT preserve accuracy with shorter outputs. The paper concludes that RL-trained LRMs show inconsistent internal preparation for saving thinking, and it promises to release the manual mode annotations.

Significance. If the behavioral taxonomy and performance comparison are accepted, the paper makes a useful empirical contribution: it quantifies a real failure mode of RL-trained LRMs under efficiency prompting and identifies a regime (ET) where length is reduced without an obvious accuracy loss. The effect sizes for NT are striking and credible, e.g., GSM8K accuracy drops from 94.09% to 37.76% while median length collapses to 35 tokens. The promise of releasing manual mode annotations is valuable for future work. However, the mechanistic claims in Sections 3.2–3.4 are currently correlational and partly circular; the causal framing is not established. The paper's significance as a 'mechanistic analysis' is therefore conditional on reanalysis or substantially softened conclusions.

major comments (4)
  1. [§3.2–§3.4] The causal framing is not supported by the evidence. Section 3.3's Findings state that early-layer attention dynamics 'shape reasoning strategies,' and Section 3.4 states that an internal state 'leads the LRM to bypass further reasoning,' but all measurements are correlational: the confidence value in Table 2 is taken at the pre-filled boundary before the mode-defining tokens are generated, and the attention vectors in Figures 2–5 are computed on inputs that are labeled by the subsequent output. No intervention, counterfactual, or control for the first generated token's identity is reported. These observations can distinguish or predict modes without explaining their cause, so the mechanistic contribution as written is not established. I ask for an intervention study (e.g., steering attention or logits at an early layer and observing mode shifts) or a thorough reframing to descriptive language.
  2. [§3.2, Table 2] The 'confidence in thinking termination' measurement needs a precise specification of the tensor position. The prompt already contains a pre-filled '</think>' token, so it is not clear whether the softmax is computed at that pre-filled position under teacher forcing or at the first free generation position. If the former, the top-1 being '</think>' is by construction and the correlation with the later mode is a predictive correlate, not a decision made by the model; if the latter, the claim that the top-1 is consistently '</think>' needs verification. Please state the exact position and avoid wording that the LRM 'predicts' a token that is already present in the input.
  3. [§4.1, Table 4] The central performance claim that ET 'preserves accuracy' is made without uncertainty quantification. The ET-vs-baseline accuracy differences are +0.74 percentage points on GSM8K and +1.85 on MATH500, with roughly 300–380 questions per group; no confidence intervals or significance tests are reported. The NT length/accuracy collapse is robust, but the 'no trade-off' conclusion for ET (and any claim of superiority over baseline) requires per-question paired bootstrap intervals or an equivalent test. Please add them and, if the differences are not significant, soften the claim.
  4. [§3.1, Table 1] The mode labels are the foundation of every subsequent analysis but are produced by manual inspection with no annotation protocol, no inter-annotator agreement, and no treatment of ambiguous cases. This is especially important for the IT category, which is defined by the absence of a '</think>' tag and has n=75 and n=3 in the two datasets. Please release a detailed rubric, report agreement on at least a subset with multiple annotators, and quantify the sensitivity of Tables 2–4 to labeling disagreements.
minor comments (6)
  1. [§3.2, last paragraph] The phrase 'and and favoring' contains a duplicated word; also, the sentence 'This confidence gap offers a key insight: higher confidence in thinking termination may be necessary for skipping reasoning' should be marked as a hypothesis rather than a finding.
  2. [Tables 2 and 3] The rows labeled 'Average' are weighted by the per-dataset sample sizes, but the captions do not say so; please state this explicitly.
  3. [Tables 3–4 and Figure 5] MATH500 has only three IT samples, yet IT values for MATH500 are reported without confidence intervals; either remove them or clearly mark them as anecdotal.
  4. [§3.3, Eq. (1)] The Davies-Bouldin Index formula is only sketched; please define S1, S2, and D1,2 explicitly and state how the layer-wise attention activation vectors are formed before clustering.
  5. [Figure 4] The green dashed line is said to represent the average value of MATH500 IT samples, but no numerical value is given in the figure; please add the value or clearly reference it from Table 3.
  6. [Appendix A] The final-answer extraction uses regular expressions followed by manual verification, but no details on the regex or the manual verification protocol are provided; a few examples would improve reproducibility.

Circularity Check

0 steps flagged · score 0.0 of 10

No definitional circularity found; the paper's confidence and attention analyses are correlational, but they are not numerically identical to the mode definitions by construction.

full rationale

The paper's central claims are an empirical behavioral taxonomy and post-hoc internal-state measurements, not a derivation from fitted parameters. NT, ET, and IT are defined by observable output structure: NT 'bypasses further thinking and directly generates the answer,' ET 'appends an additional </think> tag,' and IT 'does not output the </think> tag.' The Section 3.2 confidence is computed at the pre-filled </think> position, before the mode-defining continuation is generated, and the Section 3.3-3.4 attention analyses are computed at the first generated token, which is part of the mode-defining behavior. These are correlated with the mode labels, and the paper's causal language ('shaping reasoning strategies,' 'precipitates') is stronger than the correlational evidence supports; that is a validity limitation rather than a circular reduction. No equation in the paper makes a measured quantity numerically equal to a mode label, and no fitted parameter is renamed as a prediction. The only self-citations (Zhu et al. 2025; Luo et al. 2024) appear as background in the introduction and are not load-bearing. The behavioral comparisons against the standard-prompt baseline are evaluated on the same question groups but do not use the mode-defining measurements as inputs. Thus no circular step meets the quoted-reduction standard.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

The paper introduces no fitted numerical parameters. Its central claims rest on interpretive assumptions about what attention and confidence mean, on the representativeness of QwQ-32B, on the reliability of manual labeling, and on the validity of within-group baseline comparisons.

assumptions (5)
  • domain assumption QwQ-32B is representative of RL-trained native LRMs.
    The study uses only QwQ-32B and generalizes to RL-trained LRMs; other RL models may behave differently. See Section 3.1.
  • domain assumption Attention scores and softmax confidence are valid indicators of internal reasoning state and are causally upstream of behavior.
    The paper interprets correlational attention and confidence differences as mechanisms; no causal intervention is performed. See Sections 3.2 to 3.4.
  • domain assumption Exact match plus manual verification is a correct accuracy measure.
    They combine automatic EM with manual checks, but manual checks are not inter-annotator validated. See Appendix A.
  • domain assumption The three-mode taxonomy is exhaustive and reliably annotated.
    Manual annotation without agreement metrics; IT mode is rare and potentially noisy. See Section 3.1.
  • domain assumption Performance comparison within behavior-defined groups is a valid counterfactual.
    The baseline for a group uses the same questions without the prefilled prompt, but questions are not randomized to modes; modes are model-selected. See Section 4.1.

how reviews work

0 comments
Cite this review

Pith. "Pith review of When Can Large Reasoning Models Save Thinking? Mechanistic Analysis of Behavioral Divergence in Reasoning." pith.science (2026). https://pith.science/paper/6IULY3BD

@misc{pith2026250515276,
  author       = {Pith},
  title        = {Pith review of: When Can Large Reasoning Models Save Thinking? Mechanistic Analysis of Behavioral Divergence in Reasoning},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/6IULY3BD}},
  note         = {Machine review of arXiv:2505.15276}
}
read the original abstract

Large reasoning models (LRMs) have significantly advanced performance on complex tasks, yet their tendency to overthink introduces inefficiencies. This study investigates the internal mechanisms of reinforcement learning (RL)-trained LRMs when prompted to save thinking, revealing three distinct thinking modes: no thinking (NT), explicit thinking (ET), and implicit thinking (IT). Through comprehensive analysis of confidence in thinking termination, attention from thinking to generation, and attentional focus on input sections, we uncover key factors influencing the reasoning behaviors. We further find that NT reduces output length at the cost of accuracy, while ET and IT maintain accuracy with reduced response length. Our findings expose fundamental inconsistencies in RL-optimized LRMs, necessitating adaptive improvements for reliable efficiency.

Figures

Figures reproduced from arXiv: 2505.15276 by the authors.

Figure 1
Figure 1. Examples of the three modes of QwQ-32B under the save-thinking instructions. The final answers are underlined. The thought is marked in italics. The token </think> marks the end of the thought. Our manual annotations of the three thinking modes in the GSM8K and MATH500 datasets will be publicly available to support future research. 2 Related Work 2.1 Large Reasoning Models Large language models (LLMs) have demonstra… view at source ↗
Figure 2
Figure 2. PCA visualization of attention activation from the last layer for all samples in GSM8K and MATH500. [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Davies-Bouldin Index (less is better) calcu [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figures from the paper (4 more)
Figure 4
Figure 4. Figure 4: The density distribution of attention scores under different thinking modes. Implicit thinking samples in [PITH_FULL_IMAGE:figures/full_fig_p006_4.png]
Figure 5
Figure 5. Figure 5: Attention scores across prompt sections for [PITH_FULL_IMAGE:figures/full_fig_p007_5.png]
Figure 6
Figure 6. Figure 6: Top1 softmax probability vs. acc. for NT. [PITH_FULL_IMAGE:figures/full_fig_p008_6.png]
Figure 7
Figure 7. Figure 7: Attention scores across prompt sections for [PITH_FULL_IMAGE:figures/full_fig_p011_7.png]

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Towards Concise and Adaptive Thinking in Large Reasoning Models: A Survey

    cs.AI 2025-07 conditional novelty 3.0 of 10

    A comprehensive review that categorizes methods for shortening and adaptively triggering chain-of-thought reasoning in large language models.

Reference graph

Works this paper leans on

32 extracted references · 8 canonical work pages · cited by 1 Pith paper

  1. [1]

    online" 'onlinestring :=

    ENTRY address archivePrefix author booktitle chapter edition editor eid eprint eprinttype howpublished institution journal key month note number organization pages publisher school series title type volume year doi pubmed url lastchecked label extra.label sort.label short.list INTEGERS output.state before.all mid.sentence after.sentence after.block STRING...

  2. [2]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION word.in bbl.in capitalize " " * FUNCT...

  3. [3]

    Pranjal Aggarwal and Sean Welleck. 2025. https://doi.org/10.48550/arXiv.2503.04697 L1: controlling how long A reasoning model thinks with reinforcement learning . CoRR, abs/2503.04697

  4. [4]

    Avinash Anand, Mohit Gupta, Kritarth Prasad, Navya Singla, Sanjana Sanjeev, Jatin Kumar, Adarsh Raj Shivam, and Rajiv Ratn Shah. 2024. https://doi.org/10.48550/arXiv.2404.13099 Mathify: Evaluating large language models on mathematical problem solving tasks . CoRR, abs/2404.13099

  5. [5]

    Qiguang Chen, Libo Qin, Jinhao Liu, Dengyun Peng, Jiannan Guan, Peng Wang, Mengkang Hu, Yuhang Zhou, Te Gao, and Wanxiang Che. 2025. https://doi.org/10.48550/arXiv.2503.09567 Towards reasoning era: A survey of long chain-of-thought for reasoning large language models . CoRR, abs/2503.09567

  6. [6]

    Xingyu Chen, Jiahao Xu, Tian Liang, Zhiwei He, Jianhui Pang, Dian Yu, Linfeng Song, Qiuzhi Liu, Mengfei Zhou, Zhuosheng Zhang, Rui Wang, Zhaopeng Tu, Haitao Mi, and Dong Yu. 2024. https://doi.org/10.48550/arXiv.2412.21187 Do NOT think that much for 2+3=? on the overthinking of o1-like llms . CoRR, abs/2412.21187

  7. [7]

    Karl Cobbe, Vineet Kosaraju, Mohammad Bavarian, Mark Chen, Heewoo Jun, Lukasz Kaiser, Matthias Plappert, Jerry Tworek, Jacob Hilton, Reiichiro Nakano, Christopher Hesse, and John Schulman. 2021. https://arxiv.org/abs/2110.14168 Training verifiers to solve math word problems . CoRR, abs/2110.14168

  8. [8]

    DeepSeek - AI, Daya Guo, Dejian Yang, Haowei Zhang, Junxiao Song, Ruoyu Zhang, Runxin Xu, Qihao Zhu, Shirong Ma, Peiyi Wang, Xiao Bi, Xiaokang Zhang, Xingkai Yu, Yu Wu, Z. F. Wu, Zhibin Gou, Zhihong Shao, Zhuoshu Li, Ziyi Gao, Aixin Liu, Bing Xue, Bingxuan Wang, Bochao Wu, Bei Feng, Chengda Lu, Chenggang Zhao, Chengqi Deng, Chenyu Zhang, Chong Ruan, Damai...

Show all 32 references
  1. [9]

    Zhang, Han Bao, Hanwei Xu, Haocheng Wang, Haowei Zhang, Honghui Ding, Huajian Xin, Huazuo Gao, Hui Li, Hui Qu, J

    DeepSeek - AI, Aixin Liu, Bei Feng, Bing Xue, Bingxuan Wang, Bochao Wu, Chengda Lu, Chenggang Zhao, Chengqi Deng, Chenyu Zhang, Chong Ruan, Damai Dai, Daya Guo, Dejian Yang, Deli Chen, Dongjie Ji, Erhang Li, Fangyun Lin, Fucong Dai, Fuli Luo, Guangbo Hao, Guanting Chen, Guowei...

  2. [10]

    Junfeng Fang, Houcheng Jiang, Kun Wang, Yunshan Ma, Jie Shi, Xiang Wang, Xiangnan He, and Tat - Seng Chua. 2025. https://openreview.net/forum?id=HvSytvg3Jh Alphaedit: Null-space constrained knowledge editing for language models . In ICLR

  3. [11]

    Tingxu Han, Zhenting Wang, Chunrong Fang, Shiyu Zhao, Shiqing Ma, and Zhenyu Chen. 2024. https://doi.org/10.48550/arXiv.2412.18547 Token-budget-aware LLM reasoning . CoRR, abs/2412.18547

  4. [12]

    Dan Hendrycks, Collin Burns, Saurav Kadavath, Akul Arora, Steven Basart, Eric Tang, Dawn Song, and Jacob Steinhardt. 2021. https://datasets-benchmarks-proceedings.neurips.cc/paper/2021/hash/be83ab3ecd0db773eb2dc1b0a17836a1-Abstract-round2.html Measuring mathematical problem so...

  5. [13]

    u ttler, Mike Lewis, Wen - tau Yih, Tim Rockt \

    Patrick S. H. Lewis, Ethan Perez, Aleksandra Piktus, Fabio Petroni, Vladimir Karpukhin, Naman Goyal, Heinrich K \" u ttler, Mike Lewis, Wen - tau Yih, Tim Rockt \" a schel, Sebastian Riedel, and Douwe Kiela. 2020. https://proceedings.neurips.cc/paper/2020/hash/6b493230205f780e...

  6. [14]

    Chenghao Li, Chaoning Zhang, Yi Lu, Jiaquan Zhang, Qigan Sun, Xudong Wang, Jiwei Wei, Guoqing Wang, Yang Yang, and Heng Tao Shen. 2025. https://arxiv.org/abs/2504.09566 Syzygy of thoughts: Improving llm cot with the minimal free resolution . CoRR, abs/2504.09566

  7. [15]

    Yule Liu, Jingyi Zheng, Zhen Sun, Zifan Peng, Wenhan Dong, Zeyang Sha, Shiwen Cui, Weiqiang Wang, and Xinlei He. 2025. https://arxiv.org/abs/2504.13626 Thought manipulation: External thought can be efficient for large reasoning models . CoRR, abs/2504.13626

  8. [16]

    Xindi Luo, Zequn Sun, Jing Zhao, Zhe Zhao, and Wei Hu. 2024. https://doi.org/10.18653/v1/2024.naacl-long.396 Knowla: Enhancing parameter-efficient finetuning with knowledgeable adaptation . In NAACL, pages 7153--7166

  9. [17]

    Wenjie Ma, Jingxuan He, Charlie Snell, Tyler Griggs, Sewon Min, and Matei Zaharia. 2025. https://arxiv.org/abs/2504.09858 Reasoning models can be effective without thinking . CoRR, abs/2504.09858

  10. [18]

    Yu Meng, Mengzhou Xia, and Danqi Chen. 2024. http://papers.nips.cc/paper\_files/paper/2024/hash/e099c1c9699814af0be873a175361713-Abstract-Conference.html Simpo: Simple preference optimization with a reference-free reward . In NeurIPS

  11. [19]

    Cand \` e s, and Tatsunori Hashimoto

    Niklas Muennighoff, Zitong Yang, Weijia Shi, Xiang Lisa Li, Li Fei - Fei, Hannaneh Hajishirzi, Luke Zettlemoyer, Percy Liang, Emmanuel J. Cand \` e s, and Tatsunori Hashimoto. 2025. https://doi.org/10.48550/arXiv.2501.19393 s1: Simple test-time scaling . CoRR, abs/2501.19393

  12. [20]

    OpenAI. 2023. https://doi.org/10.48550/arXiv.2303.08774 GPT-4 technical report . CoRR, abs/2303.08774

  13. [21]

    OpenAI . 2025. https://openai.com/o1/ Introducing openai o1

  14. [22]

    Venkatesh Balavadhani Parthasarathy, Ahtsham Zafar, Aafaq Iqbal khan, and Arsalan Shahid. 2024. https://doi.org/10.48550/arXiv.2408.13296 The ultimate guide to fine-tuning llms from basics to breakthroughs: An exhaustive review of technologies, research, best practices, applie...

  15. [23]

    Yuxiao Qu, Matthew Y. R. Yang, Amrith Setlur, Lewis Tunstall, Edward Emanuel Beeching, Ruslan Salakhutdinov, and Aviral Kumar. 2025. https://doi.org/10.48550/arXiv.2503.07572 Optimizing test-time compute via meta reinforcement fine-tuning . CoRR, abs/2503.07572

  16. [24]

    Qwen Team . 2025. https://qwenlm.github.io/blog/qwq-32b/ Qwq-32b: Embracing the power of reinforcement learning

  17. [25]

    Charlie Snell, Jaehoon Lee, Kelvin Xu, and Aviral Kumar. 2024. https://doi.org/10.48550/arXiv.2408.03314 Scaling LLM test-time compute optimally can be more effective than scaling model parameters . CoRR, abs/2408.03314

  18. [26]

    Yang Sui, Yu - Neng Chuang, Guanchu Wang, Jiamu Zhang, Tianyi Zhang, Jiayi Yuan, Hongyi Liu, Andrew Wen, Shaochen Zhong, Hanjie Chen, and Xia Ben Hu. 2025. https://doi.org/10.48550/ARXIV.2503.16419 Stop overthinking: A survey on efficient reasoning for large language models . ...

  19. [27]

    Fengli Xu, Qianyue Hao, Zefang Zong, Jingwei Wang, Yunke Zhang, Jingyi Wang, Xiaochong Lan, Jiahui Gong, Tianjian Ouyang, Fanjin Meng, Chenyang Shao, Yuwei Yan, Qinglong Yang, Yiwen Song, Sijian Ren, Xinyuan Hu, Yu Li, Jie Feng, Chen Gao, and Yong Li. 2025 a . https://doi.org/...

  20. [28]

    Silei Xu, Wenhao Xie, Lingxiao Zhao, and Pengcheng He. 2025 b . https://doi.org/10.48550/arXiv.2502.18600 Chain of draft: Thinking faster by writing less . CoRR, abs/2502.18600

  21. [29]

    An Yang, Baosong Yang, Beichen Zhang, Binyuan Hui, Bo Zheng, Bowen Yu, Chengyuan Li, Dayiheng Liu, Fei Huang, Haoran Wei, Huan Lin, Jian Yang, Jianhong Tu, Jianwei Zhang, Jianxin Yang, Jiaxi Yang, Jingren Zhou, Junyang Lin, Kai Dang, Keming Lu, Keqin Bao, Kexin Yang, Le Yu, Me...

  22. [30]

    Wenkai Yang, Shuming Ma, Yankai Lin, and Furu Wei. 2025. https://doi.org/10.48550/arXiv.2502.18080 Towards thinking-optimal scaling of test-time compute for LLM reasoning . CoRR, abs/2502.18080

  23. [31]

    Wayne Xin Zhao, Kun Zhou, Junyi Li, Tianyi Tang, Xiaolei Wang, Yupeng Hou, Yingqian Min, Beichen Zhang, Junjie Zhang, Zican Dong, Yifan Du, Chen Yang, Yushuo Chen, Zhipeng Chen, Jinhao Jiang, Ruiyang Ren, Yifan Li, Xinyu Tang, Zikang Liu, Peiyu Liu, Jian - Yun Nie, and Ji - Ro...

  24. [32]

    Rongzhi Zhu, Xiangyu Liu, Zequn Sun, Yiwei Wang, and Wei Hu. 2025. https://doi.org/10.48550/arXiv.2502.14245 Mitigating lost-in-retrieval problems in retrieval augmented multi-hop question answering . CoRR, abs/2502.14245

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.