Skip to main content
SpringerLink
Log in

A recursive least squares algorithm with ℓ1 regularization for sparse representation

  • Letter
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Haykin S. Adaptive Filter Theory. 5th ed. Upper Saddle River: Pearson Prentice Hall, 2013

    Google Scholar 

  2. Tang Q, Li B Q, Chai Y, et al. Improved sparse representation based on local preserving projection for the fault diagnosis of multivariable system. Sci China Inf Sci, 2021, 64: 129204

    Article  Google Scholar 

  3. Moustakis N, Zhou B, Quang T L, et al. Fault detection and identification for a class of continuous piecewise affine systems with unknown subsystems and partitions. Int J Adapt Control Signal Process, 2018, 32: 980–993

    Article  MathSciNet  Google Scholar 

  4. Chen Y, Gu Y, Hero A O. Sparse LMS for system identification. In: Proceedings of IEEE International Conference on Acoustics, Speech & Signal Processing, 2019. 3125–3128

  5. Lim J, Lee K, Lee S. A modified recursive regularization factor calculation for sparse RLS algorithm with l1-norm. Mathematics, 2021, 9: 1580

    Article  Google Scholar 

  6. Eksioglu E M. Sparsity regularised recursive least squares adaptive filtering. IET Signal Process, 2011, 5: 480–487

    Article  MathSciNet  Google Scholar 

  7. Hong X, Gao J, Chen S. Zero attracting recursive least squares algorithms. IEEE Trans Veh Technol, 2016, 66: 213–221

    Google Scholar 

  8. Li Z F, Li D, Zhang J Q. A new penalized recursive least squares method with a variable regularization factor for adaptive sparse filtering. IEEE Access, 2018, 6: 31828–31839

    Article  Google Scholar 

  9. Zou H, Zhang H H. On the adaptive elastic-net with a diverging number of parameters. Ann Stat, 2009, 37: 1733–1751

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This work was supported by National Natural Science Foundation of China (Grant No. 62073074), Key Intergovernmental Special Fund of National Key Research and Development Program (Grant No. 2021YFE0198700), and Research Fund for International Scientists (Grant No. 62150610499).

Author information

Authors and Affiliations

  1. School of Cyber Science and Engineering, Southeast University, Nanjing, 210096, China

    Di Liu, Simone Baldi & Wenwu Yu

  2. School of Computation, Information and Technology, Technical University of Munich, Garching, 85748, Germany

    Di Liu

  3. School of Mathematics, Center for Mobile Communication and Security, Southeast University, Nanjing, 210096, China

    Simone Baldi & Wenwu Yu

  4. School of Artificial Intelligence, Southeast University, Suzhou, 215100, China

    Quan Liu

Authors
  1. Di Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Simone Baldi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Quan Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wenwu Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Simone Baldi or Wenwu Yu.

Additional information

Supporting information Appendixes A and B. The supporting information is available online at https://info.scichina.com and https://link.springer.com. The supporting materials are published as submitted, without typesetting or editing. The responsibility for scientific accuracy and content remains entirely with the authors.

Supplementary File

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, D., Baldi, S., Liu, Q. et al. A recursive least squares algorithm with ℓ1 regularization for sparse representation. Sci. China Inf. Sci. 66, 129202 (2023). https://doi.org/10.1007/s11432-022-3546-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11432-022-3546-5

Search

Navigation