An efficient parallel and distributed solution to nonconvex penalized linear SVMs

Support vector machines (SVMs) have been recognized as a powerful tool to perform linear classification. When combined with the sparsity-inducing nonconvex penalty, SVMs can perform classification and variable selection simultaneously. However, the nonconvex penalized SVMs in general cannot be solve...

Full description

Saved in:
Bibliographic Details
Published in:Frontiers of information technology & electronic engineering 2020-04, Vol.21 (4), p.587-603
Main Authors: Guan, Lei, Sun, Tao, Qiao, Lin-bo, Yang, Zhi-hui, Li, Dong-sheng, Ge, Ke-shi, Lu, Xi-cheng
Format: Article
Language:English
Subjects:
Algorithms
Classification
Communications Engineering
Complexity
Computer Hardware
Computer Science
Computer Systems Organization and Communication Networks
Cost analysis
Electrical Engineering
Electronics and Microelectronics
Instrumentation
Networks
Support vector machines
Synchronism
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Support vector machines (SVMs) have been recognized as a powerful tool to perform linear classification. When combined with the sparsity-inducing nonconvex penalty, SVMs can perform classification and variable selection simultaneously. However, the nonconvex penalized SVMs in general cannot be solved globally and efficiently due to their nondifferentiability, nonconvexity, and nonsmoothness. Existing solutions to the nonconvex penalized SVMs typically solve this problem in a serial fashion, which are unable to fully use the parallel computing power of modern multi-core machines. On the other hand, the fact that many real-world data are stored in a distributed manner urgently calls for a parallel and distributed solution to the nonconvex penalized SVMs. To circumvent this challenge, we propose an efficient alternating direction method of multipliers (ADMM) based algorithm that solves the nonconvex penalized SVMs in a parallel and distributed way. We design many useful techniques to decrease the computation and synchronization cost of the proposed parallel algorithm. The time complexity analysis demonstrates the low time complexity of the proposed parallel algorithm. Moreover, the convergence of the parallel algorithm is guaranteed. Experimental evaluations on four LIBSVM benchmark datasets demonstrate the efficiency of the proposed parallel algorithm.
ISSN:2095-9184
2095-9230
DOI:10.1631/FITEE.1800566