paper-with-me

Papers

Provable Benefits of Complex Parameterizations for Structured State Space Models

2024-10-17 · Yuval Ran-Milo, Eden Lumbroso, Edo Cohen-Karlik, Raja Giryes, Amir Globerson, Nadav Cohen

Structured state space models (SSMs), the core engine behind prominent neural networks such as S4 and Mamba, are linear dynamical systems adhering to a specified structure, most notably diagonal. In contrast to typical neural network modules, whose parameterizations are real, SSMs often use complex parameterizations. Theoretically explaining the benefits of complex parameterizations for SSMs is an open problem. The current paper takes a step towards its resolution, by establishing formal gaps between real and complex diagonal SSMs. Firstly, we prove that while a moderate dimension suffices in order for a complex SSM to express all mappings of a real SSM, a much higher dimension is needed for a real SSM to express mappings of a complex SSM. Secondly, we prove that even if the dimension of a real SSM is high enough to express a given mapping, typically, doing so requires the parameters of the real SSM to hold exponentially large values, which cannot be learned in practice. In contrast, a complex SSM can express any given mapping with moderate parameter values. Experiments corroborate our theory, and suggest a potential extension of the theory that accounts for selectivity, a new architectural feature yielding state of the art performance.

📄 PDF Abstract BibTeX arXiv:2410.14067

Code (1)

edenlum/ssmcomplexparambenefits 공식 구현 pytorch

Tasks

MambaState Space Models

Methods 이 논문이 사용한 방법론

Mamba Foundation models, now powering most of the exciting applications in deep learning, are almost universally based on the Transformer architecture and its core attention module.…

Similar Papers 제목 키워드 기반

On the sensitivity of pose estimation neural networks: rotation parameterizations, Lipschitz constants, and provable bounds

2022-03-16 · Trevor Avant, Kristi A. Morgansen

In this paper, we approach the task of determining sensitivity bounds for pose estimation neural networks. This task is particularly challenging as it requires characterizing the sensitivity of 3D rotations. We develop a…

Pose EstimationSensitivity

The Pitfalls of Imitation Learning when Actions are Continuous

2025-03-12 · Max Simchowitz, Daniel Pfrommer, Ali Jadbabaie

We study the problem of imitating an expert demonstrator in a discrete-time, continuous state-and-action control system. We show that, even if the dynamics satisfy a control-theoretic property called exponentially stabil…

ChunkingImitation LearningOffline RL

Tractable structured natural gradient descent using local parameterizations

2021-02-15 · Wu Lin, Frank Nielsen, Mohammad Emtiyaz Khan, Mark Schmidt

Natural-gradient descent (NGD) on structured parameter spaces (e.g., low-rank covariances) is computationally challenging due to difficult Fisher-matrix computations. We address this issue by using \emph{local-parameter …

Variational Inference

Towards Identifiability of Interventional Stochastic Differential Equations

2025-05-21 · Aaron Zweig, Zaikang Lin, Elham Azizi, David Knowles

We study identifiability of stochastic differential equation (SDE) models under multiple interventions. Our results give the first provable bounds for unique recovery of SDE parameters given samples from their stationary…

Structured Evolution with Compact Architectures for Scalable Policy Optimization

2018-04-06 · ICML 2018 7 · Krzysztof Choromanski, Mark Rowland, Vikas Sindhwani, Richard E. Turner 외

We present a new method of blackbox optimization via gradient approximation with the use of structured random orthogonal matrices, providing more accurate estimators than baselines and with provable theoretical guarantee…

OpenAI GymText-to-Image Generation