- Rating
- 2
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper applies RL to post-train dLLMs for the CUDA kernel generation task. It combines curated SFT data with a curriculum progressing from scaffolded kernel infilling to complete generation, and from simple to complex tasks.
DICE first learns from examples of CUDA code. During RL training, it generates implementations that are compiled and tested. Successful attempts receive positive feedback, encouraging the model to generate correct code.
Training has two phases. First, the model writes only the core computation inside a supplied program scaffold. This reduces mistakes in the surrounding code and limits shortcuts such as simply calling the original PyTorch operations. Second, it generates the complete program, including the code that compiles and calls its CUDA implementation. The idea is to learn the central skill first, then handle the whole task. RL rewards correctness; execution speed is encouraged through the examples used in the initial training.
Critical strengths
Improves CUDA generation correctness across several settings. Includes useful ablations and output inspection to identify implementations that bypass custom CUDA kernels.
Critical weaknesses
- Limited novelty: The method mainly applies familiar post-training techniques to dLLMs, with little new methodology.
- Limited diffusion-specific contribution: The architecture, decoding method, and RL algorithm come from prior work. The proposed curriculum also works with AR models.
- Weak supporting analysis: The experiments do not show which diffusion properties drive the gains or separate the curriculum's effect from additional training and data.
Baselines and comparisons: The paper includes many AR and diffusion baselines, including Qwen3 trained with the same curriculum. However, different output budgets and inference engines complicate comparisons. The ablations do not fully control for additional training and data exposure.
Taken together, these limitations make the contribution insufficient for acceptance in its current form. I recommend rejection in the current form.
Questions for authors
None.
2 comments
Response Part 2/2
Curriculum components. Our curriculum contains two key components: data scheduling and a kernel infilling stage followed by end-to-end generation. Tables 7 and 15 provide component-level evidence for their respective roles across the three model scales:
-
The RL baseline and data-scheduling variant use the same SFT initialization and end-to-end RL budget. This comparison isolates data scheduling under a matched training budget.
-
The comparison between SFT and SFT + kernel-infilling checkpoint measures the incremental effect of introducing this stage. It improves overall execution correctness, although the speed metrics do not improve uniformly.
-
Continuing from the infilling checkpoint to end-to-end generation produces the strongest overall performance, supporting the role of the final stage in translating the scaffolded initialization into complete kernel-generation capability.
Baselines and comparisons. Output budgets. The different maximum output lengths in the task evaluation are intentional and follow the generation characteristics of each model family. Reasoning models require a larger maximum budget to avoid truncating their reasoning traces and CUDA implementations, whereas fixed-length diffusion models such as LLaDA and Dream become prohibitively expensive and may produce repetitive content at unnecessarily long output lengths. For models supporting EOS termination, the specified token budget is only an upper bound, and generation stops when EOS is produced. Table 13 further shows that reducing cudaLLM’s maximum generation length from 32,768 to 4,096 substantially degrades its results, indicating that a uniformly short budget would disadvantage long-reasoning models. Conversely, the length-sensitivity results in Table 16 show that increasing the fixed generation length of LLaDA-Instruct and LLaDA-1.5 from 1,024 to 4,096 does not yield an overall performance improvement. Together, these results motivate the use of model-compatible output budgets rather than imposing a single generation length.
Inference backends. The evaluated model families use different decoding procedures and attention mechanisms, and a single equally optimized backend is not available for all evaluated decoding algorithms under our experimental setup. We therefore use an optimized and model-compatible inference backend for each model family. We clarify that the inference engines reported in Figure 1 are used only for measuring inference throughput and are not involved in the KernelBench evaluation.
Ablation controls and data exposure. We appreciate this concern. Our paper groups several ablation analyses. These experiments address different questions:
-
Table 5 uses the same SDAR-Chat-4B model and SFT configuration to examine how different speedup thresholds affect the resulting dataset and downstream performance. Thresholding changes both dataset composition and size, this experiment therefore characterizes the trade-off between the performance quality of the retained kernels and the quantity of training data.
-
Table 6 uses the same SDAR-Chat-8B model and SFT configuration to compare training on the cudaLLM, ConCuR, and CuKe datasets. It evaluates the practical quality–quantity trade-off among the complete datasets, rather than constituting a size-matched comparison.
-
Tables 7 and 15 decompose the training pipeline into SFT, single-stage RL, data scheduling, kernel infilling, and the complete BiC-RL pipeline across the 8B, 4B, and 1.7B scales. These variants share the same SFT initialization and evaluation protocol.
-
Table 8 compares SDAR and Qwen3 using the same CuKe SFT data, RL data, and curriculum structure. Only model-compatible modifications required by their different generation mechanisms are retained. This provides a comparison under closely matched post-training exposure, although it may not isolate the generation paradigm as the only causal factor.
To examine SFT data exposure more directly, we additionally train SDAR-Chat-4B and Qwen3-4B using 25%, 50%, and 75% of CuKe. At each fraction, the two models receive the same number of training examples. The results are reported in Table 10 and Figure 6 of Appendix A.2. Despite some non-monotonicity, SDAR exhibits more favorable limited-data adaptation under these matched data budgets.
In conclusion, Tables 5–6 evaluate complete data-curation choices, Tables 7 and 15 analyze the stage-wise training pipeline, Table 8 provides a matched post-training comparison across model families, and the new data-scaling experiment directly examines the effect of SFT data exposure.
Thank you again for the constructive feedback. We hope the additional analyses and clarifications address your concerns.
Response Part 1/2
Dear Reviewer QPki,
Thank you for the detailed and constructive review. We address each concern below and have revised the manuscript with additional analyses and clarifications.
Weaknesses1: Limited novelty.
Performance-oriented data construction. CuKe is not obtained by merely enlarging or concatenating existing datasets. Starting from ConCuR, we re-measure candidate kernels under a consistent execution environment and add 1,425 PyTorch–CUDA pairs selected using a strict 2.0× speedup threshold, together with 36 execution-validated structural examples. Tables 5 and 6 evaluate the resulting quality–quantity trade-off and the effectiveness of the complete curated dataset.
CUDA-specific RL curriculum. BiC-RL introduces a task-specific curriculum designed around common CUDA-generation failure modes. During kernel infilling, an executable scaffold fixes the imports, compilation and binding logic,
ModelNewwrapper, and invocation path, while the model generates only the missing CUDA/C++ core. This reduces the initial exploration space and restricts the three shortcut patterns described in Section 4.2. The subsequent end-to-end stage then restores responsibility for generating the complete program. Tables 7 and 15 show that, relative to single-stage RL, the complete curriculum improves 20 of 27 scale–level–metric comparisons and 7 of 9 execution-correctness comparisons. Table 16 provides additional evidence consistent with the intended role of the scaffold in reducing invalid CUDA-generation shortcuts.Specialized dLLM evidence. To the best of our knowledge, DICE is the first specialized diffusion-LM family trained and systematically evaluated for CUDA kernel generation across 1.7B, 4B, and 8B scales. After the complete training pipeline, the total number of correct kernels increases from 0 to 35, 8 to 57, and 8 to 89 relative to the corresponding SDAR base models, respectively. We also evaluate DICE against both autoregressive and diffusion baselines rather than presenting specialization results for only a single model or scale.
Weaknesses2: Limited diffusion-specific contribution.
Our diffusion-specific contribution lies in the systematic specialization and evaluation of an SDAR-based dLLM family for CUDA kernel generation.
Matched post-training comparison. Table 8 compares DICE with Qwen3 under closely matched post-training data and curriculum settings. DICE achieves higher aggregate execution correctness at all three scales, even though the original SDAR checkpoints are weaker than the corresponding Qwen3 checkpoints.
Limited-data adaptation. Table 10 and Figure 6 compare SDAR-Chat-4B and Qwen3-4B using identical CuKe subsets and SFT configurations at each data fraction, providing additional evidence that the evaluated diffusion family adapts more favorably under limited task-specific data.
Practical inference evidence. Figure 1 and Table 9 show that DICE retains favorable generation throughput across multiple model scales and batch sizes, demonstrating the practical efficiency associated with its diffusion-style parallel decoding.
Weaknesses3: Weak supporting analysis.
dLLM evidence. In SDAR, block diffusion, iterative denoising, and the associated decoding procedure are jointly encoded in the pretrained checkpoint. Replacing one of these components would therefore constitute a different trained model rather than a controlled removal from an otherwise unchanged checkpoint. Accordingly, we evaluate their effect through closely matched model-family comparisons. Our evidence therefore characterizes the adaptation behavior of the SDAR-based diffusion family under closely matched post-training conditions.
Table 8 compares DICE with Qwen3 using closely matched post-training data and curriculum settings, providing model-family-level evidence for their different adaptation behaviors.
Table 10 and Figure 6 further compare SDAR-Chat-4B and Qwen3-4B using the same CuKe subsets and SFT configurations at each data fraction, showing more favorable limited-data adaptation for the dLLM family.
Together, these results provide complementary evidence for the practical suitability of the SDAR-based diffusion family under the evaluated CUDA-generation setting.