- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper proposes CT-OPD, a distillation method for diffusion vision-language models that applies masks from the current student’s generation trajectories to teacher responses, using teacher tokens to provide consistent visible context and prediction targets at masked positions.
Critical strengths
- Broad empirical validation. The evaluation covers dense, sparse, and unified diffusion VLMs across multimodal understanding, reasoning, and image generation. CT-OPD improves average understanding performance over the matched random-mask baseline on all evaluated backbones and improves all three image-generation metrics on MMaDA, supporting its applicability across architectures and output modalities.
- Carefully controlled and informative ablations. The random-mask baseline shares teacher responses and matches stage-wise mask counts and update budgets, helping distinguish the method’s contribution from stronger teacher supervision alone. Additional controls examine teacher-consistent reconstruction, online trajectory refresh, and prompt–mask matching, providing targeted empirical support for the individual design choices rather than relying solely on aggregate benchmark improvements.
Critical weaknesses
Weaknesses
-
Unclear novelty over adaptive masking. PUMA [1] and LIFT [2] already combine model-dependent position selection with reference-token supervision. CT-OPD transfers masks from student trajectories to teacher answers, but it is unclear why this is better than selecting masks directly on teacher answers. Comparisons with these methods under the same supervision and compute budget are needed.
-
Limited evidence for the proposed mechanism. The diagnostic uses training prompts and teacher-reconstructed contexts. Although the benchmark results show improvements, this diagnostic does not directly test whether the method improves continuation from the student's own potentially incorrect states. Evaluating this on held-out prompts would provide stronger evidence.
-
Unclear value of the extra computation. The Random baseline also runs student rollouts to match mask counts, although random masking can be implemented without full rollouts. Therefore, this comparison does not show whether online trajectory collection is worth its cost. Please compare performance under the same total compute budget, including rollout costs, against rollout-free masking and the frozen-trace variant.
-
The counterfactual framing needs clarification. The method replaces student-generated visible tokens with teacher tokens while keeping the original masks. However, changing these tokens may also change which positions the student would reveal next. Please distinguish this fixed-mask reconstruction from a trajectory the student would generate under the modified context, and explain what the counterfactual interpretation adds beyond the reconstruction procedure.
References
[1] Stop Training for the Worst: Progressive Unmasking Accelerates Masked Diffusion Training. arXiv:2602.10314, 2026.
[2] Learnability-Informed Fine-Tuning of Diffusion Language Models. arXiv:2605.22939, 2026.
Questions for authors
Please address the questions and concerns raised in the Weaknesses section.
6 comments
Response to LFGT (2/2): held-out states, cost, and counterfactual meaning
Held-out prediction.(Weakness 2) We evaluated 512 prompts excluded from post-training, checking overlap by image and question identities. A frozen Base supplies common states. Reconstructed-state NLL is 3.2781 for CT, 3.4146 for Random, 3.3327 for Endpoint-only, and 4.4733 for Direct Trace-Target. CT−Random is −0.1366 [−0.1699, −0.1024], establishing that the reconstructed-state effect extends beyond training prompts.
We measured full-run training cost, including online trajectory collection.(Weakness 3) The table combines four-GPU update times with full-run GPU-hours per 1,000 scheduled training prompts:
| Method | seconds/update | Full-run GPU-h/1k prompts |
|---|---|---|
| Native SFT | 16.32 | 3.56 |
| CT-OPD | 30.18 | 8.54 |
| MDPO | 88.98 | 23.67 |
| MaskGRPO | 58.88 | 17.54 |
Four-GPU timings use A100 PCIe 80GB GPUs, BF16, and ZeRO-2, including trajectory collection and optimization. SFT/CT updates contain 16 supervised states, RL updates contain four prompts with four sampled responses each. CT timing averages complete four-update cycles. Means cover 36 SFT updates, 13 CT cycles, and 20 updates per RL method after warm-up. These short-run timings and the full-run allocation costs measure different scopes.
Costs include the complete training allocation, model initialization, checkpointing, and final export. CT reuses each trajectory for four updates, while the RL recipes sample four completions per prompt.
CT-OPD requires 8.54 GPU-hours per 1,000 prompts in the completed run, compared with 23.67 for MDPO and 17.54 for MaskGRPO. Its additional cost over SFT purchases current-model trajectories whose masks support four supervised updates. This reuse amortizes trajectory collection across the four training stages. Appendix E.6 includes the same cost table and measurement boundaries.
The counterfactual intervention fixes positions and changes visible content.(Weakness 4) Let Z be the student's free trajectory, M_t its unresolved mask, and the teacher endpoint:
The question is what the student predicts at these same unresolved positions when visible tokens come from one coherent teacher response. The intervention happens after mask collection. Re-executing the reveal policy under replaced tokens would select another mask and answer a different question; the teacher-conditioned experiment tests that alternative selection context. On-policy collection supplies the masks, and reconstruction supplies the learning inputs. Section 3.2 makes this sequence explicit.
Thank you for the additional experiments and clarification. I understand that the masks reflect the student's generation history. Once the student-generated visible tokens are replaced with teacher tokens, why are these masks still more useful for training than masks selected directly under teacher-provided context?
Response to LFGT (1/2): adaptive masking and complete method results
Thank you for highlighting PUMA and LIFT as closely related works. We have cited and discussed both methods in the revised paper.
CT transfers free-generation reveal decisions into coherent supervision.(Weakness 1) PUMA progressively reveals reference tokens using a model-dependent policy. LIFT selects supervision using reference-token confidence and diffusion time. CT first collects masks from the student's free trajectory, then reconstructs their visible context and targets from a teacher endpoint. Retokenized teacher responses can provide reference data to all three methods, CT separates free-running position selection from endpoint-based state construction. Provisional tokens influence the history encoded in the collected masks.
Complete implementations and training runs.(Weakness 1) We implemented PUMA's progressive transitions and schedule and LIFT's two-pass selection and loss on LLaDA-V. The runs share teacher endpoints, initialization, global batch 16, and 11,140 updates. Checks against released implementations cover 360 PUMA transition cases and 90 LIFT mask, loss, and gradient cases.
Direct selection under teacher tokens.(Weakness 1) The LaViDa teacher-conditioned control selects positions under visible reference tokens while matching the current free trajectory's active counts at every reverse transition. A fixed-position control reveals a left-to-right reference prefix.
These studies retain each method's masking rule and objective under the shared update budget. They specify the practical alternatives to the free-trajectory collection and subsequent reconstruction used by CT.