- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
LeanTree extracts intermediate goals from existing Lean proofs and converts them into natural-language problems with verifiable answers. It uses proof-tree depth as a difficulty proxy and trains models through a curriculum progressing from deeper subproblems to original problems. Experiments across two model backbones and multiple benchmarks show improvements over direct RL and data-synthesis baselines. Curriculum ablations and held-out-root evaluations provide additional support for the approach.
Critical strengths
- Useful supervision from formal proof structure. Existing proofs provide explicit assumptions, intermediate targets, and dependencies, offering a principled basis for constructing auxiliary training tasks.
- Supportive empirical evaluation. Improvements across the evaluated configurations, together with same-data curriculum ablations and held-out-root evaluation, support the practical value of the method.
Critical weaknesses
- Restricted coverage of proof-derived skills. The pipeline retains tasks convertible into concrete answer-based questions and excludes pure proof tasks. It is unclear how much important intermediate reasoning is lost through this filtering and whether the retained tasks adequately cover the prerequisites of the original problems.
- Curriculum implementation and justification need clarification. The paper specifies the depth order but does not clearly explain training-step allocation, sampling, and transitions between stages. Furthermore, comparison with random ordering does not establish whether proof depth is preferable to model-dependent difficulty measures such as empirical success rate.
Questions for authors
- What proportion of intermediate goals is excluded because they cannot be converted into answer-based tasks? Could this remove important prerequisite skills?
- How are the 100 training steps allocated across curriculum stages, and what determines stage transitions and sampling within each stage?
- Have you compared depth-based scheduling with scheduling based on empirical success rates? Such a comparison would help establish the additional value of proof-tree depth.
3 comments
Response to Reviewer cZo8 Part (2/2)
W2 & Q2: Stage allocation, sampling, and transitions. How are the 100 training steps allocated across curriculum stages, and what determines stage transitions and sampling within each stage?
Thank you for this valuable question.
TL;DR: We sample in descending order of proof depth. The six groups are ≥5 → 4 → 3 → 2 → 1 → 0, with all original problems assigned depth 0 (Section 3.3).
For the 100-step main run, the six groups account for 6, 3, 4, 4, 2, and 81 updates, respectively. We group retained subproblems by their depth in the reconstructed proof tree and pool all depths of 5 or greater in the first group. Stage transitions occur at the boundaries between consecutive depth groups in the sampling order. They require no reward or success-rate threshold. Within a group, examples share the same depth priority and are shuffled before batching. The standard Qwen/GRPO run uses a global batch of 256 prompts and generates eight responses per prompt (Appendix B.4).
Figure 2 uses a separate 700-step diagnostic run with a batch size of eight prompts. There, steps 600–700 put both methods on the difficult original problems so that we can compare their rewards on the same tasks (Appendix C.3).
W2 & Q3: Proof depth versus empirical success rate. Have you compared depth-based scheduling with scheduling based on empirical success rates? Such a comparison would help establish the additional value of proof-tree depth.
Thank you for this valuable question.
TL;DR: Proof-depth ordering provides both a difficulty signal and a structural learning hierarchy without additional rollout-based calibration. Unlike independent accuracy estimates, proof-tree depth also preserves the dependencies among intermediate reasoning steps.
Thank you for this valuable question. An accuracy-based curriculum requires evaluating each candidate subproblem to estimate its difficulty. For our 4,772 synthesized subproblems, even a single calibration pass with 8 rollouts per question would require 38,176 additional generations. In contrast, LeanTree obtains the depth of every subproblem directly during proof-tree reconstruction, requiring no additional rollouts for difficulty estimation.
More importantly, proof depth provides structural information that independent accuracy estimates cannot directly capture. A proof tree organizes intermediate goals hierarchically, reflecting how local reasoning steps contribute to higher-level goals. This allows LeanTree to organize training from foundational intermediate tasks toward the original problem, rather than merely sorting questions by their individual success rates.
Although we were unable to complete a direct comparison with accuracy-based scheduling within the rebuttal period, our existing experiments provide complementary evidence for the effectiveness of this design. Table 4 shows that initial-model accuracy increases monotonically from 21.61% on original root problems to 70.14% on subproblems at depth ≥5. Table 2 further shows that depth-based scheduling improves average accuracy from 68.91% to 71.14% compared with random ordering on exactly the same training data. Finally, Figure 2 shows that the model trained with LeanTree obtains more informative reward signals and adapts more effectively when returning to the original difficult problems.
Thank you again for your thoughtful review and for encouraging us to make the construction and training details more explicit.
Gentle Reminder: Author–Reviewer Discussion Ending Soon
Dear Reviewer cZo8,
Thank you again for your valuable review and constructive feedback. As the Author–Reviewer discussion period is coming to an end soon, we would like to gently remind you that we have posted our point-by-point responses to all your comments.
We would greatly appreciate it if you could review our responses before the deadline. If our clarifications have adequately resolved your concerns, we would be deeply grateful if you would consider raising your score. Should anything remain unclear, please let us know—we remain available and eager to engage in further discussion.
Best regards,
Authors
Response to Reviewer cZo8 Part (1/2)
Dear Reviewer cZo8,
Thank you for your valuable review and for recognizing how the assumptions, targets, and dependencies in a formal proof can supply useful intermediate supervision. We especially appreciate your observation that the same-data ablation and the held-out evaluation address different questions about the curriculum. Your questions give us an opportunity to clarify which reasoning skills survive conversion and how the learner encounters them during training.
We genuinely welcome your feedback throughout the discussion. If these clarifications address your concerns, we would be grateful if you would consider raising your score. If anything remains unclear, we would truly appreciate your further guidance.
Thank you for this valuable question.
TL;DR: Although answer-based filtering inevitably excludes some formal proof goals, the retained subproblems provide informative learning signals and help the model improve on the original difficult problems, as evidenced by Figure 2.
How much is filtered? We extract non-root nodes as candidate subproblems and apply rule-based and LLM-based pruning to remove trivial transformations, bookkeeping, and goals that cannot be faithfully converted into self-contained questions with concrete, verifiable answers. In our construction, we retain 4,772 quality-filtered subproblems. Approximately 19.7% are excluded during this process.
Does filtering remove important prerequisite skills? We acknowledge that some proof goals, particularly pure proof tasks or goals without uniquely determined concrete answers, cannot be directly converted into our answer-based RL format. However, retaining every formal goal is not necessarily beneficial: some represent proof-engineering steps or trivial transformations rather than transferable mathematical skills.
More importantly, Figure 2 provides process-level evidence that the retained subproblems supply useful prerequisite supervision. Under matched rollout budgets, LeanTree maintains higher reward informativeness than direct RL over most of training (Figure 2a), indicating that the synthesized tasks provide more informative reward contrasts for GRPO. When training returns to the original difficult problems at steps 600–700, LeanTree's mean reward recovers rapidly and surpasses direct RL during the latter part of this phase (Figure 2b). This demonstrates that the retained intermediate tasks provide useful preparation for subsequent learning on the original problems.
The held-out evaluation provides complementary evidence: LeanTree improves accuracy on original root problems from 24.02% to 28.03% over direct RL, and outperforms the size-matched Prompt LLM baseline at every proof depth (Table 4). Together, these results support the practical usefulness of the retained proof-derived subproblems, even though they do not imply that every prerequisite skill in the original proof is preserved.