- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper presents Nemotron-Cascade 2, a 30B MoE model with 3B active parameters post-trained from Nemotron-3-Nano-Base. It extends Cascade RL with a multi-domain RL stage that jointly trains domains with similar response lengths and verification costs, and adds multi-domain on-policy distillation (MOPD) from intermediate checkpoints to recover regressions. The model reports strong results on code reasoning, alignment, and instruction following, reaches gold-level scores on IMO 2025, IOI 2025, and ICPC World Finals 2025 with test-time scaling, and is released with its training data.
Critical strengths
- The work provides a strong and openly available research artifact. A 3B-active model reaching 87.2 on LiveCodeBench v6 and 82.9 on IFBench, released with its SFT and RL data, is valuable to the community.
- The work provides a transparent stage-wise analysis of model performance. Table 1 tracks benchmark performance after each stage, while the math length-budget control (Fig. 2b) and grader calibration on IMO-ProofBench provide careful validation.
Critical weaknesses
- The SFT checkpoint already reaches 92.9 on AIME25, above Nemotron-3-Nano (89.1) and the final model (92.4) (Table 1). Because the SFT data also differ from Nano's, this comparison does not isolate the RL pipeline as Section 4 suggests. RL appears to contribute mainly to instruction following, alignment, long-context, and agentic tasks.
- Multi-domain RL is not compared with sequential or fully joint training, and MOPD is not compared with simpler recovery options such as checkpoint merging. The "6× fewer steps" comparison (Fig. 2c) also leaves out the cost of training the RLHF teacher.
- The medal results rely on large test-time scaling (e.g., 8,192 samples per round for IMO and up to 1,000 solutions per problem for ICPC), which the abstract does not mention. IMO P2 was scored by an LLM grader, and the gold-level total depends on that score.
- τ²-Bench and HLE use non-official protocols worth several points, while baselines use official numbers. Some details differ between sections, e.g., RLHF steps (30 vs. 25), MOPD learning rate (2e-6 vs. 3e-6), and KL usage. The 13K GPU-hour total also excludes SWE RL.
Questions for authors
- How does the model perform if the Cascade-1 recipe, or the pipeline without the multi-domain RL stage, is run from the same SFT checkpoint?
- Could the authors report the inference budget and official submission counts for each competition, explain how ICPC penalty time was computed, and provide human verification for IMO P2?
- Could the baselines be evaluated under the same τ²-Bench and HLE settings? Which benchmarks were used for decontamination, and were IMO 2025 problems filtered from the AoPS proof data?
2 comments
Official Comment by Authors (2/2)
Some details differ between sections, e.g., RLHF steps (30 vs. 25), MOPD learning rate (2e-6 vs. 3e-6), and KL usage. The 13K GPU-hour total also excludes SWE RL.
Sorry for the confusion .The RLHF stage runs for 25 steps, and MOPD uses the learning rate as 2e-6 without the KL penalty. We also thank the reviewer for noting the missing SWE-RL cost: this stage requires approximately 564 H100 GPU hours. We will double-check all training details and costs and update them in the revision.
How does the model perform if the Cascade-1 recipe, or the pipeline without the multi-domain RL stage, is run from the same SFT checkpoint?
Without multi-domain RL, capabilities on certain tasks, such as STEM MCQA, agentic tool calling in the Workplace Assistant setup, and structured output, would be compromised. We found that the improvement from multi-domain RL is mainly on τ²-Bench (51 to 57), but it hurts math performance. Therefore, if the model is trained with the Cascade-1 recipe, without multi-domain RL and MOPD, we expect its basic performance to be maintained, while its τ²-Bench score would likely be lower. The other main difference from the Cascade-1 recipe is the Math RL stage, which we removed in Cascade-2. Starting from the SFT checkpoint, which already reaches 92.9 on AIME25, we found that Math RL consistently failed to improve AIME25 further, so we dropped this stage from the pipeline.
Could the authors report the inference budget and official submission counts for each competition, explain how ICPC penalty time was computed, and provide human verification for IMO P2?
We thank the reviewer for pointing this out. The inference budgets for our IMO and IOI test-time scaling pipelines are ~800 H100 GPU hours and ~174 H100 GPU hours, respectively. For IMO, we submit one final solution per problem; for IOI, we submit at most 50 solutions per problem, strictly following the official competition rules. Regarding ICPC, we do not explicitly account for penalty time, because the 4th-ranked human team solved only 9 problems. Since teams are ranked first by the number of problems solved, with penalty time used only to break ties, solving 10 problems is sufficient to secure a gold medal that year regardless of penalty.
Regarding IMO 2025 Problem 2, our model’s solution relies on computation-heavy analytic methods rather than a pure-geometry solution. While such proofs are valid, they are tedious to verify by humans. To assess correctness, we submitted the proof and every formula to multiple frontier LLMs (GPT, Claude etc.) for independent verification over several trials, and it was judged correct in all cases. We will also release our full IMO 2025 proofs for verification by the community.
Which benchmarks were used for decontamination, and were IMO 2025 problems filtered from the AoPS proof data?
We thank the reviewer for raising this point. We performed decontamination checks between our training data and all reported benchmarks, covering knowledge, chat, and reasoning tasks etc.. Specifically, we applied strict filtering based on n-gram overlap detection to remove potentially contaminated samples. For competitive programming, our training data was collected before August 2024, which excludes all possible contamination. For competitive math, our proof training data is strictly separate from IMO problems. We will clarify these details in the revision.
Official Comment by Authors (1/2)
Thank you for those valuable comments and we would like address your concerns as below:
We would like to clarify that the primary goal of this paper is neither to claim superior performance on every benchmark nor to show that our model outperforms all other open-source models. Rather, we propose an efficient and effective training pipeline for enhancing multi-domain model capabilities, supported by comprehensive ablations of each training component. Notably, our RL approach yields the largest gains on reasoning tasks, where our model substantially outperforms models of comparable size and even approaches open-source models with roughly 10× more parameters.
Our multi-domain RL is fully joint RL training over multiple tasks from different domains that share similar characteristics.
We did not run a separate sequential comparison for this stage for two reasons. First, multi-domain RL is designed as a lightweight complement to the main reasoning stages (math, code, RLHF, IF, and SWE). It covers short-response capabilities that share the same length budget and similar verification cost, and it runs for only about 70 steps. For such compatible domains, the main motivation for grouping is training efficiency, and the blend gives consistent gains on MMLU-Pro, τ²-Bench, and IFBench. Second, our goal is to scale Cascade RL to more domains, and giving every new domain its own sequential stage would make the pipeline grow linearly with the number of environments. The more relevant question is therefore which domains can be safely grouped together. Here we did observe a clear boundary: adding math data to multi-domain RL lowers math accuracy, even with a longer math length budget (Fig. 2b), so we remove math from this stage.
Regarding the comparison between MOPD and checkpoint merging: we conducted preliminary experiments with checkpoint merging and found that it significantly degraded performance on reasoning benchmarks, so we dropped this approach early in development. Specifically, we used weight averaging to combine the math, code, RLHF, and IF teacher models. Compared with the individual teachers, AIME2025 dropped by 3.2%, LiveCodeBench v6 by 16.5%, and IFEval by 9.2%. We found weight merging difficult to tune, and its outcome hard to predict when combining capabilities from different domains, so we did not pursue it further.
Regarding the RLHF teacher cost in Fig. 2c: this is a good point, and we will clarify it in the revision. The main advantage of combining Cascade RL with MOPD is that checkpoints trained while exploring different Cascade RL paths are no longer wasted. Initially, we experimented with two branches, and we were then able to reuse a previously trained checkpoint as the teacher to fix certain aspects of the other path. This is what yields the 6× reduction in steps. We acknowledge, however, that this saving also depends on the cost of training the RLHF teacher, and we will state this explicitly.
We agree that the abstract should state explicitly that our medal-level results rely on test-time scaling, and we will revise it accordingly. We note that this practice is consistent with other open models reporting medal-level results; for example, DeepSeek-V3.2-Speciale samples 500 solutions per problem for IOI and uses a similar generate–verify–refine pipeline for IMO to achieve gold medals. Specifically, we estimated the compute required to achieve gold-medal performance on IMO and IOI: DeepSeek-V3.2-Speciale requires approximately 1,500 and 291 H100 GPU hours, respectively, whereas our pipeline requires only 800 and 174 H100 GPU hours, making it substantially more efficient.
We apologize for the confusion. We adopt a non-official evaluation protocol in order to match the format of our training data. To ensure a fair comparison, we re-evaluated our baseline model, Nemotron-Nano-v3, under the same updated setting: its τ²-Bench score improved from 49.0 to 54.1, and its HLE score from 10.6 to 11.4. Both remain lower than our model’s performance under the same evaluation protocol. We will update these numbers and clarify the evaluation setting in the revision.