arXiv:2609.15702v1 Announce Type: new
Abstract: Pretrained score-based diffusion models provide strong unconditional priors, yet enforcing measurement or physics consistency in inverse problems is of...
By Zihao Wang
Efficient Covariance-Aware Vicinal Latent Diffusion (CAViLD) is a latent diffusion framework designed for continuous conditional image generation. It builds a purified, condition-aware latent space using density-adaptive vicinal learning, auxiliary semantic regularization, and NIQE-guided negative data augmentation. CAViLD incorporates an EMA teacher to internalize conditional guidance, enabling single-branch inference, and employs covariance-aware progressive distillation to reduce sampling steps to four NFEs, achieving a balance between fidelity, condition consistency, and efficiency on datasets such as RC-49, UTKFace, and Steering Angle.
arXiv:2609.14596v1 Announce Type: new
Abstract: Training-free diffusion inverse solvers typically choose between local measurement guidance and costly clean-space posterior updates. Independent poste...
By Qi Yu, Hanlin Wu, Xiaohui Sun
Inference-time alignment steers diffusion models toward downstream objectives without costly fine-tuning, but existing methods typically optimize expected cost (or reward) without explicitly controlli...
Score‑based diffusion models excel at inverse problems but suffer from slow inference and task‑specific hyperparameter tuning. This paper introduces principled reparameterizations that create invariances, enabling the reuse of the same hyperparameters across different tasks. Building on the RED‑diff framework, the authors present OptDiff, a streamlined pipeline that integrates convex optimization to accelerate inference, achieving notable speedups and higher image quality in reconstruction, deblurring, and super‑resolution experiments.
By Julio Oscanoa, Irmak Sivgin, Cagan Alkan, Daniel Ennis, John Pauly, Mert Pilanci, Shreyas Vasanawala
arXiv:2608. 05600v1 Announce Type: cross Abstract: Flow-based generative models are typically sampled by solving a deterministic ordinary differential equation (ODE), whereas online reinforcement learning requires stochastic rollouts for policy exploration and optimization.
By Yingqing Guo, Hui Yuan, Zijian He, Mengdi Wang, Zheng Ding