arXiv:2606. 19101v1 Announce Type: cross Abstract: Most learning architectures for dynamical systems rely on generic nonlinear function approximation, often requiring high model complexity to capture structured behaviors.
Most learning architectures for dynamical systems rely on generic nonlinear function approximation, often requiring high model complexity to capture structured behaviors. In this work, we propose an alternative paradigm in which modeling capability arises primarily from structure rather than from expressive nonlinearities.
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?
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.
arXiv:2607. 08843v1 Announce Type: new Abstract: In artificial and biological neural networks, concepts are often encoded as consistent linear directions in representation space.
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.
The paper introduces Recursive Quadrature Filters (RQFs), complex‑valued temporal filters that act as band‑pass filters within diagonal state‑space models. By making each layer’s bottom‑up input prospective through a parameter‑free two‑tap update, the authors mitigate depth‑dependent gradient attenuation in deep continuous‑time recurrent networks. Experiments on RQFs, S5, and ORGaNICs show that prospective variants match or surpass non‑prospective controls, achieving high accuracy on raw‑audio Speech Commands and the Path‑X task with few parameters.
arXiv:2606. 11251v1 Announce Type: new Abstract: Many multivariate dynamical systems are observed only through trajectories, leaving the mechanisms governing their joint dynamics hidden.
The paper introduces a framework for aligning the inductive bias of linear time‑invariant State Space Models (SSMs) with task‑specific spectral characteristics. By formalizing the bias through an SSM‑induced kernel and showing its spectrum is governed by the model’s frequency response, the authors propose Task‑Dependent Initialization (TDI), a fast power‑spectrum matching method. Experiments on synthetic data, one‑layer SSMs, and deep SSMs across real‑world benchmarks demonstrate that TDI improves data‑efficient generalization when the task’s spectral structure differs from the default SSM bias.
arXiv:2607. 11958v1 Announce Type: new Abstract: Under the free energy principle, a predictive system does not observe reality directly; it maintains a generative model of the world and experiences that model's best current hypothesis.
The paper introduces Fundamental Dynamical Units (FDUs), signed three‑node interaction patterns that reduce the combinatorial complexity of interaction architectures in networked dynamical systems. By embedding FDU‑regularized structural inference into a physics‑informed neural ODE, the authors jointly recover interaction structure and perturbation‑resolved trajectories, demonstrating the approach on synthetic benchmarks. This framework enables motif‑prescribed intervention design and mechanistically interpretable inference in complex systems.
arXiv:2602. 01196v2 Announce Type: replace Abstract: Recurrent neural policies are widely used in partially observable control and meta-RL tasks.