paper-with-me

홈 › Papers

Looped SSMs: Depth-Recurrence and Input Reshaping for Time Series Classification

2026-05-15 · Mónika Farsang, Ramin Hasani, Daniela Rus, Radu Grosu arxiv

State Space Models (SSMs) are inherently recurrent along the sequence dimension, yet depth-recurrence - reusing the same block repeatedly across layers, as recently applied in looped transformers - has not been explored in this model family. We show that a looped SSM with $k$ parameters iterated $L$ times consistently closely matches or outperforms a standard SSM with $k \cdot L$ independent parameters across four architectures (LRU, S5, LinOSS, LrcSSM) and six time series classification benchmarks, despite operating within a strictly smaller hypothesis space, as we formally establish. Since the larger model contains the looped model as a special case, this dominance cannot be explained by expressivity and instead points to parameter sharing across depth as a beneficial inductive bias that simplifies optimization. These results demonstrate that depth-recurrence is orthogonal to sequence-recurrence and independently beneficial. We further show that input reshaping is an equally neglected design axis: concatenating timesteps for low-dimensional inputs, or flattening and rechunking the joint feature-time dimension for high-dimensional ones, yields accuracy gains of 1-6% across all models, confirmed over 5 random seeds. Both techniques provide standalone improvements that compound when combined, suggesting that depth and input reshaping are two independent and underexplored design axes for SSMs on time series.

📄 PDF Abstract BibTeX arXiv:2605.16048

Code (0)

등록된 구현이 없습니다.

Tasks

Time Series Classification

Similar Papers 제목 키워드 기반

How Much Is One Recurrence Worth? Iso-Depth Scaling Laws for Looped Language Models

2026-04-22 · Kristian Schwethelm, Daniel Rueckert, Georgios Kaissis arxiv

We measure how much one recurrence is worth to a looped (depth-recurrent) transformer, in equivalent unique parameters. From an iso-depth pretraining sweep across recurrence counts $r \in \{1, 2, 4, 8\}$ spanning ${\sim}…

Looped Transformers with Source-Centered State Evolution

2026-07-30 · Bum Jun Kim, Kohei Hayashi, Shunsuke Kamiya, Masanori Koyama 외 arxiv

Looped Transformers create a useful train- and test-time compute axis by reusing the same Transformer block over recurrent depth, increasing effective depth at a fixed parameter count. However, that shared block must the…

A Mechanistic Analysis of Looped Reasoning Language Models

2026-04-13 · Hugh Blayney, Álvaro Arroyo, Johan Obando-Ceron, Pablo Samuel Castro 외 arxiv

Reasoning has become a central capability in large language models. Recent research has shown that reasoning performance can be improved by looping an LLM's layers in the latent dimension, resulting in looped reasoning l…

Stabilizing Recurrent Dynamics for Test-Time Scalable Latent Reasoning in Looped Language Models

2026-05-26 · Xiao-Wen Yang, Ziyu Han, Xi-Hua Zhang, Wen-Da Wei 외 arxiv

Looped Language Models (LoopLMs) enable efficient latent reasoning through depth recurrence, yet exhibit unreliable test-time scaling behavior: performance often peaks at a certain iteration depth and then collapses with…

Mathematical Reasoning

SpiralFormer: Looped Transformers Can Learn Hierarchical Dependencies via Multi-Resolution Recursion

2026-02-12 · Chengting Yu, Xiaobo Shu, Yadao Wang, Yizhen Zhang 외 arxiv

Recursive (looped) Transformers decouple computational depth from parameter depth by repeatedly applying shared layers, providing an explicit architectural primitive for iterative refinement and latent reasoning. However…