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.
Abstract
Few-step distilled diffusion models generate high-quality images quickly, but often lose per-prompt diversity, producing near-identical samples across random seeds. Optimizing the initial noise at inference time offers an appealing way to recover this diversity, yet existing methods directly update the initial noise in an unconstrained Euclidean space, ignoring both the geometry of the Gaussian prior and the model's sensitivity to noise frequencies. They therefore introduce auxiliary quality-control objectives to maintain generation fidelity, adding compute and weighting hyperparameters while still requiring conservative updates to prevent degradation. In this work, we propose MoNO, a training-free method that performs Manifold-constrained Noise Optimization on a low-dimensional, quality-stabilizing noise manifold. MoNO sequentially optimizes each new initial noise so that its predicted visual feature complements previous generations, while Riemannian updates on an affine low-frequency sphere preserve prior likelihood and fix unstable high-frequency components by construction. This enables large geodesic steps, removes the need for auxiliary quality-control objectives, and converges in far fewer iterations than prior noise-optimization methods. Experiments with multiple distilled text-to-image diffusion models show that MoNO consistently improves per-prompt diversity while maintaining image quality.
Recent advances in distillation and flow-map models have enabled deterministic one- or few-step generation for high-quality data, facilitating a new branch of reward alignment approaches that directly optimize the initial noise from a Gaussian distribution. However, most existing initial-noise optimization methods rely...
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.
R. Zhang, Jiawei Zhang, Gioele Zardini et al.· 0 citations
SNaP is introduced, a one-step MeanFlow posterior sampler for linear inverse problems with Gaussian noise, which produces diverse, high-quality samples with one network evaluation per draw, 30 to 2250 $\times$ faster than iterative samplers.
Shirin Shoushtari, Edward P. Chandler, Xiao Shi et al.· 0 citations
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 paper proposes an ADMM-inspired unrolled plug-and-play solver for Poisson inverse problems that decouples a closed-form data-consistency update from a parameter-efficient prior, implemented as a lightweight decoder operating on frozen CLIP RN50 dense multi-scale features.
Laura C. Diaz-Delgado, Emmanuel Martinez, Henry Arguello· 1 citation
This work introduces Contrastive Noise Alignment (CNA), a training-time method that creates dynamic, contrastive couplings by optimizing the noise representations directly, and shows theoretically that this equilibrium asymptotically preserves Gaussian structures, maintaining tractability during inference.
Lennart Wittke, Vinicius C. Azevedo· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.