arXiv Machine Learning

A Simple State Space Model Excels at Multivariate Time Series Classification

arXiv:2605. 27406v2 Announce Type: replace Abstract: Structured state space models (SSMs) have recently emerged as a promising foundation for sequence modeling, with Mamba-based architectures demonstrating strong performance through input-dependent state transitions, albeit at considerable complexity.

arXiv Machine Learning
Aug 11

Advancing Intelligent Sequence Modeling: Evolution, Trade-offs, and Applications of State-Space Architectures from S4 to Mamba

arXiv:2503. 18970v4 Announce Type: replace Abstract: Structured State Space Models (SSMs) have become a prominent class of sequence models, developed against two long-standing difficulties: the sequential computation and gradient propagation limits of Recurrent Neural Networks (RNNs), and the quadratic time and memory cost of self-attention in Transformers.

By Shriyank Somvanshi, Md Monzurul Islam, Mahmuda Sultana Mimi, Sazzad Bin Bashar Polock, Gaurab Chhetri, Anandi Dutta, Amir Rafe, Subasish Das
arXiv Machine Learning
Sep 18

Elastic Spectral State Space Models for Train-Once Budgeted Inference

Elastic Spectral State Space Models (ES-SSM) are a train‑once, export‑many sequence modeling framework that achieves elasticity by spectrally approximating the state‑space operator. The method builds on Hankel spectral filtering, using fixed spectral channels to represent long‑range token mixing and combining input‑adaptive gates with budget dropout to enable reliable deployment across different resource budgets. ES‑SSM is evaluated on byte‑level language modeling, Long Range Arena, Speech Commands V2, and offline reinforcement learning, showing that a single trained model can be truncated to competitive compact models while maintaining smooth quality‑cost curves across a wide range of truncation levels.

By Dachuan Song, Junyu Yin, Zechen Hu, Xuan Wang
arXiv AI
2d ago

Reshape and Recur: Improving SSMs with Input Reshaping and Depth Recurrence

The paper proposes two extensions to State Space Models (SSMs) to reduce memory usage and improve performance. First, it introduces depth recurrence, allowing a looped SSM with fewer parameters to match the performance of a larger, non-recurrent model. Second, it advocates using a fixed time granularity across tasks by reshaping input sequences, which enhances how information is presented to the model. Both techniques consistently benefit four representative SSM architectures (LRU, S5, LinOSS, LrcSSM).

By M\'onika Farsang, Ramin Hasani, Daniela Rus, Radu Grosu
arXiv AI
4d ago

Channel-Dependent State Space Model for Multivariate Time Series Forecasting

The paper introduces Chameleon, a channel‑dependent state space model for multivariate time series forecasting that allows data‑dependent, fine‑grained interactions across variables while maintaining linear scaling with the number of variables. By integrating selective state space models with a Kalman filter and adapting GatedDeltaNet as the backbone, Chameleon improves generalization and achieves lower MSE and MAE on strongly dependent ODE and PEMS datasets compared to both channel‑independent and prior channel‑dependent methods. Across 28 benchmark settings, it outperforms baselines in the majority of cases and demonstrates competitive training‑time and memory efficiency on Traffic and ETT datasets.

By Yu-Cheng Wu, Fan-Keng Sun, Li-Chun Lu, Duane S. Boning
arXiv Machine Learning
Aug 6

Echo Flow Networks

arXiv:2509. 24122v3 Announce Type: replace Abstract: At the heart of time-series forecasting (TSF) lies a fundamental challenge: how can models efficiently and effectively capture long-range temporal dependencies across ever-growing sequences?

By Hongbo Liu, Jia Xu
arXiv Machine Learning
Jun 25

Frequency Domain Reservoir Computing

arXiv:2606. 24969v1 Announce Type: new Abstract: While the quadratic sequence-length bottleneck of transformers has fueled a resurgence in recurrent models, effectively capturing complex dynamics requires architectures that balance efficient training with highly expressive latent states.

By Klaus Schertler, Xiomara Runge, Andrea Ceni, David Kappel, Claudio Gallicchio
arXiv Machine Learning
Aug 19

Recirculation

The paper introduces recirculation, an inference‑time architectural enhancement for foundation models that reduces perplexity and improves accuracy on generation and reasoning tasks without adding significant latency. Recirculation adds a specific form of recurrence, enabling the model to function as a dynamical system that tracks belief states, and is distinct from chain‑of‑thought or depth‑recurrence methods. An adaptive variant requires minimal hyperparameter tuning and achieves notable gains on the Gemma3 family, including a 23% perplexity drop and a 21% accuracy increase on GSM8k.

By Michael C. Mozer, Shoaib Ahmed Siddiqui, Danny Sawyer, Sunny Sanyal, Rosanne Liu