.png){kind=icon}
Return
Distributed non-convex regularization for generalized linear regression
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2024.124177.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Distributed penalized generalized linear regression algorithms have been widely studied in recent years. However, they all assume that the data should be randomly distributed. In real applications, this assumption is not necessarily true, since the whole data are often stored in a non-random manner. To tackle this issue, a non- convex penalized distributed pilot sample surrogate negative log-likelihood learning procedure is developed, which can realize distributed high-dimensional variable selection for generalized linear models, and be adaptive to the non-random situations. The established theoretical results and numerical studies all validate the proposed method.
Keywords:
Generalized linear regression
Big data
Variable selection
Regularized learning
Journal
IF:
7.5
Papers:
3.0W
Citations:
10.2W
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSave
ShareSaveShareSaveShareSave View more