- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies whether a reasoning model can improve using only problems and solutions generated by itself, without reinforcement learning or an existing question-level training set. The method first trains a Challenger to generate questions near the current ability level of the model. The original model then solves each question several times and groups the answers into clusters. Verified successful trajectories are used for supervised fine-tuning, while repeated wrong answers are used in an answer-level pairwise loss. Experiments on Qwen3-4B and Qwen3-8B show improvements of about 2–3 points on several math benchmarks.
Critical strengths
-
The paper gives a clear reason for treating successful and failed samples differently. Learning complete successful trajectories while only comparing the final answers of failed samples avoids penalizing useful intermediate reasoning.
-
The method does not require reinforcement learning or a human-written question set. The Challenger and Solver are also separated, which makes the training process easier to understand.
-
The paper includes useful ablations on question selection, verification, the number of positive samples, and the use of failed trajectories. The Pass@k and problem-state results also provide more information than single-sample accuracy alone.
Critical weaknesses
-
Limited novelty. The method mainly combines capability-matched question generation, SFT on successful trajectories, and answer-level preference learning. The failure-aware loss is also close to existing reference-free preference objectives. The overall contribution is useful, but it is mostly a combination of known techniques.
-
Limited experimental scope and modest gains. The experiments only use Qwen3-4B and Qwen3-8B, and the training data are limited to mathematics. The full method improves the average scores by only about 2–3 points, while performance drops on some individual benchmarks. It is unclear whether the method works well across other model families and tasks.
-
Too few baselines. The main experiments only compare Initial, Success-SFT, and Full. The paper lacks direct comparisons with recent related methods, such as [1] Self-Questioning Language Models, [2] Guided Self-Evolving LLMs with Minimal Human Supervision, [3] R-Diverse: Mitigating Diversity Illusion in Self-Play LLM Training, [4] Self-Distillation Zero: Self-Revision Turns Binary Rewards into Dense Supervision. Although their settings are not exactly the same, comparisons under the same backbone, question set, and compute budget would make the results more convincing.
-
Missing experimental details. The paper does not clearly report how many samples remain after each filtering stage, the final size of the training set, the accuracy of self-verification, or the total cost of data generation and training. It also does not give the number of evaluation runs, variance, or confidence intervals. These details are needed to judge reproducibility, statistical reliability, and the claim of efficiency.
Questions for authors
- How many questions and trajectories remain after each filtering and verification stage? What is the final training-set size for each model2
- How many evaluation runs were used for each result? Could the authors report standard deviations, confidence intervals, or significance tests for the 2–3 point improvements?
- What are the total costs of question generation, repeated sampling, verification, and training? How do these costs compare with recent self-evolution or RL-based methods?
- Can the authors provide direct comparisons with recent methods such as [1] Self-Questioning Language Models, [3] DARC, [5] Self-Distillation Zero, or [6] Self-Verified Distillation under a matched backbone and training budget? Such results could materially change my view of the paper’s novelty and effectiveness.