MEGA Hub

TASQ: Temporal-Adaptive Bit Sparsification Quantization for Diffusion Models

Authors

Do you know Seokho Han?You can claim authorship or link another user.Do you know Dongwei Wang?You can claim authorship or link another user.Do you know Jinhee Kim?You can claim authorship or link another user.Do you know Yiran Chen?You can claim authorship or link another user.Do you know Kang Eun Jeon?You can claim authorship or link another user.Do you know Huanrui Yang?You can claim authorship or link another user.Do you know Jong Hwan Ko?You can claim authorship or link another user.

Abstract

Static quantization assigns one weight precision to every denoising step. To preserve quality, that precision must accommodate the most quantization-sensitive step, even though many other steps can tolerate fewer bits. The resulting model may satisfy its memory budget, but it repeatedly pays worst-case arithmetic throughout the denoising trajectory. We introduce Temporal-Adaptive Bit Sparsification Quantization (TASQ) to separate these two costs. TASQ stores one shared maximum-precision weight buffer and learns a Temporal-Spatial LSB Mask that selects a lower effective precision for each layer and denoising stage by truncating least-significant bits. Storage therefore remains fixed by the worst case, while BitOPs decrease at less sensitive stages without per-stage weight copies or runtime search. A Temporal-Precision Engine maps the learned schedule to bit-serial execution, where cycles scale with effective precision and switching precision has no measured cycle overhead. On PixArt-Sigma, SANA-1.6B, and SDXL-Turbo, TASQ achieves quality comparable to static quantization with less computation. Together with the Temporal-Precision Engine, it reduces execution cycles by 25 to 50 percent over static quantization and by 6.1 to 7.5x over a naive static 8-bit bit-serial execution. Code is available at https://github.com/seokho-han/tasq.

Community

00