arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1303.3987cs.LGcs.CVstat.ML
收藏

$l_{2,p}$矩阵范数及其在特征选择中的应用

$l_{2,p}$ Matrix Norm and Its Application in Feature Selection

Nanjing University of Aeronautics and Astronautics(南京航空航天大学)

Liping Wang, Songcan Chen

摘要:

近年来,$l_{2,1}$矩阵范数已广泛应用于计算机视觉、模式识别、生物研究等领域。作为$l_1$向量范数的扩展,混合$l_{2,1}$矩阵范数常用于寻找联合稀疏解。此外,还设计了一个有效的迭代算法来求解包含$l_{2,1}$ -范数的极小化问题。实际上,计算研究表明$l_p$ -正则化($0<p<1$)比$l_1$ -正则化更稀疏,但很少考虑矩阵范数的扩展。本文给出了混合$l_{2,p}$ $(p\in (0, 1])$矩阵伪范数的定义,它既是$l_p$向量范数对矩阵的推广,也是$l_{2,1}$ -范数对非凸情形$(0<p<1)$的推广.幸运的是,一个有效的统一算法被提出来解决诱导$l_{2,p}$ -范数$(p\in (0, 1])$优化问题。对于所有的$p\in (0, 1]$,也可以一致地证明收敛性。将典型的$p\in (0,1]$用于计算生物学中的特征选择,实验结果表明,对$0<p<1$的某些选择确实改善了使用$p=1$的稀疏模式。

英文摘要:

Recently, $l_{2,1}$ matrix norm has been widely applied to many areas such as computer vision, pattern recognition, biological study and etc. As an extension of $l_1$ vector norm, the mixed $l_{2,1}$ matrix norm is often used to find jointly sparse solutions. Moreover, an efficient iterative algorithm has been designed to solve $l_{2,1}$-norm involved minimizations. Actually, computational studies have showed that $l_p$-regularization ($0<p<1$) is sparser than $l_1$-regularization, but the extension to matrix norm has been seldom considered. This paper presents a definition of mixed $l_{2,p}$ $(p\in (0, 1])$ matrix pseudo norm which is thought as both generalizations of $l_p$ vector norm to matrix and $l_{2,1}$-norm to nonconvex cases $(0<p<1)$. Fortunately, an efficient unified algorithm is proposed to solve the induced $l_{2,p}$-norm $(p\in (0, 1])$ optimization problems. The convergence can also be uniformly demonstrated for all $p\in (0, 1]$. Typical $p\in (0,1]$ are applied to select features in computational biology and the experimental results show that some choices of $0<p<1$ do improve the sparse pattern of using $p=1$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑