Maximum Entropy Vector Kernels for MIMO system identification
Giulia Prando, Gianluigi Pillonetto, Alessandro Chiuso

TL;DR
This paper introduces a novel maximum entropy-based vector kernel approach for MIMO system identification, improving stability, smoothness, and complexity control over existing methods through hyper-parameter optimization and efficient algorithms.
Contribution
It develops a new kernel derived from maximum entropy principles that incorporates Hankel matrix structure, enabling better regularization and model complexity control in system identification.
Findings
Outperforms state-of-the-art methods in Monte-Carlo studies
Efficient hyper-parameter optimization via marginal likelihood maximization
Kernel structure effectively controls model complexity and stability
Abstract
Recent contributions have framed linear system identification as a nonparametric regularized inverse problem. Relying on -type regularization which accounts for the stability and smoothness of the impulse response to be estimated, these approaches have been shown to be competitive w.r.t classical parametric methods. In this paper, adopting Maximum Entropy arguments, we derive a new penalty deriving from a vector-valued kernel; to do so we exploit the structure of the Hankel matrix, thus controlling at the same time complexity, measured by the McMillan degree, stability and smoothness of the identified models. As a special case we recover the nuclear norm penalty on the squared block Hankel matrix. In contrast with previous literature on reweighted nuclear norm penalties, our kernel is described by a small number of hyper-parameters, which are iteratively updated through…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
