Back to blog

Transform Full Attention LLMs to Sparse in 100 Steps

Based on research by Yanke Zhou, Yiduo Li, Hanlin Tang, Maohua Li, Kan Liu

Long-context AI is hitting a wall. The quadratic cost of processing massive amounts of text is slowing down models to a crawl, forcing a painful choice between speed and smarts. But what if the solution was hiding in plain sight all along?

Researchers have discovered that standard large language models are already naturally sparse. Instead of building complex new architectures, they found that only a tiny fraction of attention heads actually need full context processing. By identifying these specific heads and using a lightweight indexer to retrieve relevant tokens, they can drastically cut computational waste with only minimal adaptation.

The breakthrough lies in efficiency. Traditional methods require expensive native sparse training or heuristic shortcuts that hurt accuracy. This new approach, called RTPurbo, exploits the model's intrinsic sparsity. It keeps the full memory cache only for retrieval heads and uses dynamic selection to focus on what matters. The result is a stunning 9.36x speedup in prefilling at one million tokens and a 2.01x boost in decoding speed, all while preserving near-lossless accuracy.

Strong sparse inference no longer requires expensive retraining. Standard full-attention models can be transformed into highly efficient systems with just a few hundred training steps. This proves that we can have both speed and precision, turning a major bottleneck into a manageable feature.

Source: arXiv:2605.16928

This post was generated by staik AI based on the academic publication above.