Pith. sign in

REVIEW 5 cited by

Non-myopic Generation of Language Models for Reasoning and Planning

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 2410.17195 v3 pith:NTO3HXVS submitted 2024-10-22 cs.AI cs.CL

classification cs.AIcs.CL
keywords planningpredictive-decodingreasoningcodingcomputationallanguagemodelsnon-myopic
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Large Language Models have demonstrated remarkable abilities in reasoning and planning by breaking down complex problems into sequential steps. Despite their success in various domains like mathematical problem-solving and coding, LLMs face challenges in ensuring reliable and optimal planning due to their inherent myopic nature of autoregressive decoding. This paper revisits LLM reasoning from an optimal-control perspective, proposing a novel method, Predictive-Decoding, that leverages Model Predictive Control to enhance planning accuracy. By re-weighting LLM distributions based on foresight trajectories, Predictive-Decoding aims to mitigate early errors and promote non-myopic planning. Our experiments show significant improvements in a wide range of tasks for math, coding, and agents. Furthermore, Predictive-Decoding demonstrates computational efficiency, outperforming search baselines with reduced computational resources. This study provides insights into optimizing LLM planning capabilities.

Discussion (0). Sign in to comment.

Forward citations

Cited by 5 Pith papers

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

  1. DeepLook: Deeper Thinking with Lookahead

    cs.AI 2026-06 conditional novelty 6.0 of 10

    A training-free decoder that branches only at low-confidence reasoning segments and ranks continuations by average lookahead confidence reports equal or better accuracy at roughly 1/8 of a confidence-filtered baseline...

  2. Dual-Dimensional Consistency: Balancing Budget and Quality in Adaptive Inference-Time Scaling

    cs.AI 2026-05 unverdicted novelty 6.0 of 10

    DDC reduces token consumption by over 10x in LLM reasoning while maintaining or exceeding baseline accuracy across five benchmarks via adaptive path quality filtering.

  3. MUR: Momentum Uncertainty guided Reasoning for Large Language Models

    cs.CL 2025-07 unverdicted novelty 6.0 of 10

    MUR selectively applies test-time scaling to steps whose uncertainty exceeds a momentum-smoothed history, saving tokens and often modestly improving accuracy.

  4. POSS: Position Specialist Generates Better Draft for Speculative Decoding

    cs.CL 2025-06 conditional novelty 6.0 of 10

    Using position-specialized draft layers instead of one single draft model improves later-token acceptance in speculative decoding, yielding modest speedups on Llama-3-8B and Llama-2-13B.

  5. VeriThinker: Learning to Verify Makes Reasoning Model Efficient

    cs.LG 2025-05 conditional novelty 6.0 of 10

    VeriThinker shows that fine-tuning a reasoning model only on a solution-verification task reduces chain-of-thought length on MATH500 and AIME by 20-45% while preserving or slightly improving accuracy.

Pith tools