返回
On group-wise lp regularization: Theory and efficient algorithms
DOI:10.1016/j.patcog.2015.05.009.png)
摘要
En 中文
Following advances in compressed sensing and high-dimensional statistics, many pattern recognition methods have been developed with l(1) regularization, which promotes sparse solutions. In this work, we instead advocate the use of l(p) (2 >= p > 1) regularization in a group setting which provides a better trade-off between sparsity and algorithmic stability. We focus on the simplest case with squared loss, which is known as group bridge regression. On the theoretical side, we prove that group bridge regression is uniformly stable and thus generalizes, which is an important property of a learning method. On the computational side, we make group bridge regression more practically attractive by deriving provably convergent and computationally efficient optimization algorithms. We show that there are at least several values of p over (1,2) at which the iterative update is analytical, thus it is even suitable for large-scale settings. We demonstrate the clear advantage of group bridge regression with the proposed algorithms over other competitive alternatives on several datasets. As l(p)-regularization allows one to achieve flexibility in sparseness/denseness of the solution, we hope that the algorithms will be useful for future applications of this regularization. (C) 2015 Elsevier Ltd. All rights reserved.
Keyword:
l(p) Regularization
Convex optimization algorithms
ADMM
FISTA
Algorithmic stability
Lasso
Group Lasso
Bridge regression
Group bridge regression
Splice detection
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
Asymptotic properties of bridge estimators in sparse high-dimensional regression models稀疏高维回归模型中桥估计的渐近性质
ANNALS OF STATISTICS
IF3.7
Graphene/Ionic Liquid Binary Electrode Material for High Performance Supercapacitor用于高性能超级电容器的石墨烯/离子液体二元电极材料

