Association Journal of CSIAM
Supervised by Ministry of Education of PRC
Sponsored by Xi'an Jiaotong University
ISSN 1005-3085  CN 61-1269/O1

Chinese Journal of Engineering Mathematics ›› 2023, Vol. 40 ›› Issue (2): 310-320.doi: 10.3969/j.issn.1005-3085.2023.02.010

Previous Articles     Next Articles

Group Lasso Online Learning

ZHENG Naijia1,2,  ZHANG Hai1   

  1. 1. School of Mathematics, Northwest University, Xi'an 710127
    2. School of Mechanical Engineering, Northwestern Polytechnical University, Xi'an 710072
  • Received:2020-12-07 Accepted:2021-03-29 Online:2023-04-15 Published:2023-06-20
  • Supported by:
    The National Natural Science Foundation of China---Guangdong Joint Fund (U1811461); the Natural Science Foundation of Shaanxi Province (2021JQ-429).

Abstract:

Aiming at solving the Group Lasso of high-dimensional data or streaming data, the online learning model for the group lasso is proposed, and a closed-form solution of this model is obtained. Then the GFTPRL (Group Follow the Proximally Regularized Leader) algorithm is applied to logistic regression. Moreover, the GFTPRL algorithm's regret bound is proved to be good in online framework. Finally, the numerical results show that the prediction accuracy of the GFTPRL algorithm is significantly better than that of other mainstream sparse online algorithms when the sample size is large and the final model is sparse.

Key words: machine learning, Group Lasso, online learning, logistic regression

CLC Number: