- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
Diffusion probabilistic models (DPMs) have achieved significant advances in both theory and applications. However, the sampling errors of decentralized DPMs, particularly the additional errors introduced by routing decisions, remain to be further investigated. In this paper, it propose a Joint-space Gaussian Cancellation (JGC) method to analyze the convergence properties of both standard and decentralized DPMs within the framework of denoising DDPM samplers. Under the assumptions that the data distribution has a finite second moment, a specified log-SNR grid is employed, and a posterior-variance DDPM sampler is used, we establish that the total variation error of standard diffusion models can be controlled by initialization error, discretization error, and denoising network error. Furthermore, we extend this analysis to decentralized DPMs and derive an additional error bound associated with routing decisions.
Critical strengths
(1) The theoretical analysis in this paper is rigorous, and the proofs are clear, providing a detailed characterization of initialization error, discretization error, denoising network error, and routing error. Under the mild assumption that the data distribution has only a finite second moment, the paper establishes an upper bound on the error in total variation distance.
(2) The paper proposes a unified analytical framework that applies not only to standard DPMs but also extends to decentralized DPMs that combine multiple experts through a router, thereby providing explicit convergence guarantees for decentralized DPMs.
(3) The paper is well-written, with a clear and concise structure and a smooth, logical flow of presentation.
Critical weaknesses
(1) Limited practical applicability. Modern DPMs predominantly employ ODE-based sampling methods, including image generation models (e.g., FLUX, SD3.5, and Qwen-Image) and video generation models (e.g., Wan, CogVideoX, and HunyuanVideo). However, the convergence theorems in this paper focus on stochastic reverse sampling using DDPM with posterior variance. The derived error bounds are specific to its Gaussian reverse transitions and do not cover the sampling errors associated with ODE solvers. This limitation restricts the practical relevance of the theoretical results to modern DPMs.
(2) Insufficient experimental validation. The paper does not include any experiments in the main text. Moreover, the experimental results and conclusions presented in the appendix are not sufficiently robust. For instance, on the two-dimensional synthetic dataset, the experimental conclusions differ between 10-step and 50-step sampling, as shown in Table 5. Similarly, on CIFAR-10, the results for standard DDPM and SD-DDPM lead to inconsistent conclusions, as shown in Table 6.
(3) Lack of discussion of related work. The paper does not discuss exposure bias in DPMs, although prior studies on these topics have also investigated errors in sampling distributions. A more comprehensive discussion of these related works would help clarify the novelty and contributions of the proposed theoretical framework.
[1] Elucidating the SNR-t Bias of Diffusion Probabilistic Models, ICLR 2024
[2] On Error Propagation of Diffusion Models, ICLR 2024
[3] Frequency Regulation for Exposure Bias Mitigation in Diffusion Models, ACM MM 2025
Questions for authors
Please see the Weaknesses section.
2 comments
Rely to Reviewer J2UA (Block 2)
W2, continued. Different conclusions at 10/50 steps and across DDPM/SN-DDPM.
The relative ranking of Fixed-class and per-step routing changes with the step count and base sampler, while both strategies can improve on the unconditional baseline. We have revised Appendix J to state this distinction explicitly and explain how the two strategies relate to our theory.
On Circles, the 10-step MMD values are 121.0 (Uncond), 33.44 (Fixed-class), and 71.94 (per-step); at 50 steps they are 12.42, 4.764, and 2.594. Thus Fixed-class is better at 10 steps and per-step routing is better at 50 steps, with both improving on Uncond. The same reversal appears for Moons and Checkerboard. On CIFAR-10 with the linear schedule at 50 steps, Fixed-class/per-step FID is 15.12/13.81 for DDPM and 3.62/4.29 for SN-DDPM.
The two strategies target the same data mixture but use different finite-step processes. Fixed-class keeps the initial label; per-step routing updates the expert choice using the current sample. Appendix G gives the Fixed-class guarantee, and Theorem 3.2 accounts for the additional learned-routing error. These results identify the initialization, discretization, network, and routing budgets relevant to the choice. The tables then show how the overall generation quality varies across the reported settings.
W3. Relation to exposure bias and error propagation.
We have added a concise discussion of all three works in Appendix P, connecting them to our analysis through the common question of how sampling errors accumulate. Thank you for pointing out these connections.
Exposure-bias studies examine how generated trajectories depart from the forward-process marginals. Our comparison lemma connects errors measured under those true marginals to the actual generated endpoint law; JGC controls the finite-step discretization contribution, and the mixture comparison isolates routing error. This connects the distribution mismatch to the network, discretization, and routing terms in our bound.
Li and van der Schaar [3] relate modular and cumulative KL errors and motivate a training regularizer. Yu et al. [4] study sample-SNR/timestep mismatch. Yu and Zhan [5] study frequency-dependent energy discrepancies and a wavelet correction. Appendix P discusses how these approaches relate to our finite-step analysis.
Thank you again for the helpful suggestions.
References
[3] Yangming Li and Mihaela van der Schaar. "On Error Propagation of Diffusion Models." International Conference on Learning Representations, 2024.
[4] Meng Yu, Lei Sun, Jianhao Zeng, Xiangxiang Chu, and Kun Zhan. "Elucidating the SNR-t Bias of Diffusion Probabilistic Models." Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 43461-43470, 2026.
[5] Meng Yu and Kun Zhan. "Frequency Regulation for Exposure Bias Mitigation in Diffusion Models." Proceedings of the 33rd ACM International Conference on Multimedia, 2025. doi:10.1145/3746027.3755608.
Rely to Reviewer J2UA (Block 1)
Dear Reviewer J2UA,
Thank you for your careful review and positive assessment of the analysis. We have clarified the scope, expanded the experimental documentation, and added the related-work discussion you suggested.
We agree that our theorems address stochastic posterior-variance DDPM sampling and do not cover ODE solvers. The contribution is a proof method that gives a comparable first-order, linear-dimensional rate for standard diffusion and extends to learned routing in decentralized diffusion. We discuss this scope and its relation to existing theory in Appendix P.
Studying stochastic and deterministic sampling separately is common because their transition laws call for different techniques. For example, Chen, Lee and Lu [1] analyze stochastic reverse discretizations, whereas Gao and Zhu [2] study probability-flow ODEs using contraction and synchronous coupling. JGC uses exact Gaussian-channel interpolation and a posterior-covariance potential; Gaussian overlap then quantifies the additional cost of routing between experts.
Our routing bound takes account of expert separation: confusing nearby predictions costs less than confusing distant ones. Appendix O.3 makes this concrete for fixed positive-variance Gaussian classes with exact experts. On a shrinking-noise grid, both routing coefficients remain bounded because the expert predictions approach each other at high SNR. We have summarized this example in the main text. We are also investigating decentralized ODE convergence in separate ongoing work.
We have clarified the experiments' purpose and expanded their documentation: they compare generation quality, while the proofs and the new analytical example establish and explain the convergence guarantees. The experiments remain in Appendix J, consistent with the paper's theoretical focus, with a clearer pointer from the main text.
MMD and FID provide sample-based evaluations for synthetic and image data. Direct TV between empirical point clouds with disjoint supports equals one; estimating the underlying high-dimensional TV requires additional density or structural information. We therefore use these sample-quality metrics alongside an analytical Gaussian example in which the routing bounds can be calculated explicitly.
Appendix J now includes training and evaluation parameter tables (Tables 9-10), the precise MMD estimator, and the repeated-evaluation procedure. We have also organized the synthetic DDPM evaluation source, models, and documentation into an anonymous supplementary package to submit with the revision. Deployment launchers are excluded for commercial reasons; the research interfaces and parameter settings are documented.
References
[1] Hongrui Chen, Holden Lee, and Jianfeng Lu. "Improved Analysis of Score-based Generative Modeling: User-friendly Bounds under Minimal Smoothness Assumptions." International Conference on Machine Learning, pp. 4735-4763, 2023.
[2] Xuefeng Gao and Lingjiong Zhu. "Convergence Analysis for General Probability Flow ODEs of Diffusion Models in Wasserstein Distances." International Conference on Artificial Intelligence and Statistics, pp. 1009-1017, 2025.