- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes Uncertainty-Aware Sequential Monte Carlo (UA-SMC), a projection-free framework for sampling from diffusion models under hard constraints. The authors observe that existing particle-based methods often rely on point estimates of the terminal state to construct intermediate feasibility potentials, potentially discarding particles that still have a substantial probability of satisfying the constraint. To address this limitation, UA-SMC interprets the exact intermediate potential as the conditional probability of eventual constraint satisfaction and approximates it using an uncertainty-calibrated sigmoid function. A practical time-dependent sharpness schedule is introduced to avoid estimating state-dependent uncertainty or differentiating the constraint function. The paper also provides theoretical bounds on potential approximation error, its effect on intermediate target distributions, and finite-particle sampling error. Experiments on an analytically tractable distribution, nonlinear dynamical systems, porous material generation, and text-to-image generation demonstrate improvements in constraint satisfaction and task-specific distributional fidelity over several existing methods.
Critical strengths
(1) A practically useful approach to handling uncertainty in constrained diffusion sampling. The paper identifies an important limitation of conventional point-estimate-based feasibility potentials: intermediate predictions may incorrectly eliminate particles that retain a meaningful probability of satisfying the terminal constraint. Interpreting the exact potential as a conditional feasibility probability provides a principled motivation for uncertainty-aware particle selection. The proposed sigmoid approximation and time-dependent schedule offer a computationally convenient implementation that does not require differentiating the constraint function, making the method applicable to non-differentiable and black-box constraints.
(2) Promising empirical results across diverse constrained-generation tasks. The paper evaluates UA-SMC on both analytically tractable distributions and more complex applications involving physical systems, material generation, and image synthesis. The controlled experiment provides a meaningful assessment of distributional accuracy against a known constrained target, rather than relying solely on constraint satisfaction. The broader experiments further demonstrate that the proposed approach can achieve favorable constraint satisfaction while maintaining task-specific fidelity. These results support the practical relevance of soft feasibility-based particle selection across different domains.
Critical weaknesses
(1) The relationship between the practical sampler and the exact hard-constrained target is not sufficiently established. Although the paper aims to sample from a hard-constrained distribution, the proposed algorithm uses a finite-sharpness sigmoid potential even at the terminal sampling step. Consequently, the limiting target of the implemented SMC procedure is generally a softly reweighted distribution rather than the exact distribution conditioned on feasibility. Increasing the number of particles does not eliminate this approximation bias. Furthermore, the theoretical justification of the Gaussian approximation relies on regularity and nondegeneracy conditions that are not sufficiently characterized. In particular, the first-order approximation can become degenerate when the constraint function has a vanishing gradient, while the paper emphasizes applicability to general non-differentiable and black-box constraints. These issues weaken the connection between the theoretical analysis and the stated hard-constraint sampling objective.
(2) The experiments do not sufficiently isolate the benefits of uncertainty-aware calibration from those of soft potential selection. The practical method replaces state-dependent uncertainty with a manually tuned time-dependent sharpness schedule, making it unclear how accurately the resulting potentials reflect the conditional uncertainty of individual particles. Moreover, a constant-sharpness configuration is used in one of the main application settings, suggesting that some of the observed improvements may arise from the sigmoid potential itself rather than uncertainty-dependent calibration. Although the paper compares against existing particle-based methods, more controlled comparisons against equally tuned constant-sharpness potentials are needed to establish the contribution of the proposed uncertainty mechanism. Additionally, distributional fidelity in several complex experiments is evaluated primarily through the marginal distribution of the constraint value, which does not necessarily establish fidelity of the full constrained sample distribution.
Questions for authors
(1) Exactness of the terminal constrained distribution. Does the implementation apply an exact feasibility indicator, a terminal importance correction, or an additional filtering step after the final sigmoid weighting? As described, the terminal potential remains , where denotes the sigmoid function and is the constraint threshold. For finite , this assigns positive weight to infeasible samples and therefore does not recover the exact hard-constrained target even with infinitely many particles. Could the authors clarify the actual terminal distribution and quantify the resulting approximation bias?
(2) Validity and scope of the Gaussian approximation. Could the authors clarify the regularity and nondegeneracy conditions required for the Gaussian approximation error to vanish as the posterior uncertainty contracts? In particular, when , the variance of the first-order approximation can vanish even though the true constraint-value error remains nontrivial. How does the theoretical analysis handle such cases, and to what extent do the stated guarantees apply when the constraint is non-differentiable or available only through black-box evaluations?
(3) Isolating the contribution of uncertainty-aware calibration. Could the authors provide controlled comparisons between the proposed time-dependent sharpness schedule and an equally tuned constant-sharpness sigmoid potential under identical computational budgets? Since a constant-sharpness configuration is already used in one of the application settings, it is difficult to determine whether the performance gains are attributable to uncertainty calibration or to the use of a smooth feasibility potential. Additionally, could the authors provide stronger distributional-fidelity evaluations beyond the marginal constraint-value distribution to establish that the generated samples approximate the intended constrained distribution?
5 comments
Response to Reviewer D3yC (2/3)
To address the reviewer’s concern about the contribution of the time-varying schedule, we conducted an additional ablation on the analytical experiment presented in Appendix B.2. We compared 27 logarithmically spaced constant-sharpness configurations against the original 27 time-dependent schedules. Apart from the sharpness parameterization, all configurations use the same sigmoid intermediate feasibility potential, terminal correction, diffusion model, number of diffusion steps, particle count, sample count, and resampling criterion. Additionally, this setting permits direct evaluation of total variation (TV) distance to the full two-dimensional hard-constrained target distribution, rather than relying only on the marginal distribution of constraint values.
| Method | Sharpness | CS | TV |
|---|---|---|---|
| Minimum-TV constant | |||
| Perfect-CS constant | |||
| Tuned schedule | , | ||
| Oracle sharpness | State-Dependent | ||
| The constant-sharpness configurations exhibit a clear constraint-satisfaction--fidelity trade-off. The minimum-TV constant achieves a mean TV of but only constraint satisfaction; conversely, the displayed constant-sharpness configuration achieving perfect constraint satisfaction has a mean TV . The practical time-dependent schedule however, attains both constraint satisfaction and a mean TV of , only slightly worse than the oracle state-dependent sharpness which achieves a mean TV of , without requiring derivatives or state-dependent uncertainty estimation. These results show that the improvement is not attributable solely to sigmoid smoothing; the time-dependent schedule achieves a substantially better feasibility--full-distribution-fidelity trade-off than any of the constant schedules. |
Response to Reviewer D3yC (3/3)
3. Regularity Conditions for Gaussian Error.
We appreciate the opportunity to clarify this point. To contextualize the new assumption, recall that our Gaussian approximation is based on the Taylor expansion
where collects the terms that are nonlinear in .
To state the regularity condition needed for as , we define where is the expected magnitude of the nonlinear remainder and is the variance of the linearized constraint-score error.
We revisited the derivation of , which now shows that this error is controlled by ; see the blue text in Appendix C. We therefore assume As when , this condition implies that .
This assumption lets us state the required condition directly in terms of the relative magnitude of the nonlinear Taylor remainder, rather than separately imposing first-order nondegeneracy. The latter setting is studied in [1, 2], which show that more refined techniques are generally needed when the first-order term is degenerate.
We also note that Algorithm 1 itself requires only evaluations of and is therefore applicable to black-box or non-differentiable constraints. The regularity condition above only makes explicit the local regime under which our Gaussian approximation admits a vanishing-error guarantee.
We hope these new results and revisions address the reviewer's concerns, and we would be grateful if they could be considered in the final assessment. We are happy to address your further comments.
Response to Reviewer D3yC (1/3)
We thank the reviewer for their thoughtful comments about our paper and address several of their points below.
1. Exact Hard-Constrained Terminal Distribution (W1, Q1)
We agree that a finite-sharpness sigmoid at the terminal step assigns nonzero probability to infeasible samples, and therefore does not recover the exact hard-constrained target even in the infinite-particle limit. To address this issue, we have revised the UA-SMC algorithm to use the exact feasibility indicator at the terminal step, while retaining the uncertainty-aware sigmoid potentials at intermediate denoising steps:
\begin{cases} \sigma(\alpha_t[V(\hat x_0(x_t))-\hat V]), & t>0,\ \mathbf 1_{C}(x_0), & t=0. \end{cases}$$ This modification restores the exact hard-constrained terminal target in the infinite-particle limit. In particular, because the incremental importance weights are constructed from ratios of consecutive potentials, the intermediate potentials telescope, yielding the terminal distribution $$\pi_0(x_{T:0})\propto p_\theta(x_{T:0})\mathbf 1_{C}(x_0).$$ Thus, under standard SMC consistency conditions, the particle approximation converges to the desired hard-constrained distribution as the particle population increases. We note the exact terminal correction has one failure mode: with finite particles, a run may contain no feasible terminal particles. In this case, every terminal weight is zero and the normalized terminal distribution is undefined. If at least one terminal particle is feasible, the indicator assigns zero weight to every infeasible particle; consequently, every sample drawn from the normalized terminal particle measure is feasible. If no terminal particle is feasible, all terminal weights vanish, and we record the run as a failure rather than defining a normalized output distribution. **Empirical validation.** We repeated our text-to-image experiments with the corrected terminal potential. We report the feasibility rate of the final selected output. Under the exact terminal indicator, whenever the terminal particle population contains at least one feasible particle, terminal resampling returns a hard-constrained output by construction. If no feasible terminal particle is present, all terminal weights are zero and the run is recorded as a failure. For Squirtle, the hard-terminal correction increases the final-output constraint-satisfaction rate from $92\%$ to $94\%$ while TOPIQ was essentially unchanged (0.7660 versus 0.7650). This improvement occurs because for two runs, the original finite-sharpness terminal potential selected constraint-violating outputs despite the presence of feasible particles. The indicator potential instead assigns these infeasible particles zero weight and selects only feasible ones. The remaining $6\%$ of runs contain no feasible terminal particles. For Hulk, the final-output constraint-satisfaction rate remains $97\%$, with no decrease in TOPIQ. We have updated Algorithm 1 to make the terminal correction and its implications explicit. ---