Pith. sign in

REVIEW 5 cited by

DynaThink: Fast or Slow? A Dynamic Decision-Making Framework for 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

arxiv 2407.01009 v1 pith:ZWWTVVHB submitted 2024-07-01 cs.CL

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

Large language models (LLMs) have demonstrated emergent capabilities across diverse reasoning tasks via popular Chains-of-Thought (COT) prompting. However, such a simple and fast COT approach often encounters limitations in dealing with complicated problems, while a thorough method, which considers multiple reasoning pathways and verifies each step carefully, results in slower inference. This paper addresses the challenge of enabling LLMs to autonomously select between fast and slow inference methods, thereby optimizing both efficiency and effectiveness. We introduce a dynamic decision-making framework that categorizes tasks into two distinct pathways: 'Fast', designated for tasks where the LLM quickly identifies a high-confidence solution, and 'Slow', allocated for tasks that the LLM perceives as complex and for which it has low confidence in immediate solutions as well as requiring more reasoning paths to verify. Experiments on five popular reasoning benchmarks demonstrated the superiority of the DynaThink over baselines.

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. Route to Reason: Adaptive Routing for LLM and Reasoning Strategy Selection

    cs.CL 2025-05 conditional novelty 6.0 of 10

    Route-To-Reason learns to predict the accuracy and token usage of each model-strategy pair and routes every query to the pair that maximizes a tunable accuracy-cost score.

  2. Cognitive Duality for Adaptive Web Agents

    cs.AI 2025-08 unverdicted novelty 5.0 of 10

    A web agent called CogniWeb reportedly reaches 43.96% success on WebArena with 75% fewer tokens by switching between fast and slow reasoning, but the supplied body is a different paper and the claims could not be checked.

  3. Incentivizing Dual Process Thinking for Efficient Large Language Model Reasoning

    cs.AI 2025-05 conditional novelty 5.0 of 10

    ACPO uses special fast/slow thinking tokens and an online length-budget reward to make LLM math reasoning shorter and difficulty-adaptive, with modest accuracy loss.

  4. DynamicMind: A Tri-Mode Thinking System for Large Language Models

    cs.CL 2025-06 reject novelty 4.0 of 10

    A router trained on a self-generated dataset can cut token usage in zero-shot QA by switching among three prompting styles, but the claimed accuracy superiority is not supported by the paper's own numbers.

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