SlideSparse: Fast and Flexible (2N-2):2N Structured Sparsity
Abstract
Lay Summary
Running large AI language models is expensive — they require enormous amounts of computation for every response. A common strategy to reduce this cost is "sparsification": setting a portion of the model's numerical values to zero so the hardware can skip unnecessary calculations. Modern GPUs have a built-in fast lane for this, but it only works at one extreme ratio — exactly half the values must be zeroed — which degrades the AI's output quality unacceptably. We found that a milder ratio (zeroing 25% instead of 50%) preserves quality far better. The challenge: GPUs refuse to accelerate it. Our system, SlideSparse, solves this by rearranging the sparsified model into overlapping pieces that each fit the GPU's strict requirements. The rearrangement is mathematically exact — no information is lost. SlideSparse runs on GPUs already deployed in data centers today, with no hardware changes. Across multiple models and chip generations, it delivers up to 1.33× faster AI responses while maintaining output quality — making AI services cheaper and more energy-efficient at scale.