Skip to content
aiqbench takeMachine Learning

aiqbench analysis

This research advances the application of neural state-space models by introducing efficient online learning algorithms, bridging the gap between high-performance offline identification and real-time adaptation. The work provides rigorous convergence analysis for recursive formulations in subspace encoder-based architectures, offering a significant step forward for dynamic system control powered by deep learning.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Online learning of neural state-space models

arXiv2 min read

arXiv:2607.17614v1 Announce Type: cross Abstract: Recent advances in deep-learning-based nonlinear system identification have led to encoder-based estimation of neural state-space (ANN-SS) models that achieve state-of-the-art performance in offline settings by estimating initial model states from past input-output data. These methods are typically used in multiple-shooting-based offline identification, and online learning of these models remains largely unexplored. This paper presents a batch-wise learning pipeline and a direct recursive identification algorithm for subspace encoder-based ANN-SS models. We provide convergence analysis of the recursive formulation and validate its performance through extensive simulation studies. The results demonstrate that the proposed approach enables computationally efficient online adaptation with high model accuracy.

Abstract:Recent advances in deep-learning-based nonlinear system identification have led to encoder-based estimation of neural state-space (ANN-SS) models that achieve state-of-the-art performance in offline settings by estimating initial model states from past input-output data. These methods are typically used in multiple-shooting-based offline identification, and online learning of these models remains largely unexplored. This paper presents a batch-wise learning pipeline and a direct recursive identification algorithm for subspace encoder-based ANN-SS models. We provide convergence analysis of the recursive formulation and validate its performance through extensive simulation studies. The results demonstrate that the proposed approach enables computationally efficient online adaptation with high model accuracy.

Submitted to L-CSS. Extended version

Systems and Control (eess.SY); Machine Learning (cs.LG)

arXiv:2607.17614 [eess.SY]

(or arXiv:2607.17614v1 [eess.SY] for this version)

https://doi.org/10.48550/arXiv.2607.17614 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

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 · 204 words

Related coverage