paper-with-me

Papers

StreamKL: Fast and Memory-Efficient KL Divergence for Boosting Attention Distillation

2026-06-18 · Guangda Liu, Yiquan Wang, Chengwei Li, Wenhao Chen, Jing Lin, Yiwu Yao, Danning Ke, Wenchao Ding, Jieru Zhao arxiv

Attention distillation, which trains one attention distribution to match another by minimizing their Kullback-Leibler (KL) divergence, is widely used in knowledge distillation, model compression, continual learning, and sparse-attention LLM training. However, existing approaches materialize both attention distributions before computing the KL reduction, incurring $O(N_QN_K)$ memory and IO costs that become prohibitive at long context lengths. We present StreamKL, the first fused GPU primitive for attention KL divergence that eliminates this quadratic materialization. StreamKL derives a novel online formulation for the coupled two-distribution KL reduction, enabling a single one-pass forward kernel that streams query-key tiles through on-chip SRAM. For the backward pass, StreamKL recomputes attention probabilities tile-by-tile, avoiding storage of quadratic intermediates. We further design and implement efficient GPU kernels with dedicated optimizations. Experiments show StreamKL delivers up to $43\times$ and $14\times$ speedups over baseline methods in the forward and backward passes, respectively. Most importantly, StreamKL reduces the extra HBM footprint of attention distillation from $O(N_QN_K)$ to $O(1)$, enabling long-context distillation on a single GPU.

📄 PDF Abstract BibTeX arXiv:2606.20005

Code (0)

등록된 구현이 없습니다.

Tasks

Knowledge DistillationContinual LearningModel Compression

Similar Papers 제목 키워드 기반

Faster Boosting with Smaller Memory

2019-01-25 · NeurIPS 2019 12 · Julaiti Alafate, Yoav Freund

State-of-the-art implementations of boosting, such as XGBoost and LightGBM, can process large training sets extremely fast. However, this performance requires that the memory size is sufficient to hold a 2-3 multiple of …

Boosting Variational Inference With Locally Adaptive Step-Sizes

2021-05-19 · Gideon Dresdner, Saurav Shekhar, Fabian Pedregosa, Francesco Locatello 외

Variational Inference makes a trade-off between the capacity of the variational family and the tractability of finding an approximate posterior distribution. Instead, Boosting Variational Inference allows practitioners t…

Variational Inference

$(α,β)$-Stability for Boosting Vector-Valued Prediction

2026-02-21 · Jian Qian, Shu Ge arxiv

Despite the widespread use of boosting in structured prediction, a general theoretical understanding of aggregation beyond scalar prediction remains incomplete. We study vector-valued prediction under a target divergence…

Structured PredictionDensity Estimation

FedBoosting: Federated Learning with Gradient Protected Boosting for Text Recognition

2020-07-14 · Hanchi Ren, Jingjing Deng, Xianghua Xie, Xiaoke Ma 외

Typical machine learning approaches require centralized data for model training, which may not be possible where restrictions on data sharing are in place due to, for instance, privacy and gradient protection. The recent…

Federated Learning

Online Local Boosting: improving performance in online decision trees

2019-07-16 · Victor G. Turrisi da Costa, Saulo Martiello Mastelini, André C. Ponce de Leon Ferreira de Carvalho, Sylvio Barbon Jr

As more data are produced each day, and faster, data stream mining is growing in importance, making clear the need for algorithms able to fast process these data. Data stream mining algorithms are meant to be solutions t…