Metraipolis › archive › dc_e801694dabe1

Adaptive Second-Order Solvers for Fast Stochastic Diffusion Sampling — arXiv:2610.03034

Source
arXiv
Original
https://arxiv.org/abs/2610.03034
License (as archived)
CC0-1.0
Archived
2026-10-05T22:51:58.899Z
SHA-256 of the archived text
225f985d8a4b11046a318efdaeb46469dc81ea2e810a123987e0fdd3a662d02e
Stable URL of this page
https://metraipolis.com/documento/dc_e801694dabe1

How to cite

Adaptive Second-Order Solvers for Fast Stochastic Diffusion Sampling — arXiv:2610.03034 — arXiv, https://arxiv.org/abs/2610.03034 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e801694dabe1 (Metraipolis archive dc_e801694dabe1, sha256 225f985d8a4b11046a318efdaeb46469dc81ea2e810a123987e0fdd3a662d02e)
BibTeX
@misc{dce801694dabe1,
  title = {Adaptive Second-Order Solvers for Fast Stochastic Diffusion Sampling — arXiv:2610.03034},
  howpublished = {arXiv},
  url = {https://arxiv.org/abs/2610.03034},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e801694dabe1; sha256 225f985d8a4b11046a318efdaeb46469dc81ea2e810a123987e0fdd3a662d02e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv, https://arxiv.org/abs/2610.03034. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Diffusion models rely on numerical solvers requiring time-discretization, which has a large influence on the tradeoff between sampling cost and quality. However, the computational difficulty of the reverse process varies along the sampling trajectory and across data distributions, making the choice of discretization important. We adapt proportional-integral (PI) step-size control to diffusion, using our diffusion noise-normalised error estimator. Unlike existing adaptive methods in diffusion that respond only to the current error, the PI solver also incorporates the previous error, yielding smoother step adaptation. We further show that these per-sample trajectories exhibit shared structure and can be aggregated into a fixed schedule that retains much of the benefit of adaptive sampling. We evaluate both approaches on natural-image and language datasets, in terms of quality, measured by FID at a matched number of neural network evaluations (NFE), comparing them with widely used stochastic solvers and schedules. For images, our fixed discretization outperforms the commonly used EDM schedule in terms of sample quality when used with the stochastic Heun sampler, and with the EDM-churn sampler at low NFE. Additionally, our PI adaptive solver obtains better FID than most stochastic and adaptive baselines, although it does not beat the EDM-churn sampler at low NFE. Moreover, we find our solver outperforms both the EDM and the entropy schedule on language diffusion at low-to-medium NFE in terms of perplexity, with the drawback of lower token entropy. Lastly, we find that the benefit of per-sample adaptivity is problem-dependent. It is highly beneficial in 1D toy examples, while only marginal for image and language data, where the average schedule sometimes even outperforms the PI-adaptive solver. Code is available at this https URL

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.CL, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (cs.LG) ; Computation and Language (cs.CL); Computer Vision and Pattern Recognition (cs.CV).
Pagina del lavoro: https://arxiv.org/abs/2610.03034 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-05T22:46:10.621Z dalla pagina https://arxiv.org/list/cs.CL/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).