How to tune the RBF SVM hyperparameters?: An empirical evaluation of 18 search algorithms release_cdlgg5hdlfakddjxqgcaad3lou

by Jacques Wainer, Pablo Fonseca

Released as a article .

2020  

Abstract

SVM with an RBF kernel is usually one of the best classification algorithms for most data sets, but it is important to tune the two hyperparameters C and γ to the data itself. In general, the selection of the hyperparameters is a non-convex optimization problem and thus many algorithms have been proposed to solve it, among them: grid search, random search, Bayesian optimization, simulated annealing, particle swarm optimization, Nelder Mead, and others. There have also been proposals to decouple the selection of γ and C. We empirically compare 18 of these proposed search algorithms (with different parameterizations for a total of 47 combinations) on 115 real-life binary data sets. We find (among other things) that trees of Parzen estimators and particle swarm optimization select better hyperparameters with only a slight increase in computation time with respect to a grid search with the same number of evaluations. We also find that spending too much computational effort searching the hyperparameters will not likely result in better performance for future data and that there are no significant differences among the different procedures to select the best set of hyperparameters when more than one is found by the search algorithms.
In text/plain format

Archived Files and Locations

application/pdf  494.3 kB
file_2euripzpergxpbfwjq4tvzkeci
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Archived
Type  article
Stage   submitted
Date   2020-08-26
Version   v1
Language   en ?
arXiv  2008.11655v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: bc9d74d8-b084-4d67-af9f-4d608ab062c9
API URL: JSON