- Rating
- 3
- Confidence
- 3(+1)
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
TAD trains diffusion language models using teacher trajectories guided by reference answers. It applies hard supervision to tokens decoded soon and soft supervision to those decoded later. Experiments on LLaDA and Dream show gains in average accuracy and decoding efficiency over the base models on math and code tasks.
Critical strengths
- The method uses different training targets depending on when each token will be decoded. This provides a simple way to balance speed and accuracy.
- Results across two model families support the main claim that TAD can improve average accuracy and decoding efficiency together.
Critical weaknesses
- The temporal split follows the teacher’s decoding order, but its suitability for the student’s parallel decoding remains unclear.
- Table 3 supports using soft KL for distant tokens. However, the paper does not directly show that the gains come from preserving uncertainty in these tokens.
Questions for authors
How are invalid teacher trajectories filtered? Does this include checking final answers or running code tests before using the trajectory tokens as hard targets?
3 comments
My concerns have been fully addressed, and I would like to keep my score at a positive 3.
Thank you very much for your positive assessment, and we sincerely appreciate your time and thoughtful review.
Rebuttal
We sincerely thank the reviewer for the positive and encouraging assessment of our work. We are particularly grateful for the recognition that TAD leverages "different training targets depending on when each token will be decoded" to provide "a simple way to balance speed and accuracy."
We also thank the reviewer for raising these thoughtful questions and we address them below.
W1: Suitability of the temporal split for the student's parallel decoding.
We agree that the key consideration is whether the temporal partition derived from the teacher's reveal order is also meaningful for the student's prediction and parallel decoding behavior. Importantly, our temporal partition is not based solely on the teacher's decoding order. As shown in Figure 3(b), we explicitly measure the student's confidence in predicting teacher trajectory tokens at different temporal distances. We observe that the student's confidence is high for near tokens and progressively decreases as the teacher's reveal distance increases. This indicates that tokens revealed earlier by the teacher are also those that the student can predict more confidently, whereas distant tokens remain less predictable to the student. Therefore, the teacher's temporal order serves as a reliable proxy for how confidently the student can predict each token.
W2: Whether soft KL benefits from preserving uncertainty in distant tokens.
To directly verify that the gains of soft KL come from preserving uncertainty in distant tokens, we analyze the prediction statistics on 100 sampled trajectories. First, we measure the entropy of the teacher's output distributions. Distant tokens show much higher uncertainty in the teacher (average entropy of 2.770) than near tokens (0.844). This confirms that the teacher's predictions for distant tokens are inherently uncertain and should not be collapsed into one-hot targets. Second, we compare students trained with Hard-Hard (HH, applying hard cross-entropy to all tokens) and Hard-Soft (HS, our TAD method) on distant tokens using four metrics:
(1) Student Predictive Entropy: The average entropy of the student's output distributions, measuring prediction uncertainty.
(2) Mean Confidence: The average maximum softmax probability, indicating how peaked the predictions are.
(3) Teacher–Student KL: The KL divergence between the teacher's and student's output distributions.
(4) Token Agreement: The top-1 matching rate between the student's predicted tokens and the teacher's trajectory tokens.
Despite producing more concentrated predictions, HH exhibits approximately 2× higher KL divergence and 9.7 percentage points lower token agreement than HS. This suggests that hard-only supervision can lead to overconfident and poorly aligned predictions on distant tokens, whereas soft KL better preserves the teacher's predictive information. These results support our motivation that distant tokens benefit from preserving the teacher's predictive distributions rather than being directly collapsed into hard one-hot targets. We will incorporate these additional analyses into the revised manuscript to better explain the rationale behind TAD's hard–soft supervision design.
Q1: Filtering of invalid teacher trajectories.
We apply task-specific validation to filter invalid teacher trajectories before using them for student training. For math tasks, we check whether the final answer extracted from each generated trajectory is correct by comparing it against the reference answer. Trajectories with incorrect final answers are discarded. For code generation tasks, we execute the generated programs against the corresponding test cases and retain only trajectories whose generated code passes the tests. We will clarify these filtering procedures in the revised manuscript.