aiqbench analysis
This paper targets a concrete bottleneck in LLM training: activation memory. Its lossless approach, which exploits sparsity in ReLU and ReLU² activations rather than recomputing them or approximating them, is a different tradeoff from activation checkpointing or lossy compression. Readers should check the reported 30-31% per-token VRAM savings against their own model and sequence lengths, since the overhead figures depend on those settings.
BitSparse: Compact Activation Storage for ReLU Feed-Forward Networks
arXiv:2610.22256v1 Announce Type: new Abstract: Reducing memory use in large language model (LLM) training is an ongoing challenge. Activation checkpointing saves memory by recomputation, while lossy compression changes the stored activations. The reemergence of sparse $\relu$ and $\relu^2$ activations creates a third opportunity: losslessly compressing the activation cache itself. We present BitSparse, a GPU-resident lossless compression format for sparse activations. Compression and reconstruction run in custom Triton kernels fused into an autograd function, shrinking the activation cache while recovering it exactly for the backward pass. Bfloat16 (BF16) and FP8 activations are supported. Optional sign-bit packing further increases compression up to close to the theoretical limit. We analyze its compression ratio and compare it to the theoretical optimum. BitSparse lowers per-token VRAM by 31\% and 30\% Modded-NanoGPT and Nemotron-H respectively, with overheads of no more than 1\% at practical sequence lengths. Additionally, a new preallocated buffer system avoids host synchronization during training when variable size tensors are allocated.
Abstract:Reducing memory use in large language model (LLM) training is an ongoing challenge. Activation checkpointing saves memory by recomputation, while lossy compression changes the stored activations. The reemergence of sparse $\relu$ and $\relu^2$ activations creates a third opportunity: losslessly compressing the activation cache itself. We present BitSparse, a GPU-resident lossless compression format for sparse activations. Compression and reconstruction run in custom Triton kernels fused into an autograd function, shrinking the activation cache while recovering it exactly for the backward pass. Bfloat16 (BF16) and FP8 activations are supported. Optional sign-bit packing further increases compression up to close to the theoretical limit. We analyze its compression ratio and compare it to the theoretical optimum. BitSparse lowers per-token VRAM by 31\% and 30\% Modded-NanoGPT and Nemotron-H respectively, with overheads of no more than 1\% at practical sequence lengths. Additionally, a new preallocated buffer system avoids host synchronization during training when variable size tensors are allocated.
Machine Learning (cs.LG)
arXiv:2610.22256 [cs.LG]
(or arXiv:2610.22256v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2610.22256 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 246 words
Related coverage

Challenge: Hand coding weights for efficient sequence memorisation
AI Alignment Forum · Jul 23, 2026

2026.7: Automations that speak your language
Home Assistant · Jul 1, 2026

AUP Learning Cloud: Streamlining AI Education on AMD
AMD · Aug 6, 2026

News
Quantum Computing Report · Jun 7, 2026