Pith. sign in

REVIEW 11 cited by

Chain-of-Thought Reasoning Without Prompting

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 2402.10200 v2 pith:PXBOOGWF submitted 2024-02-15 cs.CL

classification cs.CL
keywords reasoningpromptingdecodingllmseffectivelypathsapproachcapabilities
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

In enhancing the reasoning capabilities of large language models (LLMs), prior research primarily focuses on specific prompting techniques such as few-shot or zero-shot chain-of-thought (CoT) prompting. These methods, while effective, often involve manually intensive prompt engineering. Our study takes a novel approach by asking: Can LLMs reason effectively without prompting? Our findings reveal that, intriguingly, CoT reasoning paths can be elicited from pre-trained LLMs by simply altering the \textit{decoding} process. Rather than conventional greedy decoding, we investigate the top-$k$ alternative tokens, uncovering that CoT paths are frequently inherent in these sequences. This approach not only bypasses the confounders of prompting but also allows us to assess the LLMs' \textit{intrinsic} reasoning abilities. Moreover, we observe that the presence of a CoT in the decoding path correlates with a higher confidence in the model's decoded answer. This confidence metric effectively differentiates between CoT and non-CoT paths. Extensive empirical studies on various reasoning benchmarks show that the proposed CoT-decoding effectively elicits reasoning capabilities from language models, which were previously obscured by standard greedy decoding.

Discussion (0). Sign in to comment.

Forward citations

Cited by 11 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 13 citations worldwide. Full citation record

  1. Video Reasoning without Training

    cs.CV 2025-10 conditional novelty 6.0 of 10

    An entropy-guided, inference-time value-cache controller improves video reasoning accuracy and cuts output tokens versus RL-trained baselines.

  2. Post-Training Large Language Models via Reinforcement Learning from Self-Feedback

    cs.CL 2025-07 conditional novelty 6.0 of 10

    RLSF uses a model's own answer-span confidence as an intrinsic reward to create preference data, then applies DPO or PPO to improve calibration and reasoning without external labels.

  3. Reasoning Strategies in Large Language Models: Can They Follow, Prefer, and Optimize?

    cs.CL 2025-07 conditional novelty 6.0 of 10

    Prompting LLMs with distinct reasoning strategies and ensembling their outputs improves accuracy on logical deduction tasks, though not as consistently as the paper claims.

  4. The Challenge of Teaching Reasoning to LLMs Without RL or Distillation

    cs.AI 2025-07 conditional novelty 6.0 of 10

    Twenty high-quality chain-of-thought examples from a reasoning model are enough to activate strong math reasoning in a 32B base model with lightweight fine-tuning.

  5. Towards Understanding the Cognitive Habits of Large Reasoning Models

    cs.CL 2025-06 conditional novelty 6.0 of 10

    A new benchmark shows large reasoning models exhibit human-like cognitive habits in their chain-of-thought, and some habits correlate with unsafe responses.

  6. Token Signature: Predicting Chain-of-Thought Gains with Token Decoding Feature in Large Language Models

    cs.CL 2025-06 conditional novelty 6.0 of 10

    The monotonicity of token probabilities during initial decoding predicts chain-of-thought gains, enabling dynamic selection between CoT and direct answers.

  7. LLM-First Search: Self-Guided Exploration of the Solution Space

    cs.AI 2025-06 conditional novelty 6.0 of 10

    LLM-First Search, where the model itself decides whether to continue or backtrack during reasoning, outperforms MCTS, BestFS, and ToT-BFS on harder Countdown and Sudoku tasks while using fewer tokens.

  8. ConText: Driving In-context Learning for Text Removal and Segmentation

    cs.CV 2025-06 conditional novelty 6.0 of 10

    ConText is the first visual in-context learning model for text removal and segmentation, chaining the two tasks and using self-prompting to reach new state-of-the-art scores.

  9. Less is More Tokens: Efficient Math Reasoning via Difficulty-Aware Chain-of-Thought Distillation

    cs.CL 2025-09 reject novelty 4.0 of 10

    Difficulty-aware compression of CoT traces plus SFT and DPO lets LLMs shorten reasoning on easy math problems, cutting tokens by up to 30% with mixed accuracy effects.

  10. Spatial navigation in preclinical Alzheimer's disease: A review

    q-bio.NC 2026-03 unverdicted novelty 3.0 of 10

    Spatial navigation performance, particularly path integration and wayfinding, correlates with AD biomarkers such as p-tau in cognitively unimpaired at-risk individuals and may enable earlier detection than episodic me...

  11. A Survey on Large Language Models for Mathematical Reasoning

    cs.AI 2025-06 conditional novelty 1.0 of 10

    Recent advances in LLM mathematical reasoning are organized into comprehension and generation phases, covering methods from prompting to test-time scaling.

Pith tools