An accelerator for online SVM based on the fixed-size KKT window

被引:7
|
作者
Guo, Husheng [1 ,2 ]
Zhang, Aijuan [1 ]
Wang, Wenjian [1 ,2 ]
机构
[1] Shanxi Univ, Sch Comp & Informat Technol, Taiyuan 030006, Shanxi, Peoples R China
[2] Shanxi Univ, Key Lab Computat Intelligence & Chinese Informat, Taiyuan 030006, Shanxi, Peoples R China
基金
中国国家自然科学基金;
关键词
Online support vector machine; KKT conditions; Window technology; Accelerator; SUPPORT VECTOR MACHINE; ALGORITHM; MODEL;
D O I
10.1016/j.engappai.2020.103637
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Support vector machine (SVM), as a general and useful supervised learning tool, is facing with some challenges such as low learning efficiency, poor generalization performance, noise sensitivity, etc. when it is applied to online learning tasks. To overcome these limitations, an accelerator model based on window technology and the KKT conditions for online SVM learning is proposed in this paper. The proposed model is not an independent online algorithm but may be regarded as an accelerator for other online SVM learning algorithms, and it constructs working set of SVM by a fixed-size window with the samples which violate the KKT conditions. The relationship between Lagrangain multipliers in dual problem of SVM and KKT conditions are analyzed in the case of online learning. On this basis, a fixed-size KKT window can be constructed according to whether the samples violate KKT conditions or not. Then, it takes the samples that violate the KKT conditions as the training window, which not only makes the training samples with the same size each time, but also ensures that all samples are useful for the hyperplane updating (it means that the classifier can be updated more smoothly). Two typical and specific online SVM algorithms are used as baseline, and the corresponding speeding online SVM learning algorithms with "X+accelerator" models are proposed to testing the performance of the proposed accelerator. Comprehensive experiments clearly show that the proposed model can accelerate the online learning process effectively and has good robustness and generalization performance.
引用
收藏
页数:18
相关论文
共 50 条
  • [1] Fixed-Size Pegasos for Hinge and Pinball Loss SVM
    Jumutc, Vilen
    Huang, Xiaolin
    Suykens, Johan A. K.
    2013 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2013,
  • [2] Fixed-size LS-SVM LPV System Identification for Large Datasets
    Luca Cavanini
    Riccardo Felicetti
    Francesco Ferracuti
    Andrea Monteriù
    International Journal of Control, Automation and Systems, 2023, 21 : 4067 - 4079
  • [3] Fixed-size LS-SVM LPV System Identification for Large Datasets
    Cavanini, Luca
    Felicetti, Riccardo
    Ferracuti, Francesco
    Monteriu, Andrea
    INTERNATIONAL JOURNAL OF CONTROL AUTOMATION AND SYSTEMS, 2023, 21 (12) : 4067 - 4079
  • [4] FIXED-SIZE RECTANGULAR CONFIDENCE REGIONS
    JONES, ER
    COMMUNICATIONS IN STATISTICS PART A-THEORY AND METHODS, 1977, 6 (03): : 251 - 264
  • [5] Hedonic Games with Fixed-Size Coalitions
    Bilo, Vittorio
    Monaco, Gianpiero
    Moscardelli, Luca
    THIRTY-SIXTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FOURTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE / TWELVETH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2022, : 9287 - 9295
  • [6] MAXIMIZING ANTICHAINS IN THE CUBE WITH FIXED-SIZE OF A SHADOW
    LABAHN, R
    ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 1992, 9 (04): : 349 - 355
  • [7] Bloom Filter for Fixed-Size Beacon in VANET
    Nakorn, Kulit Na
    Ji, Yusheng
    Rojviboonchai, Kultida
    2014 IEEE 79TH VEHICULAR TECHNOLOGY CONFERENCE (VTC-SPRING), 2014,
  • [8] Dynamic routing on networks with fixed-size buffers
    Aiello, W
    Ostrovsky, R
    Kushilevitz, E
    Rosén, A
    PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 771 - 780
  • [9] AN ALGORITHM FOR FUNCTIONAL RECONFIGURATION OF FIXED-SIZE ARRAYS
    LOMBARDI, F
    SCIUTO, D
    STEFANELLI, R
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1988, 7 (10) : 1114 - 1118
  • [10] On Applicability of Fixed-Size Moving Windows for ANN-based Effort Estimation
    Amasaki, Sousuke
    Lokan, Chris
    PROCEEDINGS OF 2016 JOINT CONFERENCE OF THE INTERNATIONAL WORKSHOP ON SOFTWARE MEASUREMENT AND THE INTERNATIONAL CONFERENCE ON SOFTWARE PROCESS AND PRODUCT MEASUREMENT (IWSM-MENSURA), 2016, : 213 - 218