Regularized linear system identification using atomic, nuclear and kernel-based norms: the role of the stability constraint
From MaRDI portal
(Redirected from Publication:286265)
Abstract: Inspired by ideas taken from the machine learning literature, new regularization techniques have been recently introduced in linear system identification. In particular, all the adopted estimators solve a regularized least squares problem, differing in the nature of the penalty term assigned to the impulse response. Popular choices include atomic and nuclear norms (applied to Hankel matrices) as well as norms induced by the so called stable spline kernels. In this paper, a comparative study of estimators based on these different types of regularizers is reported. Our findings reveal that stable spline kernels outperform approaches based on atomic and nuclear norms since they suitably embed information on impulse response stability and smoothness. This point is illustrated using the Bayesian interpretation of regularization. We also design a new class of regularizers defined by "integral" versions of stable spline/TC kernels. Under quite realistic experimental conditions, the new estimators outperform classical prediction error methods also when the latter are equipped with an oracle for model order selection.
Recommendations
- Generalized system identification with stable spline kernels
- A new kernel-based approach for linear system identification
- Tuning complexity in regularized kernel-based regression and linear system identification: the robustness of the marginal likelihood estimator
- Maximum entropy vector kernels for MIMO system identification
- Kernel methods in system identification, machine learning and function estimation: a survey
Cites work
- scientific article; zbMATH DE number 45848 (Why is no real title available?)
- scientific article; zbMATH DE number 45871 (Why is no real title available?)
- scientific article; zbMATH DE number 842531 (Why is no real title available?)
- scientific article; zbMATH DE number 840151 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 2208228 (Why is no real title available?)
- A new kernel-based approach for linear system identification
- A new look at the statistical model identification
- Compressed sensing
- Convex vs non-convex estimators for regression and sparse estimation: the mean squared error properties of ARD and GLasso
- Estimation with quadratic loss.
- Exact matrix completion via convex optimization
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Frequency Domain Subspace Identification Using Nuclear Norm Minimization and Hankel Matrix Realizations
- Graph implementations for nonsmooth convex programs
- Interior-point method for nuclear norm approximation with application to system identification
- Kernel methods in system identification, machine learning and function estimation: a survey
- Model predictive control. With a foreword by M. J. Grimble and M. A. Johnson
- On covariance function tests used in system identification
- On the estimation of transfer functions, regularizations and Gaussian processes-revisited
- On the mathematical foundations of learning
- Prediction error identification of linear systems: a nonparametric Gaussian regression approach
- Sparse Estimation of Polynomial and Rational Dynamical Models
- System Identification Via Sparse Multiple Kernel-Based Regularization Using Sequential Convex Optimization Techniques
- System identification using Laguerre models
- Tensors in Image Processing and Computer Vision
- The Adaptive Lasso and Its Oracle Properties
- The Estimation of Prediction Error
- The convex geometry of linear inverse problems
- The elements of statistical learning. Data mining, inference, and prediction
- Theory of Reproducing Kernels
- Tuning complexity in regularized kernel-based regression and linear system identification: the robustness of the marginal likelihood estimator
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(31)- A new kernel-based approach to hybrid system identification
- Linear system identification using the sequential stabilizing spline algorithm
- When cannot regularization improve the least squares estimate in the kernel-based regularized system identification
- Stable spline identification of linear systems under missing data
- On asymptotic properties of hyperparameter estimators for kernel-based regularization methods
- Deep networks for system identification: a survey
- Maximum entropy vector kernels for MIMO system identification
- The harmonic analysis of kernel functions
- Stability analysis of distributed-order nonlinear dynamic systems
- Kernel-based identification with frequency domain side-information
- Kernel-based system identification with manifold regularization: a Bayesian perspective
- Kernel absolute summability is sufficient but not necessary for RKHS stability
- A shift in paradigm for system identification
- The generalized cross validation filter
- On input design for regularized LTI system identification: power-constrained input
- Regularized spectrum estimation using stable spline kernels
- Sequential stabilizing spline algorithm for linear systems: eigenvalue approximation and polishing
- Maximum entropy properties of discrete-time first-order stable spline kernel
- Fractional order neural networks for system identification
- The existence and uniqueness of solutions for kernel-based system identification
- Control-oriented regularization for linear system identification
- Tuning complexity in regularized kernel-based regression and linear system identification: the robustness of the marginal likelihood estimator
- Nuclear norm system identification with missing inputs and outputs
- On embeddings and inverse embeddings of input design for regularized system identification
- Generalized system identification with stable spline kernels
- Revisiting total model errors and model validation
- A new kernel-based approach for linear system identification
- Sparse estimation in linear dynamic networks using the stable spline horseshoe prior
- Subspace-based spectrum estimation in innovation models by mixed norm minimization
- On the regularization and optimization in quantum detector tomography
- System identification using kernel-based regularization: new insights on stability and consistency issues
This page was built for publication: Regularized linear system identification using atomic, nuclear and kernel-based norms: the role of the stability constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286265)
