Temporal-Adaptive Bit Sparsification Quantization (TASQ) achieves quality comparable to static quantization with less computation, and together with the Temporal-Precision Engine, it reduces execution cycles by 25 to 50 percent over static quantization.
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.
QuantWM is presented, a training-free 2-bit KV cache quantization framework for video world models that significantly improves visual quality and temporal consistency, while outperforming existing methods across benchmarks with up to 6.20 KV cache memory compression and limited additional overhead.
Jia-Qi Zhao, Xiao-Bin Hu, Bo Yin et al.· 0 citations
Across five models from 1B to 32B, SoftWater outperforms the released WaterSIC quantizer at matched head rates on 59 of 60 test points, using none of that pipeline's refinements and cutting head-induced KL by $6.5\times$--$8.3\times at 2 bits.
D-Quant is proposed, a flexible KV cache quantization framework that introduces a Drift mechanism to convert entropy-coded representations of each token into fixed-size bitstreams, enabling regular memory access and parallel dequantization within attention kernels.
K-Means clustering is addressed with K-Means clustering, achieving near-lossless accuracy and a mean speed-up over the full-precision model, and it is revealed that excluding from quantization the layers whose speed-up is negligible, regardless of their sensitivity, can be counterproductive.
D. Población-Criado, D. García-Gasulla, Eduardo Quiñones· 0 citations
The results show that compression and execution layout must be co-designed to convert model-size reduction into practical parallel inference acceleration, and that compression and execution layout must be co-designed to convert model-size reduction into practical parallel inference acceleration.
Qian-Sheng Song, Guo-Lin Tang· Proceedings of the Internati...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.