Pith. sign in

REVIEW 15 cited by

Wait, We Don't Need to "Wait"! Removing Thinking Tokens Improves Reasoning Efficiency

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2506.08343 v2 pith:KWJVDNEI submitted 2025-06-10 cs.CL

classification cs.CL
keywords reasoningnowaittokenswaitefficiencyexplicitmodelself-reflection
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recent advances in large reasoning models have enabled complex, step-by-step reasoning but often introduce significant overthinking, resulting in verbose and redundant outputs that hinder efficiency. In this study, we examine whether explicit self-reflection, signaled by tokens such as "Wait" and "Hmm", is necessary for advanced reasoning. We propose NoWait, a simple yet effective approach that disables explicit self-reflection by suppressing these tokens during inference. Extensive experiments on ten benchmarks across textual, visual, and video reasoning tasks show that NoWait reduces chain-of-thought trajectory length by up to 27%-51% in five R1-style model series, without compromising model utility. NoWait thus offers a plug-and-play solution for efficient and utility-preserving multimodal reasoning.

Discussion (0). Sign in to comment.

Forward citations

Cited by 15 Pith papers

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

  1. DyCon: Dynamic Reasoning Control via Evolving Difficulty Modeling

    cs.AI 2026-06 unverdicted novelty 6.0 of 10

    DyCon dynamically controls reasoning depth in LRMs by modeling evolving difficulty from step-level embeddings, reducing redundant steps across multiple benchmarks.

  2. Thinking with Reasoning Skills: Fewer Tokens, More Accuracy

    cs.AI 2026-04 unverdicted novelty 6.0 of 10

    Distilling and retrieving reusable reasoning skills lets LLMs solve coding and math problems with fewer tokens and higher accuracy.

  3. LLM Reasoning as Trajectories: Step-Specific Representation Geometry and Correctness Signals

    cs.CL 2026-04 unverdicted novelty 6.0 of 10

    LLM mathematical reasoning forms ordered, step-specific trajectories in representation space that already exist in base models, diverge for correct vs. incorrect solutions at late stages, and support both correctness ...

  4. Graph-Based Chain-of-Thought Pruning for Reducing Redundant Reflections in Reasoning LLMs

    cs.CL 2026-04 unverdicted novelty 6.0 of 10

    Graph-based pruning of redundant reflections in LLM chain-of-thought reduces average reasoning tokens by 42% while preserving or improving accuracy.

  5. CRISP: Compressed Reasoning via Iterative Self-Policy Distillation

    cs.LG 2026-03 conditional novelty 6.0 of 10

    CRISP achieves 57-59% token reduction on MATH-500 with 9-16 point accuracy gains on Qwen3 models via iterative self-distillation of concise reasoning behavior.

  6. CRISP: Compressed Reasoning via Iterative Self-Policy Distillation

    cs.LG 2026-03 conditional novelty 6.0 of 10

    On-policy reverse-KL self-distillation from a “be concise” teacher cuts reasoning length up to 56% while preserving or slightly improving math accuracy across several models.

  7. Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression

    cs.LG 2026-02 unverdicted novelty 6.0 of 10

    Extra-CoT trains a semantic compressor on math CoT data, applies mixed-ratio SFT, and uses CHRPO reinforcement learning to achieve over 73% token reduction on MATH-500 with 0.6% accuracy gain on Qwen3-1.7B.

  8. Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression

    cs.LG 2026-02 conditional novelty 6.0 of 10

    A pipeline combining a question-aware formula-preserving compressor, mixed-ratio SFT, and hierarchical RL compresses CoT on math benchmarks to ~27% of original tokens while preserving or slightly improving accuracy.

  9. Mid-Think: Training-Free Intermediate-Budget Reasoning via Token-Level Triggers

    cs.CL 2026-01 conditional novelty 6.0 of 10

    A prompt combining the 'Okay' reasoning cue with the '</think>\n\n' no-think cue gives LLMs an intermediate reasoning budget without training, and also speeds up RL fine-tuning.

  10. Are Large Reasoning Models Interruptible?

    cs.CL 2025-10 conditional novelty 6.0 of 10

    Interrupting large reasoning models or changing the problem mid-thought sharply degrades accuracy, with up to 60% drops and distinct failure modes: reasoning leakage, panic, and self-doubt.

  11. Input-Time Scaling: Adding Noise and Irrelevance into Less-Is-More Drastically Improves Reasoning Performance and Efficiency

    cs.LG 2025-08 unverdicted novelty 6.0 of 10

    Adding controlled noise and irrelevant persona contexts across training and testing stages for strong LLMs yields better reasoning and efficiency than high-quality data alone, reaching 76.7% on AIME24/25 with Qwen2.5-32B.

  12. Beyond Penalizing Mistakes: Stabilizing Efficiency Training in Large Reasoning Models via Adaptive Correct-Only Rewards

    cs.AI 2026-06 unverdicted novelty 5.0 of 10

    ACOER applies adaptive correct-only efficiency rewards in GRPO to avoid reward collapse, yielding higher accuracy and over 60% fewer tokens on math reasoning benchmarks.

  13. Revisiting Anthropomorphic Reflection Markers in Large Language Model Reasoning

    cs.CL 2026-05 unverdicted novelty 5.0 of 10

    Suppressing anthropomorphic reflection markers via prompt and token interventions preserves or improves LLM reasoning performance on four benchmarks while models continue marker-free verification.

  14. When Is Thinking Enough? Early Exit via Sufficiency Assessment for Efficient Reasoning

    cs.CL 2026-04 unverdicted novelty 5.0 of 10

    DTSR enables large reasoning models to dynamically assess chain-of-thought sufficiency via reflection signals and a sufficiency check, reducing reasoning length by 28.9-34.9% with minimal performance loss on Qwen3 models.

  15. MixReasoning: Switching Modes to Think

    cs.AI 2025-10 conditional novelty 5.0 of 10

    A reasoning model can cut token usage by roughly a third to a half without losing accuracy if it switches to brief output on low-uncertainty steps and expands only at high-uncertainty forks.

Pith tools