- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes IMCD, a rollout-based fine-tuning framework for constrained diffusion models. The authors identify a mismatch between forward-noised states used during training and the states encountered during reverse-time sampling, which may limit the effectiveness of existing constraint optimization methods. To address this issue, IMCD performs full denoising rollouts during training and backpropagates the terminal constraint loss through the entire sampling trajectory. The framework further incorporates learnable constraint guidance and an EDM denoising objective to improve constraint satisfaction while preserving generation quality. Experiments on bouncing-ball simulation and traffic trajectory prediction demonstrate promising results in reducing constraint violations.
Critical strengths
The paper identifies a meaningful mismatch between training and sampling distributions in constrained diffusion models.
Critical weaknesses
-
The current evaluation is largely restricted to structured trajectory generation, leaving the generalizability of the proposed framework insufficiently explored. Although the paper evaluates both bouncing-ball simulation and real-world traffic data, both tasks involve relatively low-dimensional geometric trajectories with explicitly defined and differentiable constraints, such as distances, overlaps, and boundary violations. In contrast, constraints in more complex generative domains, such as realistic image generation, may involve semantic consistency, object relationships, or structural requirements that are difficult to express through differentiable loss functions. While the rollout-based training formulation is potentially general, the current experiments provide limited evidence of its applicability beyond geometric trajectory generation.
-
Backpropagation through the full denoising rollout introduces substantial computational overhead, while the efficiency and necessity of this training strategy remain insufficiently investigated. The constraint objective is evaluated only on the terminal generated sample, requiring a complete denoising rollout and backpropagation through all sampling steps for each optimization update. Each step also involves additional pretrained-denoiser evaluations and constraint-gradient computations. Although gradient checkpointing helps reduce memory consumption, the overall training cost may still be substantial, particularly for higher-dimensional generation or longer sampling trajectories.
Questions for authors
See weaknesses.
We thank the reviewer for recognizing the training-sampling mismatch we identify in constrained diffusion models and for the thoughtful feedback.
1. Generalization concern.
We emphasize that our work specifically targets hard-constrained generation, where the goal is to generate samples within a feasible set, rather than maximize a reward or preference score. In this setting, constraint violations constitute hard failures rather than gradual degradations in sample quality. Collision avoidance and drivable-area compliance in autonomous driving are representative examples. This problem formulation is also relevant to other domains, including human motion synthesis and robotic trajectory planning, where satisfying physical feasibility and collision-avoidance constraints is essential. Recent works have similarly explored constrained diffusion for these applications [1, 2].
Importantly, the geometric nature of our constraints does not make the evaluated problems low-dimensional or straightforward. Each bouncing-ball sample has 4000 dimensions, comparable to a 64×64 image. More importantly, our setting imposes strict feasibility requirements involving pairwise interactions across agents and timesteps. Unlike reward-based alignment in image generation, where incremental improvements in a reward score constitute progress, our objective is to drive constraint violations toward zero: even a single collision or off-road event can invalidate an otherwise plausible sample. This makes satisfying the constraints while preserving the underlying generative distribution a challenging problem, as also evidenced by the limitations of existing sampling-time baselines, including MPGD, FK steering, and D-Flow.
2. Backpropagation concern.
We refer the reviewer to our general response for a detailed discussion of training and inference costs. In particular, IMCD's peak training memory is no greater than that of DPOK and AM, despite backpropagation through the full denoising rollout. At inference, IMCD uses standard reverse denoising without additional optimization. Empirically, it achieves better constraint satisfaction while preserving distributional fidelity, demonstrating the effectiveness of this training strategy.
[1] Christopher JK, Baek S, Fioretto F. Constrained synthesis with projected diffusion models. Advances in Neural Information Processing Systems. 2024 Dec 16;37:89307-33.
[2] Liang J, Christopher JK, Koenig S, Fioretto F. Simultaneous multi-robot motion planning with projected diffusion models. arXiv preprint arXiv:2502.03607. 2025 Feb 5.