Tensor network subspace identification of polynomial state space models

2017/09/26 by Kim Batselier, Batselier, Kim, Ching Yun Ko +3 · 1 citation
Chemistry · Mathematics · Medicine · #Advanced NMR Techniques and Applications #Advanced Neuroimaging Techniques and Applications #FOS: Electrical engineering #Systems and Control (eess.SY) #Tensor decomposition and applications #electronic engineering #information engineering

paper · pdf · doi:10.48550/arxiv.1709.08773

openalex publication_date 2017/09/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This article introduces a tensor network subspace algorithm for the identification of specific polynomial state space models. The polynomial nonlinearity in the state space model is completely written in terms of a tensor network, thus avoiding the curse of dimensionality. We also prove how the block Hankel data matrices in the subspace method can be exactly represented by low rank tensor networks, reducing the computational and storage complexity significantly. The performance and accuracy of our subspace identification algorithm are illustrated by numerical experiments, showing that our tensor network implementation is around 20 times faster than the standard matrix implementation before the latter fails due to insufficient memory, is robust with respect to noise and can model real-world systems.

Citations

• TT-cross approximation for multidimensional arrays
• Tensor Decompositions and Applications

Cited by

• A tensor network approach for chaotic time series prediction

Related

• Tensor-based homogeneous polynomial dynamical system analysis from data
• Comb Tensor Networks vs. Matrix Product States: Enhanced Efficiency in High-Dimensional Spaces
• Efficient Approximation of Volterra Series for High-Dimensional Systems
• Quantized Fourier and Polynomial Features for more Expressive Tensor Network Models
• Automatic Structure Identification for Highly Nonlinear MIMO Volterra Tensor Networks