Automatic Structure Identification for Highly Nonlinear MIMO Volterra Tensor Networks

The Volterra Tensor Network lifts the curse of dimensionality for truncated, discrete times Volterra models, enabling scalable representation of highly nonlinear system. This scalability comes at the cost of introducing randomness through initialization, and leaves open the challenge of how to efficiently determine the hyperparameters model order and memory length. In this paper, we present a unified framework that simultaneously addresses both challenges: We derive two algorithms that incrementally increase the model order and memory length along. Further we proof that the updates are performed along conjugate directions by establishing a mathematical equivalence between our proposed algorithms and equality constrained least squares systems. We present several strategies how to use our proposed algorithms for initialization and hyperparameter selection. In numerical experiments, we demonstrate that our proposed algorithms are more accurate and efficient than the state-of-the-art Volterra Tensor Network and achieve competitive results to several state-of-the-art Volterra models.

Publication Details

Journal
ArXiv.org
Published
2025-09-23
Primary Topic
Tensor decomposition and applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Automatic Structure Identification for Highly Nonlinear MIMO Volterra Tensor Networks

ArXiv.org
Tensor decomposition and applications
article

Automatic Structure Identification for Highly Nonlinear MIMO Volterra Tensor Networks

article en

Abstract

The Volterra Tensor Network lifts the curse of dimensionality for truncated, discrete times Volterra models, enabling scalable representation of highly nonlinear system. This scalability comes at the cost of introducing randomness through initialization, and leaves open the challenge of how to efficiently determine the hyperparameters model order and memory length. In this paper, we present a unified framework that simultaneously addresses both challenges: We derive two algorithms that incrementally increase the model order and memory length along. Further we proof that the updates are performed along conjugate directions by establishing a mathematical equivalence between our proposed algorithms and equality constrained least squares systems. We present several strategies how to use our proposed algorithms for initialization and hyperparameter selection. In numerical experiments, we demonstrate that our proposed algorithms are more accurate and efficient than the state-of-the-art Volterra Tensor Network and achieve competitive results to several state-of-the-art Volterra models.

ArXiv.org
Openalex Percentile: Top 52%
Tensor decomposition and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.