arXiv Statistics ML

The Noise-Transmission Burden of Diffusion Network: Why Image Prediction Can Outperform Noise Prediction

arXiv AI
Oct 15

Correction Training for Diffusion Models

arXiv:2610.14136v2 Announce Type: new Abstract: Iterative sampling in diffusion models can lead to error accumulation due to exposure bias. The denoiser is trained on real images interpolated with no...

By Donghoon Ahn, Runqian Wang, Alexei A. Efros, Taesung Park, Yash Belhe
arXiv Computer Vision
Aug 25

Pixel-Space Diffusion via Observation Operators

Pixel‑Space Diffusion via Observation Operators introduces a new framework for pixel‑space diffusion models that addresses a scale‑time mismatch in existing methods. By replacing fixed full‑image supervision with a time‑indexed observation trajectory that progresses from coarse structures to the full image, the model aligns supervision with the natural recovery order of image details. The approach employs Gaussian‑Lanczos operators and a GL‑CoDA decoder to refine features progressively, resulting in faster convergence and higher generation quality, achieving an FID of 1.52 on ImageNet‑256.

By Shaojie Guo, Lichen Ma, Haoyang Tong, Yu He, Zipeng Guo, Xiaoan Liu, Feng Yan, Yu Guo, Fei Wang, Junshi Huang, Yan Wang
arXiv Computer Vision
Sep 30

Adversarial Training for Pixel Diffusion

Pixel diffusion models generate RGB images directly but tend to miss fine‑scale natural‑image statistics. The authors introduce an adversarial post‑training step that adds an adversarial loss to the model’s output at non‑high‑noise timesteps, without changing the architecture or sampling procedure. This approach improves distribution fidelity, coverage, prompt alignment, and perceptual quality across two pixel backbones, and restores missing high‑frequency spectral power while avoiding memorization or mode dropping.

By Xin Lin, Zhifei Zhang, Yuqian Zhou, Haitian Zheng, Zhe Lin, Ming-Hsuan Yang, Truong Nguyen
arXiv Machine Learning
Sep 10

Noise in Diffusion Models Is a Learnable Input

The paper argues that the concrete random noise used in diffusion models is not merely a passive perturbation but a learnable input that can be exploited by the model. By analyzing how clean data and realized noise jointly form the noisy input, the authors show that the model can learn regularities in the data or in the noise structure, and that these two routes can interact. Experiments on MNIST and CIFAR‑10 using pseudorandom streams demonstrate that structured‑noise training can reduce prediction loss, but this advantage disappears when test noise is replaced with IID noise, indicating that the learned dependence is tied to the specific noise structure.

By Shengzhi Deng, Chenqi Ye, Yanze Guo
arXiv Machine Learning
Oct 8

Residual-Stream Burden Shapes Representation Learning in Diffusion Transformers

The paper investigates why Diffusion Transformers perform well when predicting clean data but poorly when predicting noise or velocity. It introduces the concept of *residual-stream burden*, explaining that noisy targets force the residual stream to carry noise-dependent variation through the network, limiting representation flexibility. Experiments show that spectral concentration of clean targets reduces this burden, and the authors propose Spatially Indexed Hyper-Connections (SiHC) to expand residual bandwidth, achieving state‑of‑the‑art FID on ImageNet.

By Tongtong Liang, Siqi Kou, Ziqiao Xi, Esha Singh, Kun Zhou, Zhijie Deng, Alexander Cloninger, Yu-Xiang Wang, Rahul Parhi
arXiv Computer Vision
Aug 25

Improved denoising diffusion probabilistic models with efficient non-diagonal covariance modeling

The paper proposes a new covariance model for Denoising Diffusion Probabilistic Models (DDPMs) that captures non‑diagonal correlations and the power‑law frequency spectrum of natural images. Using a Kronecker‑factored DCT (K‑DCT) decomposition, the authors reduce computational complexity from quadratic to log‑linear, enabling efficient sampling with few steps. Experiments on CIFAR‑10, Celeb‑A, ImageNet, and LSUN demonstrate improved FID and likelihoods over previous state‑of‑the‑art samplers.

By Rui Xia, Ayan Das, Artem Artemev, Andi Zhang, Guillaume Hennequin, Alberto Bernacchia