- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes to use a Stein denoiser as an approximate projection operator to map gradient-updated samples back toward the feasible set. It analyzes the approximation error, and the convergence of the method. It considers linear subspaces, compact convex sets, and compact Riemannian manifold.
Critical strengths
The paper provides theoretical analyses of the Stein denoiser as an approximate projection onto the feasible set. The analyses include linear subspaces with Gaussian data, compact convex sets, and compact Riemannian manifold. It also develops convergence analyses for DCG under the stated assumptions.
Critical weaknesses
For the manifold setting, the analysis assumes that the sample is already close to the manifold. It doesn't analyze the case where the sample is far from the manifold. It does not show how the generation process reaches this region from pure noise.
Also the convergence bound only guarantees that there exists a good point along the trajectory, but this does not guarantee that the final generated sample satisfies the same bound.
Questions for authors
Could the authors clarify more about the relationship between DCG and plug-and-play (PnP) proximal gradient methods? Given the extensive literature on PnP convergence, please explain which algorithmic and theoretical contributions go beyond existing results.
2 comments
I thank the author for the detailed response. I acknowledge the technical challenges involved in extending the analysis to nonlinear manifolds from a far point and analyzing the best iterate. The authors have addressed my concerns regarding the relationship to PnP. Therefore, I would like to raise my score to 3.
Response to Reviewer kjMY
We thank the reviewer for recognizing our theoretical contributions, particularly the projection-approximation analysis of the Stein denoiser across different feasible geometries. We address the two limitations and the relationship to PnP-PGD below.
1. Local manifold convergence and best-iterate guarantees
(a) Local convergence and initialization from pure noise.
We acknowledge that our manifold convergence guarantee is local. This restriction reflects a fundamental geometric difficulty: for general nonlinear manifolds, the nearest-point projection is only guaranteed to be uniquely defined and smooth within a tubular neighborhood (Federer, 1959, Section 4). Outside this neighborhood, the projection may be nonunique, so the geometric estimates underlying our analysis cannot be directly extended globally. Related methods also assume near-manifold initialization, including score-based optimization on learned manifolds and landing gradient descent on the Stiefel manifold (Kharitenko et al., 2026, Theorems 3 and 5, Ablin et al., 2024, Proposition 9).
Our contribution is to establish convergence within this neighborhood while accounting for both optimization progress and time-varying denoising errors. Establishing convergence from arbitrary Gaussian initialization would additionally require analyzing how the global reverse diffusion dynamics enter this neighborhood, which is beyond our current theoretical scope. Importantly, our experiments initialize DCG directly from Gaussian noise without enforcing this local condition, demonstrating its effectiveness in practice.
(b) Best-iterate versus last-iterate convergence.
We agree that our finite-time nonconvex convergence guarantee applies to the best iterate, rather than necessarily the final generated sample. Such guarantees are standard in nonconvex manifold optimization. They appear in Riemannian gradient and proximal-gradient methods (Boumal et al., 2019, Section 2, Chen et al., 2020, Theorem 5.5) and in methods that allow off-manifold iterates (Schechtman et al., 2023, Theorem 6, Ablin et al., 2024, Proposition 9, Kharitenko et al., 2026, Theorem 5). In general, bounding the sum of stationarity residuals guarantees the existence of a good iterate, but does not imply the same bound for the final iterate without additional assumptions.
Our contribution is to establish this finite-time guarantee for gradient-guided diffusion while simultaneously controlling the Riemannian stationarity residual and distance to the learned manifold under inexact, time-varying denoising. Our experiments evaluate the final generated samples, while extending the theoretical guarantee to the last iterate remains an interesting direction for future work.
2. Relationship between DCG and PnP-PGD
We thank the reviewer for raising this question. We are aware of the PnP-PGD literature and have already discussed its relevance in Section 3 and Appendix A of our original submission. However, classical PnP-PGD does not explicitly incorporate the gradual reverse denoising dynamics of generative diffusion models, and adapting it to gradient-guided diffusion is not straightforward.
Our contribution is to develop a diffusion-compatible gradient-guided optimization algorithm, rather than simply reinterpret existing PnP-PGD methods. In particular, DCG's relaxation coefficient ϵt=1−σtσt−1 and time-varying Stein denoiser πt are derived from the diffusion noise schedule, rather than introduced as arbitrary algorithmic choices. We further establish the denoiser's approximate projection properties and derive optimization and feasibility guarantees that are not covered by existing PnP-PGD analyses.
We refer the reviewer to our detailed response to Reviewer B4oB (Points 1 and 2) for a more extensive discussion of the algorithmic novelty and theoretical distinctions, including a comparison with related PnP literature.
We hope our response addresses your concerns. If these clarifications resolve your questions and concerns, we would be very grateful if you would consider raising your score.