The proposed update incorporates the objective gradient inside the denoising step, yielding an inference-time method that uses only a pretrained denoiser and gradient evaluations and is analyzed as an inexact projected-gradient method for constrained optimization over learned feasible geometries.
Abstract
Diffusion models are increasingly used not only for sampling from learned data distributions, but also for generating samples that optimize task-specific objectives. A common approach is to guide the reverse diffusion process using gradients of an external objective. However, when the data distribution is supported on a structured feasible set, such as a manifold or a constraint set, gradient guidance can move samples away from the learned data geometry. In this paper, we study a simple projected-gradient-guided diffusion update based on the observation that the Stein denoising operator can act as an approximate projection onto the data geometry. The proposed update incorporates the objective gradient inside the denoising step, yielding an inference-time method that uses only a pretrained denoiser and gradient evaluations. We analyze this update as an inexact projected-gradient method for constrained optimization over learned feasible geometries. Our theory covers three settings: linear manifolds, compact convex feasible sets, and compact Riemannian submanifolds. In all these settings, we prove descent and finite-time convergence guarantees. Numerical experiments support the theoretical interpretation and illustrate how the proposed update balances objective descent with preservation of the learned geometry.
MoNO is proposed, a training-free method that performs Manifold-constrained Noise Optimization on a low-dimensional, quality-stabilizing noise manifold that combines Riemannian updates on an affine low-frequency sphere to preserve prior likelihood and fix unstable high-frequency components by construction.
Qi-Tan Shi, Cheng Jin, Zi-Yuan Liu et al.· arXiv.org· 1 citation
Observation Operator Diffusion is proposed, a unified framework that aligns both the supervision trajectory and feature refinement with the intrinsic recovery order of image structures and introduces GL-CoDA, a decoder that injects scale-specific Gaussian-Lanczos observations across decoding stages for coarse-to-fine f...
Shaojie Guo, Li-Chen Ma, Haoyang Tong et al.· 1 citation
This article derives a projected gradient flow characterized by tangent and normal cone decompositions, which capture the local geometry of the constraint set and shows that constraint geometry continuously filters gradient directions along the optimization trajectory, leading to a trajectory-dependent implicit regular...
GSDSplit+ is introduced, a splitting method built upon PnPSplit+, in which the generic denoising block is replaced by a relaxed Gradient Step Denoiser, which retains explicit Poisson fidelity updates.
This work defines an explicit surrogate posterior path and derives the Posterior-Dynamics Implicit--Explicit sampler (PD-IMEX), a stable method using one score evaluation per diffusion scale and an implicit data-consistency update, and derives continuous posterior dynamics.
Zhao-Qiang Liu, T. Pang, Ruibing Wang et al.· 1 citation
A minimal-gradient subspace method for unconstrained optimization of SPD quadratics, which attains the highest success count, whereas L-BFGS requires fewer median gradient evaluations and less CPU time.
Oscar Dalmau, H. D. de la, Cruz Cansino· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 13, 2026
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.
MIT News · Artificial Intelligence· news.mit.eduSep 29, 2026
Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.