We consider the numerical solution of the large convex quadratic program arising in training the learning machines named support vector machines. Since the matrix of the quadratic form is dense and generally large, solution approaches based on explicitstorage of this matrix are not practicable. Well known strategies for this quadratic program are based on decomposition techniques that split the problem into a sequence of smaller quadratic programming subproblems. For the solution of these subproblems we present an iterative projection-type method suited for the structure of the constraints and very eective in case of Gaussian support vector machines. We develop an appropriate decomposition technique designed to exploit the high performance of the proposed inner solver on medium or large subproblems. Numerical experiments on large-scale benchmark problems allow to compare this approach with another widelyused decomposition technique. Finally, a parallel extension of the proposed strategy is described.

Large quadratic programs in training gaussian support vector machines / Serafini, Thomas; G., Zanghirati; Zanni, Luca. - In: RENDICONTI DI MATEMATICA E DELLE SUE APPLICAZIONI. - ISSN 1120-7183. - STAMPA. - 23:(2003), pp. 257-275.

Large quadratic programs in training gaussian support vector machines

SERAFINI, Thomas;ZANNI, Luca
2003

Abstract

We consider the numerical solution of the large convex quadratic program arising in training the learning machines named support vector machines. Since the matrix of the quadratic form is dense and generally large, solution approaches based on explicitstorage of this matrix are not practicable. Well known strategies for this quadratic program are based on decomposition techniques that split the problem into a sequence of smaller quadratic programming subproblems. For the solution of these subproblems we present an iterative projection-type method suited for the structure of the constraints and very eective in case of Gaussian support vector machines. We develop an appropriate decomposition technique designed to exploit the high performance of the proposed inner solver on medium or large subproblems. Numerical experiments on large-scale benchmark problems allow to compare this approach with another widelyused decomposition technique. Finally, a parallel extension of the proposed strategy is described.
23
257
275
Large quadratic programs in training gaussian support vector machines / Serafini, Thomas; G., Zanghirati; Zanni, Luca. - In: RENDICONTI DI MATEMATICA E DELLE SUE APPLICAZIONI. - ISSN 1120-7183. - STAMPA. - 23:(2003), pp. 257-275.
Serafini, Thomas; G., Zanghirati; Zanni, Luca
File in questo prodotto:
File Dimensione Formato  
Large_quadratic_programs_in_training_Gaussian.pdf

accesso aperto

Tipologia: Versione dell'editore (versione pubblicata)
Dimensione 149.4 kB
Formato Adobe PDF
149.4 kB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11380/460725
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact