We present LrcSSM, a recurrent model that processes long sequences as fast as today’s linear state-space layers. By forcing its Jacobian matrix to be diagonal, the full sequence can be solved in parallel, giving computational work and memory and only sequential depth, for input-sequence length and a state dimension . Moreover, LrcSSM offers a formal gradient-stability guarantee that other input-varying systems such as Liquid-S4 and Mamba do not provide. Importantly, the diagonal Jacobian structure of our model results in no performance loss compared to the original model with dense Jacobian, and the approach can be generalized to other non-linear recurrent models, demonstrating broader applicability. On a suite of long-range forecasting tasks, we demonstrate that LrcSSM outperforms Transformers, LRU, S5, and Mamba.

生成讲解博客的中文版本

生成AI智能校验的中文版本