Wang chengjing Associate Professor
  

  • Education Level: PhD graduate

  • Degree: Doctor of science

  • Business Address: 西南交通大学数学学院

  • Professional Title: Associate Professor

  • Alma Mater: 新加坡国立大学

  • School/Department: 数学学院

  • MORE>
    Language: 中文

    Paper Publications

    An efficient algorithm for a class of large-scale support vector machines exploiting hidden sparsity

    Journal:IEEE Transactions on Signal Processing

    Key Words:Support vector machines, semismooth Newton method, augmented Lagrangian method, hidden sparsity

    Abstract:Support vector machines (SVMs) are successful supervised learning models that analyze data for classification and regression. Previous work has demonstrated the superiority of the SVMs in dealing with the high dimensional, low sample size problems. However, the increase of the sample size brings great challenges to accurately and efficiently solve the large-scale SVMs, especially for the nonlinear kernel SVMs, which may lead to huge computational costs and unaffordable storage burden. In this paper, we propose a highly efficient sparse semismooth Newton (SsN) based augmented Lagrangian (AL) method for solving a class of large-scale SVMs that can be formulated as a convex quadratic programming problem with a linear equality constraint and a simple box constraint. The asymptotic superlinear convergence rate of both the primal and the dual iteration sequences generated by the AL method is guaranteed due to the piecewise linear-quadratic structure of the problem. Furthermore, we reveal the close connection between the number of support vectors and the sparse structure of the generalized Jacobian for the inner subproblem of the AL method. By exploiting this hidden sparsity, the inner subproblem can be solved by the SsN method efficiently and accurately, which greatly reduces the storage burden and computational costs. In particular, for the nonlinear kernel SVMs, since the sparse structure may not manifest in the early iterations of the AL method, we solve a linear kernel SVM approximated by the random Fourier features method to produce a good initial point, and then transfer to solve the original problem. Numerical experiments demonstrate that the proposed algorithm outperforms the current state-of-the-art solvers for the large-scale SVMs.

    Co-author:Tang Peipei,Wang Qingsong,Song Enbin

    First Author:Niu Dunbiao

    Indexed by:SCI

    Correspondence Author:Wang Chengjing

    Discipline:Science

    Volume:70

    Page Number:5608-5623

    Translation or Not:no

    Date of Publication:2022-12-07

    Included Journals:SCI

    Copyright © 2019 Southwest Jiaotong University.All Rights Reserved . ICP reserve 05026985
    Address:999 Xi'an Road, Pidu District, Chengdu, Sichuan, China
     Chuangongnet Anbei 510602000061
    Technical support: Office of Information Technology and network management
    Click:    MOBILE Version Login

    The Last Update Time : ..