High-accuracy and dimension-free sampling with diffusions
Khashayar Gatmiry, Sitan Chen, Adil Salim

TL;DR
This paper introduces a novel diffusion model solver that achieves high-accuracy sampling with iteration complexity scaling polylogarithmically in inverse accuracy, independent of ambient dimension, improving efficiency in high-dimensional settings.
Contribution
The authors develop a new diffusion solver using low-degree approximation and collocation, providing the first high-accuracy guarantees with dimension-free complexity dependence.
Findings
Iteration complexity scales polylogarithmically with 1/ε
Complexity depends on effective radius, not ambient dimension
Achieves high-accuracy sampling with fewer iterations
Abstract
Diffusion models have shown remarkable empirical success in sampling from rich multi-modal distributions. Their inference relies on numerically solving a certain differential equation. This differential equation cannot be solved in closed form, and its resolution via discretization typically requires many small iterations to produce \emph{high-quality} samples. More precisely, prior works have shown that the iteration complexity of discretization methods for diffusion models scales polynomially in the ambient dimension and the inverse accuracy . In this work, we propose a new solver for diffusion models relying on a subtle interplay between low-degree approximation and the collocation method (Lee, Song, Vempala 2018), and we prove that its iteration complexity scales \emph{polylogarithmically} in , yielding the first ``high-accuracy'' guarantee for a…
Peer Reviews
Decision·Submitted to ICLR 2026
- The paper is well-written and easy-to-follow. - This work seems to be the first analysis to give a polylog-complexity diffusion sampler.
The contribution of this work is primarily theoretical and the practical implication is not clear. The proposed sampler appears to be a mathematical construction rather than a practical algorithm, as it relies on a polynomial approximation of the score function that is not tractable in real diffusion inference settings. In this sense, the current title and abstract may be somewhat misleading, as they somewhat suggest the existence of an actual sampler rather than a theoretical construction.
* The paper is well-written. I think the discussion and clarification regarding the high-accuracy situation in classical statistical sampling is useful for the readers. I could follow the paper with ease. * The results are new and as far as I know the use of the colocation method [1] in diffusion models is novel. [1] Lee et al. -- Algorithmic theory of ODEs and sampling from well-conditioned logconcave densities
* Assumption 1 seems extremely strong. I think the authors should discuss more the impact of this assumption. Especially with regards to the works of [1,2] which have weaker assumptions on the target distribution (I do understand that the samplers and results are different in those papers but I think it is important to consider the potential limitations of Assumption 1). It seems that it would be well discussed in the context of the manifold hypothesis. * I believe that the related work sectio
(1) The paper proposes a new solver based on the collocation method for diffusion models. A delicate design will lead to high-accuracy sampling. (2) It proves that a polynomial iteration complexity on $1/\epsilon$, where $\epsilon$ is the sampling accuracy. (3) The paper provides a detailed theoretical analysis.
(1) The introduction of collocation methods contains much ambiguity. For example, “ by polynomial interpolation”, in my understanding, polynomial interpolation first determines where it takes values ($c_i$), then we can find corresponding polynomials. The argument first finding a polynomial basis, then selecting nodes satisfying the equations, seems weird. (2) Many definitions of norms are not specified in this paper. For example, Lemma 8, did I miss where the $||\cdot||_ {p,\infty}$ is defined
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Stochastic Gradient Optimization Techniques · Model Reduction and Neural Networks
