aiqbench analysis
SpectraLDS introduces a provable distillation method for symmetric linear dynamical systems that achieves constant-time and constant-space inference independent of sequence length. By inverting spectral representations through convex optimization, the approach maintains predictive accuracy in sequence prediction tasks like language modeling while significantly improving efficiency. This work offers a theoretically grounded alternative for optimizing inference costs in architectures relying on linear state-space models.
SpectraLDS: Provable Distillation for Linear Dynamical Systems
arXiv:2505.17868v2 Announce Type: replace Abstract: We present the first provable method for identifying symmetric linear dynamical systems (LDS) with accuracy guarantees that are independent of the systems' state dimension or effective memory. Our approach builds upon recent work that represents symmetric LDSs as convolutions learnable via fixed spectral transformations. We show how to invert this representation, thereby recovering an LDS model from its spectral transform and yielding an end-to-end convex optimization procedure. This distillation preserves predictive accuracy while enabling constant-time and constant-space inference per token, independent of sequence length. We evaluate our method, SpectraLDS, as a component in sequence prediction architectures and demonstrate that accuracy is preserved while inference efficiency is improved on tasks such as language modeling.
Abstract:We present the first provable method for identifying symmetric linear dynamical systems (LDS) with accuracy guarantees that are independent of the systems' state dimension or effective memory. Our approach builds upon recent work that represents symmetric LDSs as convolutions learnable via fixed spectral transformations. We show how to invert this representation, thereby recovering an LDS model from its spectral transform and yielding an end-to-end convex optimization procedure. This distillation preserves predictive accuracy while enabling constant-time and constant-space inference per token, independent of sequence length. We evaluate our method, SpectraLDS, as a component in sequence prediction architectures and demonstrate that accuracy is preserved while inference efficiency is improved on tasks such as language modeling.
Machine Learning (cs.LG); Optimization and Control (math.OC)
arXiv:2505.17868 [cs.LG]
(or arXiv:2505.17868v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2505.17868 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 209 words
Related coverage
Spectral Distillation: From Nonlinear Dynamics to Linear State-Space Models
arXiv · Aug 7, 2026

Quantum algorithm training now provably stable across system dimensions
Quantum Zeitgeist · Sep 1, 2026

Koopman Theory and Metaethics
LessWrong · Sep 19, 2026

Researchers Find Fermionic Quantum Error Correction Needs Extra Steps
Quantum Zeitgeist · Sep 28, 2026