GPDT
Parallel software for training large scale support vector machines on multiprocessor systems Parallel software for solving the quadratic program arising in training support vector machines for classification problems is introduced. The software implements an iterative decomposition technique and exploits both the storage and the computing resources available on multiprocessor systems, by distributing the heaviest computational tasks of each decomposition iteration. Based on a wide range of recent theoretical advances, relevant decomposition issues, such as the quadratic subproblem solution, the gradient updating, the working set selection, are systematically described and their careful combination to get an effective parallel tool is discussed. A comparison with state-of-the-art packages on benchmark problems demonstrates the good accuracy and the remarkable time saving achieved by the proposed software. Furthermore, challenging experiments on real-world data sets with millions training samples highlight how the software makes large scale standard nonlinear support vector machines effectively tractable on common multiprocessor systems. This feature is not shown by any of the available codes.
Keywords for this software
References in zbMATH (referenced in 35 articles , 2 standard articles )
Showing results 1 to 20 of 35.
Sorted by year (- Amaral, Sergio; Allaire, Douglas; Willcox, Karen: Optimal $L_2$-norm empirical importance weights for the change of probability measure (2017)
- Chen, Tianyi; Curtis, Frank E.; Robinson, Daniel P.: A reduced-space algorithm for minimizing $\ell_1$-regularized convex functions (2017)
- Nosratipour, Hadi; Fard, Omid Solaymani; Borzabadi, Akbar Hashemi; Sarani, Farhad: Stable equilibrium configuration of two bar truss by an efficient nonmonotone global Barzilai-Borwein gradient method in a fuzzy environment (2017)
- Stanković, Ljubiša; Daković, Miloš; Vujović, Stefan: Reconstruction of sparse signals in impulsive disturbance environments (2017)
- Camelo, S.A.; González-Lima, M.D.; Quiroz, A.J.: Nearest neighbors methods for support vector machines (2015)
- Niu, Lingfeng; Zhou, Ruizhi; Zhao, Xi; Shi, Yong: Two new decomposition algorithms for training bound-constrained support vector machines (2015)
- Beck, Amir: The 2-coordinate descent method for solving double-sided simplex constrained minimization problems (2014)
- Cassioli, A.; Di Lorenzo, D.; Sciandrone, M.: On the convergence of inexact block coordinate descent methods for constrained optimization (2013)
- Dai, Yu-Hong: A new analysis on the Barzilai-Borwein gradient method (2013)
- He, Hongjin; Han, Deren; Li, Zhibao: Some projection methods with the BB step sizes for variational inequalities (2012)
- Gonzalez-Lima, Maria D.; Hager, William W.; Zhang, Hongchao: An affine-scaling interior-point method for continuous knapsack constraints with application to support vector machines (2011)
- Liuzzi, Giampaolo; Palagi, Laura; Piacentini, Mauro: On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds (2011)
- Niu, Lingfeng; Yuan, Ya-Xiang: A parallel decomposition algorithm for training multiclass kernel-based vector machines (2011)
- Andretta, Marina; Birgin, Ernesto G.; Martínez, J.M.: Partial spectral projected gradient method with active-set strategy for linearly constrained optimization (2010)
- Fletcher, Roger; Zanghirati, Gaetano: Binary separation and training support vector machines (2010)
- Ruggiero, Valeria; Serafini, Thomas; Zanella, Riccardo; Zanni, Luca: Iterative regularization algorithms for constrained image deblurring on graphics processors (2010)
- Zhu, Mingqiang; Wright, Stephen J.; Chan, Tony F.: Duality-based algorithms for total-variation-regularized image restoration (2010)
- Bonettini, Silvia; Serafini, Thomas: Non-negatively constrained image deblurring with an inexact interior point method (2009)
- Bonettini, S.; Zanella, R.; Zanni, L.: A scaled gradient projection method for constrained image deblurring (2009)
- La Cruz, William; Noguera, Gilberto: Hybrid spectral gradient method for the unconstrained minimization problem (2009)