Return
Optimizing resources in model selection for support vector machine
DOI:10.1016/j.patcog.2006.06.012.png)
Abstract
En 中文
Tuning support vector machine (SVM) hyperparameters is an important step in achieving a high-performance learning machine. It is usually done by minimizing an estimate of generalization error based on the bounds of the leave-one-out (LOO) such as radius-margin bound and on the performance measures such as generalized approximate cross-validation (GACV), empirical error, etc. These usual automatic methods used to tune the hyperparameters require an inversion of the Gram-Schmidt matrix or a resolution of an extra-quadratic programming problem. In the case of a large data set these methods require the addition of huge amounts of memory and a long CPU time to the already significant resources used in SVM training. In this paper, we propose a fast method based on an approximation of the gradient of the empirical error, along with incremental learning, which reduces the resources required both in terms of processing time and of storage space. We tested our method on several benchmarks, which produced promising results confirming our approach. Furthermore, it is worth noting that the gain time increases when the data set is large. (c) 2006 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
Keywords:
model selection
SVM
kernel
hyperparameters
optimizing time
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
No organization information available
Cited Papers
Monitoring of the Training Load and Well-Being of Elite Rhythmic Gymnastics Athletes in 25 Weeks: A Comparison between Starters and Reserves
Sports
IF0
Structure and transport properties of polymer inclusion membranes for Pb(II) separation
Desalination
IF0
no more

