LGMLJul 16, 2013

A Safe Screening Rule for Sparse Logistic Regression

arXiv:1307.4145v290 citations
AI Analysis

This incremental improvement addresses efficiency issues for researchers and practitioners using sparse logistic regression in high-dimensional data applications.

The authors tackled the computational challenge of applying l1-regularized logistic regression to high-dimensional data by developing a fast screening rule (Slores) that identifies zero components in the solution vector, reducing features and improving efficiency by one magnitude in experiments.

The l1-regularized logistic regression (or sparse logistic regression) is a widely used method for simultaneous classification and feature selection. Although many recent efforts have been devoted to its efficient implementation, its application to high dimensional data still poses significant challenges. In this paper, we present a fast and effective sparse logistic regression screening rule (Slores) to identify the 0 components in the solution vector, which may lead to a substantial reduction in the number of features to be entered to the optimization. An appealing feature of Slores is that the data set needs to be scanned only once to run the screening and its computational cost is negligible compared to that of solving the sparse logistic regression problem. Moreover, Slores is independent of solvers for sparse logistic regression, thus Slores can be integrated with any existing solver to improve the efficiency. We have evaluated Slores using high-dimensional data sets from different applications. Extensive experimental results demonstrate that Slores outperforms the existing state-of-the-art screening rules and the efficiency of solving sparse logistic regression is improved by one magnitude in general.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes