Sparse group lasso and high dimensional multinomial classification

详细信息    查看全文

• 作者：Martin Vincent ; Niels Richard Hansen
• 关键词：Sparse group lasso ; Classification ; High dimensional data analysis ; Coordinate gradient descent ; Penalized loss
• 刊名：Computational Statistics and Data Analysis
• 出版年：March, 2014
• 年：2014
• 卷：71
• 期：Complete
• 页码：771-786
• 全文大小：898 K

文摘

The sparse group lasso optimization problem is solved using a coordinate gradient descent algorithm. The algorithm is applicable to a broad class of convex loss functions. Convergence of the algorithm is established, and the algorithm is used to investigate the performance of the multinomial sparse group lasso classifier. On three different real data examples the multinomial group lasso clearly outperforms multinomial lasso in terms of achieved classification error rate and in terms of including fewer features for the classification. An implementation of the multinomial sparse group lasso algorithm is available in the R package msgl. Its performance scales well with the problem size as illustrated by one of the examples considered鈥攁 50 class classification problem with 10聽k features, which amounts to estimating 500 k parameters.