This study examines how forecast quality evolves throughout reverse diffusion to find that general temporal structure is often recovered at relatively high noise levels, whereas continued low-noise refinement can introduce statistical drift and degrade the final forecast.
Abstract
Diffusion models offer a natural way to model uncertainty in time series forecasting, yet their iterative sampling process is often treated as a uniformly beneficial refinement procedure. Our study challenges this view by examining how forecast quality evolves throughout reverse diffusion. We find that general temporal structure is often recovered at relatively high noise levels, whereas continued low-noise refinement can introduce statistical drift and degrade the final forecast. Our analysis further suggests that this behavior explains why prior methods often favor relatively narrow diffusion architecture and schedule design. Building on this observation, we propose a label-free global stopping criterion that detects the optimal termination point, eventually speeding up inference and improving predictive accuracy. Additionally, since early stopping terminates inference in high-noise regions, we propose a Bernoulli timestep sampler that concentrates training on this region while preserving coverage of the full diffusion process. Extensive experiments conducted across eight real-world datasets demonstrate the superior performance of our method compared to existing approaches.
Two-stage Odd Residual Flows (TORF), a framework that decouples mean forecasting from uncertainty estimation, achieves state-of-the-art deterministic accuracy (NMAE) while providing strong density estimation performance (CRPS) on short and long-horizon forecasting.
Kiran Madhusudhanan, Christian Klötergens, Lars Schmidt-Thieme et al.· 0 citations
The Implicit Trajectory-Constrained Diffusion network (ITCD) is proposed, which employs a two-stage diffusion architecture to mitigate the distribution shift caused by padding, thereby enabling better adaptation to realistic data and achieving more consistent imputations.
The analysis from independent random search to a broader family of local search operators, and it is proved that when sensitivities vary across instances, no adaptive policy can avoid worst-case regret that grows linearly in the trajectory length.
Yuan Cao, Yi-Fu Tang, Hang-Qi Li et al.· 0 citations
This work adds a persistent hidden state to a diffusion denoiser and removes its timestep conditioning, leaving a single shared update that can be run to arbitrary depth, and develops an anytime solver that keeps improving with inference depth far beyond the rollout lengths and backpropagation window used in training.
M. Drozdova, Aidan Sirbu, Pietro Miotti et al.· 3 citations
This work considers a first-order sampler based on the leave-one-out denoiser for uniform and remasking processes whose coordinate updates can be performed in parallel, and derives an exact information-theoretic representation of the discretization error in terms of the mutual information between different coordinates...
This work introduces RACER, a training-free closed-loop controller that continuously shrinks uncertain forecasts toward the last computed feature and derives a deterministic error bound for the shrinkage and empirically evaluates its validity and tightness across acceleration regimes.
Yan-Chao Li, Jia-Qing Xie, Ben Gao et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.