Group sparse RLS algorithms
From MaRDI portal
Publication:2800923
Recommendations
- A novel generalized group-sparse mixture adaptive filtering algorithm
- Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
- On group-wise \(\ell_p\) regularization: theory and efficient algorithms
- The benefit of group sparsity
- Adaptive regularization using the entire solution surface
Cited in
(6)- The benefit of group sparsity
- Distributed sparse identification for stochastic dynamic systems under cooperative non-persistent excitation condition
- Block-sparsity regularized maximum correntropy criterion for structured-sparse system identification
- Group sparse optimization for learning predictive state representations
- Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring
- Online sparse identification for regression models
This page was built for publication: Group sparse RLS algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2800923)