Learning Stable and Robust Linear Parameter-Varying State-Space Models
Not on the map. Why?
Abstract (arXiv)
This paper presents two direct parameterizations of stable and robust linear parameter-varying state-space (LPV-SS) models. The model parametrizations guarantee a priori that for all parameter values during training, the allowed models are stable in the contraction sense or have their Lipschitz constant bounded by a user-defined value γ. Furthermore, since the parametrizations are direct, the models can be trained using unconstrained optimization. The fact that the trained models are of the LPV-SS class makes them useful for, e.g., further convex analysis or controller design. The effectiveness of the approach is demonstrated on an LPV identification problem.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 14 of its 23 references that are in the map. First posted on arXiv 4 Apr 2023.
Builds on
14 of 23 references.
References · 14
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,324
- 2019Efficient and Accurate Estimation of Lipschitz Constants for Deep Neural Networkscited by 290
- 2019Implicit Deep Learningcited by 124
- 2020Training robust neural networks using Lipschitz boundscited by 98
- 2018Stable Recurrent Modelscited by 65
- 2020Lipschitz Bounded Equilibrium Networkscited by 49
- 2023Direct Parameterization of Lipschitz-Bounded Deep Networkscited by 49
- 2021Recurrent Equilibrium Networks: Flexible Dynamic Models with Guaranteed Stability and Robustnesscited by 43
- 2023Lipschitz-bounded 1D convolutional neural networks using the Cayley transform and the controllability Gramiancited by 9
- 2022Deep-Learning-Based Identification of LPV Models for Nonlinear Systemscited by 5
- 2020Convex Incremental Dissipativity Analysis of Nonlinear Systems - Extended versioncited by 3
Built on by
Citing papers per year: 2023: 1.
1 paper.