- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper proposes Pareto-front Guided Diffusion (PGDiff) for diffusion-based generation under multiple constraints. During training, the method applies multiple-gradient descent (MGDA) to noisy samples and trains a ProjectionNet to predict the resulting corrected states. During sampling, this network adjusts the current sample before each denoising step. The framework aims to coordinate competing constraint objectives while preserving sample fidelity. The authors evaluate PGDiff on simulated path planning and field generation for the Burgers, Poisson, and Helmholtz equations, reporting improvements in several constraint-related metrics.
Critical strengths
-
Relevant and important problem. The paper addresses how to incorporate multiple, potentially competing constraints into diffusion-based generation while maintaining sample quality. This is a widely studied and practically important problem, making the proposed direction relevant to the generative modeling community.
-
Simple method with empirical validation across several examples. PGDiff has a straightforward design that trains a ProjectionNet to approximate the results of multi-objective optimization and applies the learned correction during sampling. This avoids explicitly running the iterative optimization at inference time. Experiments on simulated path planning and several PDE systems provide empirical evidence of improvements in constraint-related metrics, supporting the potential usefulness of the approach across different settings.
Critical weaknesses
-
Limited demonstrated novelty and insufficient baseline coverage. The core method combines multi-objective gradient guidance with a network trained to approximate the resulting correction. Guidance during diffusion sampling is already widely studied, but the paper does not clearly establish its technical advance over closely related approaches. The introduction broadly criticizes post-generation and penalty-based methods, whereas the path-planning experiments compare only against DDPM, PDM, and MPD. Comparisons with closely related multi-objective diffusion guidance methods are needed to establish the advantages of the proposed approach. These limitations make it difficult to assess the significance of the contribution.
-
Claims about real-world physical feasibility exceed the experimental evidence. The paper repeatedly emphasizes physical feasibility and real-world applications, but its experiments are limited to simulated path planning and numerical PDE tasks. These experiments evaluate satisfaction of the modeled constraints, which is insufficient to establish feasibility in real physical systems. Consequently, the broader claims about practical applicability remain inadequately supported. The authors should clarify the scope of their validation and revise the narrative to align with the available evidence.
Questions for authors
-
What is the specific advance over existing constraint-aware diffusion methods, please compare to more relevant baselines.
-
Can you report the Prior Loss results introduced in Section 4.2 to assess whether constraint improvements come at the expense of sample fidelity?
-
Are constraint residuals evaluated on noisy states or estimated clean samples? How is constraint guidance adapted to noise level, particularly during early denoising?
-
What values of are used in each experiment, how are they selected, and how sensitive are the results to this choice?
3 comments
Q4: Constraint Evaluation on Noisy States
In PGDiff, MGDA is initialized and computed from the noisy diffusion state . Therefore, the proposed multi-objective optimization operates on intermediate diffusion states rather than relying estimated clean samples. We would also like to clarify the primary research focus of this work. Our objective is to investigate how multiple physical constraints can be jointly optimized through Pareto-based optimization and how this multi-objective optimization can be integrated into diffusion model training. Accordingly, our main constributions concern the balance of multiple constraint objectives, K-step intermediate-state optimization, and its learned implementation for efficient generation. The physical constraints across different noise levels is a related but different research question. In future work, we plan to explore the mechanism and approach about the physical constraints adapted to noise level.
Q5: Sensitivity Study the MGDA iterations
We further study the effect of varying MGDA iterations.
| Metric | K = 1 | K = 3 | K = 5 | K = 8 | K = 10 | K = 15 |
|---|---|---|---|---|---|---|
| Path Length | 96.03 | 98.08 | 98.11 | 97.98 | 97.05 | 97.80 |
| 2.20 | 0.22 | 0.19 | 0.13 | 0.13 | 0.19 |
The results show that a single MGDA iteration is insufficient in the setting, as the number of iterations increases, the results of both indicators tend toward normality and improvement. When , the results exhibit relatively limited variation, increasing beyond this range does not consistency improve the final results. These observations support our motivation for performing multiple MGDA iterations to progressively optimize intermediate states toward Pareto stationaity. Meanwhile, they suggest diminishing empirical benefits from increasing the optimiaztion budget beyond a certain range of iterations.
Thank you for the patient responses and additional experiments. However, several concerns remain:
- Evidence that improved constraint satisfaction preserves sample fidelity remains insufficient.
- The effect of applying constraints directly to highly noisy states remains insufficiently justified.
- Claims about real-world feasibility still exceed the scope of the numerical and simulation evidence.
These concerns continue to affect my assessment, so I maintain my original rating.
We thank the reviewer for feedback.
Q1: Novelty and Comparisons with Related Methods
Our method uses K-step MGDA to progressively optimize each intermediate diffusion state toward Pareto stationarity. PGDiff explicitly constructs an intermediate optimization trajectory: ztk+1=ztk−γdtk,k=1,…,K. Unlike simply increasing the magnitude of a single guidance update, PGDiff recomputes the MGDA direction at every iteration, allowing diffusion trajectory to continuously adapt to the changing multi-objective gradient structure. We do not merely aim to incorporate a corrective direction favorable to physical objectives during the reverse diffusion process, but rather hope that each diffusion timestep includes a relatively comprehensive local multi-objective optimization process. Moreover, a single correction may be difficult to sufficiently reduce multiple constraint violations when the state is far from Pareto stationarity, as can also be observed in the subsequent sensitivity study regarding K. Meanwhile, unlike methods such as guidance during diffusion sampling, PGDiff introduces multi-objective optimization into the training process. We construct Pareto intermediate states through MGDA and jonitly train the diffusion model and ProjectionNet to learn the corresponding optimization mapping. We find that our method has significant advantages over guided methods during sampling in terms of efficiency, as can be seen in the following table.
To further demonstrate these advantages, we conduct additional study: (1) Weighted Diffusion, which combines multiple objectives through weighted gradient optimization instead of MGDA; (2) Inference-time MGDA, which performs MGDA directly during sampling; (3) PGDiff, which is our method.
The results show the inference time of our method is nearly identical to weighted diffusion, while achieveing shorter path length and smaller constraint violation, indicating our method can achieve a more favorable balance between collision avoidance and path length. And PGDiff achieves performance comparable to explicit Inference-time MGDA, although our method exhibits slight limitations compared to inference-time MGDA in both path length and CV, it demonstrates significant advantages in terms of inference time.
Q2: Physical Feasibility
We would like to emphasize that our experimental design intentionally includes two representative classes of physcial constraints problems, covering both relatively simple and more complex scenarios. The path planning experiment provides an intuitive and interpretable setting for evaluating physical feasibility through geometric constraints. The PDEs such as Burgers, Poisson, and Helmholtz experiments represents more complex physics constrained generation tasks. These problems involve governing partial differential equations and boundary conditions, requiring generated fields to satisfy multiple mathematical descriptions of phyics. These two classes of experiments therefore provide representative evidence of the framework's applicability to satisfy physical constraints across tasks of different complexity. And we think these experiments conduct a meaningful validation of the proposed framework across representative physical problems. In future work, we plan to extend PGDiff to additional engineering applications and incorporate more experiments of real physical systems to further evaluate its practical applicability.
Q3: Clarification of Prior Loss
We need to clarify that the reference to "Prior Loss" in Section 4.2 was accidentally retained from an earlier draft and does not correspond to an implemented evaluation metric in our PDEs experiments. We apologize for this editorial mistake. Specifically, the datasets used in our PDE experiments consist of numerical solutions generated by PDE solvers, which satisfy their prescribed governing equations and boundary conditions under a small range of errors. Therefore, in the ideal setting, the underlying data distribution is itself physically consistent. A diffusion model trained on physically consistent samples may still generate outputs that violate the corresponding constraints, motivating the proposed approach. We will remove the incorrect reference to Prior Loss and ensure that the reported conclusions aligh with actual evaluation metrics.