Sparsified State-Space Models are Efficient Highway Networks
Woomin Song, Jihoon Tack, Sangwoo Mo, Seunghyuk Oh, Jinwoo Shin
TL;DR
This work addresses the efficiency of sequence modeling with state-space models (SSMs) by introducing Simba, a hierarchical sparsification method that prunes tokens within pre-trained SSMs under a fixed compute budget. Simba computes a global token importance score $s(t)=\max(\Delta y_T(t))$, where $\Delta y_T(t)$ captures the influence of token $x_t$ on the final output via the SSM recurrence, and prunes tokens to create a trapezoidal network with sparse upper layers that function as highways. The approach is training-free and uses a linear pruning schedule preserving $10\%$ of tokens at the final layer; empirically it outperforms the baseline Mamba at the same FLOPs across 6 NLP benchmarks and improves language modeling perplexity on PG-19, with enhanced long-context information flow. Overall, Simba demonstrates how structured sparsification can yield both efficiency gains and improved information propagation in SSMs, approaching the performance of Transformers while maintaining linear-time computation.
Abstract
State-space models (SSMs) offer a promising architecture for sequence modeling, providing an alternative to Transformers by replacing expensive self-attention with linear recurrences. In this paper, we propose a simple yet effective trick to enhance SSMs within given computational budgets by sparsifying them. Our intuition is that tokens in SSMs are highly redundant due to gradual recurrent updates, and dense recurrence operations block the delivery of past information. In particular, we observe that upper layers of SSMs tend to be more redundant as they encode global information, while lower layers encode local information. Motivated by this, we introduce Simba, a hierarchical sparsification method for SSMs based on token pruning. Simba sparsifies upper layers more than lower layers, encouraging the upper layers to behave like highways. To achieve this, we propose a novel token pruning criterion for SSMs, measuring the global impact of tokens on the final output by accumulating local recurrences. We demonstrate that Simba outperforms the baseline model, Mamba, with the same FLOPS in various natural language tasks. Moreover, we illustrate the effect of highways, showing that Simba not only enhances efficiency but also improves the information flow across long sequences. Code is available at https://github.com/woominsong/Simba.
