.png){kind=icon}
返回
Damping proximal coordinate descent algorithm for non-convex regularization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2014.11.009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Non-convex regularization has attracted much attention in the fields of machine learning, since it is unbiased and improves the performance on many applications compared with the convex counterparts. The optimization is important but difficult for non-convex regularization. In this paper, we propose the Damping Proximal Coordinate Descent (DPCD) algorithms that address the optimization issues of a general family of non-convex regularized problems. DPCD is guaranteed to be globally convergent. The computational complexity of obtaining an approximately stationary solution with a desired precision is only linear to the data size. Our experiments on many machine learning benchmark datasets also show that DPCD has a fast convergence rate and it reduces the time of training models without significant loss of prediction accuracy. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Non-convex regularization
Non-convex optimization
Coordinate descent
Sparsity regularization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Preparation and modification of hierarchical nanostructured Bi2WO6with high visible light-induced photocatalytic activity具有高可见光诱导光催化活性的分级纳米结构Bi2WO6 的制备与改性
PREAI
分享收藏Graphene/Ionic Liquid Binary Electrode Material for High Performance Supercapacitor用于高性能超级电容器的石墨烯/离子液体二元电极材料
PREAI
分享收藏Nonconcave penalized likelihood with a diverging number of parameters具有不同数量参数的非凹惩罚似然.png)
ANNALS OF STATISTICS
OAAI
ANNALS OF STATISTICSIF3.7
OAAI分享收藏分享收藏Molecular epidemiology of Streptococcus agalactiae isolated from mastitis in Brazilian dairy herdsOAAI
OAAI分享收藏
查看更多内容