Knowing What to Solve Before How: Preplan Empowered LLM Mathematical Reasoning
Abstract
AbstractCurrent plan-based reasoning methods improve large language models (LLMs) by inserting a planning stage before execution, giving rise to the **question → plan → cot** paradigm. While effective, a closer examination reveals an inherent paradigm-level gap: both the planning and its execution stages decide *how to solve* a problem, while the prior question of *what to solve*; recognizing the problem type, the applicable tools, and the foreseeable pitfalls; remains entirely implicit. To bridge this gap, we propose **PPC** (**P**replan-**P**lan-**C**oT), a framework that introduces an explicit problem-understanding stage, the *preplan*, yielding a new **question → preplan → plan → cot** paradigm. Realizing this paradigm requires safeguarding the conceptual integrity of preplan at both ends. Specifically, we design a three-stage synthesis pipeline with a *spoiler-score detector* that filters out leakage and spoiler failures to build clean preplan supervision, and a composite GRPO reward enforces that the generated plan genuinely follows from the preplan. Experiments across four backbones and five mathematical reasoning benchmarks show that PPC achieves the best results on 39 of 40 metrics, improving *maj@16* and *pass@16* by +2.23 and +3.06 over the strongest baseline without introducing additional inference token overhead.