arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1009.4219cs.LGcs.SYeess.SYmath.OC
收藏

LASSO和稀疏监督学习问题的安全特征消除

Safe Feature Elimination for the LASSO and Sparse Supervised Learning Problems

Laurent El Ghaoui, Vivian Viallon, Tarek Rabbani

AI总结:

提出一种快速方法,在LASSO问题中消除无关特征,显著减少运行时间,并可推广到一般l1惩罚凸问题。

摘要:

我们描述了一种快速方法,用于消除l1惩罚最小二乘回归(或LASSO)问题中的特征(变量)。特征的消除可能导致运行时间的大幅减少,特别是对于惩罚参数的大值。我们的方法不是启发式的:它只消除那些在解决LASSO问题后保证不存在的特征。特征消除步骤易于并行化,并且可以独立测试每个特征的消除。此外,与解决LASSO问题的计算量相比,我们的方法的计算努力可以忽略不计——大致相当于单个梯度步骤的计算量。我们的方法扩展了现有LASSO算法的范围,以处理以前无法达到的更大数据集。我们展示了如何将我们的方法扩展到一般的l1惩罚凸问题,并给出了稀疏支持向量机和逻辑回归问题的初步结果。

英文摘要:

We describe a fast method to eliminate features (variables) in l1 -penalized least-square regression (or LASSO) problems. The elimination of features leads to a potentially substantial reduction in running time, specially for large values of the penalty parameter. Our method is not heuristic: it only eliminates features that are guaranteed to be absent after solving the LASSO problem. The feature elimination step is easy to parallelize and can test each feature for elimination independently. Moreover, the computational effort of our method is negligible compared to that of solving the LASSO problem - roughly it is the same as single gradient step. Our method extends the scope of existing LASSO algorithms to treat larger data sets, previously out of their reach. We show how our method can be extended to general l1 -penalized convex problems and present preliminary results for the Sparse Support Vector Machine and Logistic Regression problems.

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

↑