RWKV-X: A Linear Complexity Hybrid Language Model
Haowen Hou, Zhiyi Huang, Kaifeng Tan, Rongchang Lu, Fei Richard Yu
TL;DR
Transformers incur $O(N^2)$ self-attention costs that hinder long-context processing. RWKV-X hybridizes RWKV blocks with Top-$k$ Chunk Sparse Attention to achieve $O(N)$ training and $O(1)$ decoding, enabling ultra-long contexts while preserving short-context performance. Key contributions include the Top-$k$ Chunk Sparse Attention with KV-cache compression, a block-expansion training regime, and long-context continual pretraining at 64K with Long-context Cross-Entropy loss, achieving near-perfect pass-key retrieval on 64K sequences and stable decoding up to 1M tokens. This work provides a scalable, efficient backbone for long-context language modeling and offers public checkpoints and code to accelerate further research.
Abstract
In this paper, we introduce RWKV-X, a novel hybrid architecture that combines the efficiency of RWKV for short-range modeling with a sparse attention mechanism designed to capture long-range context. Unlike previous hybrid approaches that rely on full attention layers and retain quadratic complexity, RWKV-X achieves linear-time complexity in training and constant-time complexity in inference decoding. We demonstrate that RWKV-X, when continually pretrained on 64K-token sequences, achieves near-perfect accuracy on the 64K passkey retrieval benchmark. It consistently outperforms prior RWKV-7 models on long-context benchmarks, while maintaining strong performance on short-context tasks. These results highlight RWKV-X as a scalable and efficient backbone for general-purpose language modeling, capable of decoding sequences up to 1 million tokens with stable speed and memory usage. To facilitate further research and analysis, we have made the checkpoints and the associated code publicly accessible at: https://github.com/howard-hou/RWKV-X.
