scholarly journals Sparse model identification using orthogonal forward regression with basis pursuit and D-optimality

2004 ◽  
Vol 151 (4) ◽  
pp. 491-498 ◽  
Author(s):  
X. Hong ◽  
S. Chen ◽  
M. Brown ◽  
C.J. Harris
Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Rubén Ibáñez ◽  
Emmanuelle Abisset-Chavanne ◽  
Amine Ammar ◽  
David González ◽  
Elías Cueto ◽  
...  

Sparse model identification by means of data is especially cumbersome if the sought dynamics live in a high dimensional space. This usually involves the need for large amount of data, unfeasible in such a high dimensional settings. This well-known phenomenon, coined as the curse of dimensionality, is here overcome by means of the use of separate representations. We present a technique based on the same principles of the Proper Generalized Decomposition that enables the identification of complex laws in the low-data limit. We provide examples on the performance of the technique in up to ten dimensions.


Algorithms ◽  
2018 ◽  
Vol 11 (11) ◽  
pp. 180 ◽  
Author(s):  
Junyao You ◽  
Yanjun Liu

This paper focuses on the joint estimation of parameters and time-delays of the multiple-input single-output output-error systems. Since the time-delays are unknown, an effective identification model with a high dimensional and sparse parameter vector is established based on overparameterization. Then, the identification problem is converted to a sparse optimization problem. Based on the basis pursuit de-noising criterion and the auxiliary model identification idea, an auxiliary model based basis pursuit de-noising iterative algorithm is presented. The parameters are estimated by solving a quadratic program, and the unavailable terms in the information vector are updated by the auxiliary model outputs iteratively. The time-delays are estimated according to the sparse structure of the parameter vector. The proposed method can obtain effective estimates of the parameters and time-delays from few sampled data. The simulation results illustrate the effectiveness of the proposed algorithm.


2021 ◽  
pp. 1-16
Author(s):  
Damien Guého ◽  
Puneet Singla ◽  
Manoranjan Majji ◽  
Robert G. Melton

Author(s):  
Alberto Leva ◽  
Sara Negro ◽  
Alessandro Vittorio Papadopoulos

Sign in / Sign up

Export Citation Format

Share Document