REVIEW 3 cited by
Stepwise Perplexity-Guided Refinement for Efficient Chain-of-Thought Reasoning in Large Language Models
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
read the original abstract
Chain-of-Thought (CoT) reasoning, which breaks down complex tasks into intermediate reasoning steps, has significantly enhanced the performance of large language models (LLMs) on challenging tasks. However, the detailed reasoning process in CoT often incurs long generation times and high computational costs, partly due to the inclusion of unnecessary steps. To address this, we propose a method to identify critical reasoning steps using perplexity as a measure of their importance: a step is deemed critical if its removal causes a significant increase in perplexity. Our method enables models to focus solely on generating these critical steps. This can be achieved through two approaches: refining demonstration examples in few-shot CoT or fine-tuning the model using selected examples that include only critical steps. Comprehensive experiments validate the effectiveness of our method, which achieves a better balance between the reasoning accuracy and efficiency of CoT.
Forward citations
Cited by 3 Pith papers
-
Do Thinking Tokens Help or Trap? Towards More Efficient Large Reasoning Model
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.
-
ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization
ReCUT combines stepwise long-short sampling, dual DPO training, and DARE-Ties parameter interpolation to compress LLM reasoning chains by 30-50% without sacrificing accuracy on math benchmarks.
-
CoRE: Enhancing Metacognition with Label-free Self-evaluation in LRMs
A training-free and label-free detector of cyclic hidden-state patterns triggers early exit during chain-of-thought reasoning, reducing token length while mostly preserving or improving accuracy.
Discussion (0). Continue with ORCID to comment.