Timezone: »

Scaling Up Sparse Support Vector Machines by Simultaneous Feature and Sample Reduction
Weizhong Zhang · Bin Hong · Wei Liu · Jieping Ye · Deng Cai · Xiaofei He · Jie Wang

Mon Aug 07 10:30 PM -- 10:48 PM (PDT) @ C4.4

Sparse support vector machine (SVM) is a popular classification technique that can simultaneously learn a small set of the most interpretable features and identify the support vectors. It has achieved great successes in many real-world applications. However, for large-scale problems involving a huge number of samples and extremely high-dimensional features, solving sparse SVMs remains challenging. By noting that sparse SVMs induce sparsities in both feature and sample spaces, we propose a novel approach, which is based on accurate estimations of the primal and dual optima of sparse SVMs, to simultaneously identify the features and samples that are guaranteed to be irrelevant to the outputs. Thus, we can remove the identified inactive samples and features from the training phase, leading to substantial savings in both the memory usage and computational cost without sacrificing accuracy. To the best of our knowledge, the proposed method is the \emph{first} \emph{static} feature and sample reduction method for sparse SVMs. Experiments on both synthetic and real datasets (e.g., the kddb dataset with about 20 million samples and 30 million features) demonstrate that our approach significantly outperforms state-of-the-art methods and the speedup gained by our approach can be orders of magnitude.

Author Information

Weizhong Zhang (Zhejiang University & Tencent AI Lab)
Bin Hong (Zhejiang University)
Wei Liu (Tencent AI Lab)
Jieping Ye (University of Michigan)
Deng Cai (Zhejiang University)
Xiaofei He (Zhejiang University)
Jie Wang (University of Michigan)

Related Events (a corresponding poster, oral, or spotlight)

More from the Same Authors