Diffusion Models are Secretly Exchangeable: Parallelizing DDPMs via Autospeculation
원문 초록
Denoising Diffusion Probabilistic Models (DDPMs) have emerged as powerful tools for generative modeling. However, their sequential computation requirements lead to significant inference-time bottlenecks. In this work, we utilize the connection between DDPMs and Stochastic Localization to prove that, under an appropriate reparametrization, the increments of DDPM satisfy an exchangeability property. This general insight enables near-black-box adaptation of various performance optimization techniques from autoregressive models to the diffusion setting. To demonstrate this, we introduce \emph{Autospeculative Decoding} (ASD), an extension of the widely used speculative decoding algorithm to DDPMs that does not require any auxiliary draft models. Our theoretical analysis shows that ASD achieves a $\tilde{O} (K^{\frac{1}{3}})$ parallel runtime speedup over the $K$ step sequential DDPM. We also demonstrate that a practical implementation of autospeculative decoding accelerates DDPM inference significantly in various domains.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Refining Few-Step Text-to-Multiview Diffusion via Reinforcement Learning
On Designing Diffusion Autoencoders for Efficient Generation and Representation Learning
ScoreAdv: Score-based Targeted Generation of Natural Adversarial Examples via Diffusion Models
LangMamba: A Language-driven Mamba Framework for Low-dose CT Denoising with Vision-language Models
Hierarchical Intent-guided Optimization with Pluggable LLM-Driven Semantics for Session-based Recommendation
Energy-Based Transformers are Scalable Learners and Thinkers
토론
이 논문과 연결된 포럼 글이 아직 없습니다.