.png){kind=icon}
返回
Greedy Projected Gradient-Newton Method for Sparse Logistic Regression
.png){kind=icon}
PRE
AI
DOI：10.1109/TNNLS.2019.2905261.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Sparse logistic regression (SLR), which is widely used for classification and feature selection in many fields, such as neural networks, deep learning, and bioinformatics, is the classical logistic regression model with sparsity constraints. In this paper, we perform theoretical analysis on the existence and uniqueness of the solution to the SLR, and we propose a greedy projected gradient-Newton (GPGN) method for solving the SLR. The GPGN method is a combination of the projected gradient method and the Newton method. The following characteristics show that the GPGN method achieves not only elegant theoretical results but also a remarkable numerical performance in solving the SLR: 1) the full iterative sequence generated by the GPGN method converges to a global/local minimizer of the SLR under weaker conditions; 2) the GPGN method has the properties of afinite identification for an optimal support set and local quadratic convergence; and 3) the GPGN method achieves higher accuracy and higher speed compared with a number of state-of-the-art solvers according to numerical experiments.
Keyword:
Convergence analysis
greedy projected gradient-Newton (GPGN) algorithm
model analysis
numerical experiment
sparse logistic regression (SLR)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.9
论文数:
7.6K
被引数:
7.2W
机构
引用论文
Cooperative effects of metal cations and coordination modes on luminescent s-block metal–organic complexes constructed from V-shaped 4,4′-sulfonyldiphenol.png)
CrystEngComm
CrystEngCommIF0
PREAI
分享收藏
查看更多内容