Pith. sign in

REVIEW 6 cited by

Think When You Need: Self-Adaptive Chain-of-Thought Learning

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 2504.03234 v2 pith:XGJLYJ2C submitted 2025-04-04 cs.CL cs.AIcs.LG

classification cs.CLcs.AIcs.LG
keywords reasoningdemonstratelengthmethodmodelsthinkwhenaccount
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Chain of Thought (CoT) reasoning enhances language models' performance but often leads to inefficient "overthinking" on simple problems. We identify that existing approaches directly penalizing reasoning length fail to account for varying problem complexity. Our approach constructs rewards through length and quality comparisons, guided by theoretical assumptions that jointly enhance solution correctness with conciseness. Moreover, we further demonstrate our method to fuzzy tasks where ground truth is unavailable. Experiments across multiple reasoning benchmarks demonstrate that our method maintains accuracy while generating significantly more concise explanations, effectively teaching models to "think when needed."

Discussion (0). Sign in to comment.

Forward citations

Cited by 6 Pith papers

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

  1. Probing the Difficulty Perception Mechanism of Large Language Models

    cs.CL 2025-10 conditional novelty 6.0 of 10

    LLMs linearly encode math-problem difficulty in their final-token representations, and specific final-layer attention heads are specialized for easy vs hard problems.

  2. Reconsidering Overthinking: Penalizing Internal and External Redundancy in CoT Reasoning

    cs.AI 2025-08 conditional novelty 6.0 of 10

    A dual-penalty RL method that compresses chain-of-thought traces by separately penalizing internal semantic stagnation and external post-answer continuation reduces reasoning length by about 40% while preserving accur...

  3. Do Thinking Tokens Help or Trap? Towards More Efficient Large Reasoning Model

    cs.CL 2025-06 conditional novelty 6.0 of 10

    Suppressing 'thinking tokens' in a 1.5B reasoning model preserves accuracy while cutting tokens, and the proposed DuP-PO RL method improves both accuracy and efficiency over GRPO.

  4. Failure Cases Are Better Learned But Boundary Says Sorry: Facilitating Smooth Perception Change for Accuracy-Robustness Trade-Off in Adversarial Training

    cs.CV 2025-08 reject novelty 5.0 of 10

    A paper whose abstract describes new adversarial training experiments, but whose full text is a different paper on CoT compression, leaving the claims unsupported.

  5. Enhancing Large Language Models through Structured Reasoning

    cs.CL 2025-06 conditional novelty 5.0 of 10

    Structured reasoning tags plus a max-flow reward let a 1.5B model match the math accuracy of models trained for far longer, but the gains are within statistical noise.

  6. 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.

Pith tools