Pith. sign in

REVIEW 4 cited by

Fast-Slow-Thinking: Complex Task Solving with 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 2504.08690 v1 pith:JO5ZIRWU submitted 2025-04-11 cs.CL cs.AI

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

Nowadays, Large Language Models (LLMs) have been gradually employed to solve complex tasks. To face the challenge, task decomposition has become an effective way, which proposes to divide a complex task into multiple simpler subtasks and then solve them separately so that the difficulty of the original task can be reduced. However, the performance of existing task decomposition methods can be suboptimal when the task contains overly complex logic and constraints. In this situation, the solution generated by LLMs may deviate from the original purpose of the task, or contain redundant or even erroneous content. Therefore, inspired by the fact that humans possess two thinking systems including fast thinking and slow thinking, this paper introduces a new task decomposition method termed ``Fast-Slow-Thinking'' (FST), which stimulates LLMs to solve tasks through the cooperation of Fast Thinking (FT) and Slow Thinking (ST) steps. Here FT focuses more on the general and concise aspect of the task, and ST focuses more on the details of the task. In FT, LLMs are prompted to remove the constraints of the original task, therefore simplifying it to a general and concise one. In ST, we recall the constraints removed in FT, so that LLMs can improve the answer generated in FT to meet the requirements of the original task. Therefore, our FST method enables LLMs to consider a complex problem via a human-like cognition process from coarse to fine, the effectiveness of which has been well demonstrated by the experiments on three types of tasks.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

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

  1. SheetDesigner: MLLM-Powered Spreadsheet Layout Generation with Rule-Based and Vision-Based Reflection

    cs.AI 2025-09 conditional novelty 6.0 of 10

    SheetDesigner uses zero-shot multimodal LLMs with rule- and vision-based reflection to generate spreadsheet layouts, and claims a 22.6% gain over baselines on a new seven-criterion benchmark.

  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. CortexDebate: Debating Sparsely and Equally for Multi-Agent Debate

    cs.AI 2025-07 conditional novelty 5.0 of 10

    CortexDebate prunes the multi-agent debate graph every round using a McKinsey-style trust score per directed link, reporting accuracy gains over full-debate baselines on eight datasets with shorter per-agent contexts.

  4. Get Experience from Practice: LLM Agents with Record & Replay

    cs.LG 2025-05 reject novelty 4.0 of 10

    AgentRR is a proposed paradigm that records agent traces, generalizes them into multi-level experiences, and replays them under safety checks to make LLM agents cheaper, faster, and more reliable.

Pith tools