The LCCP for Optimizing Kernel Parameters for SVM
Tuning hyper-parameters is a necessary step to improve learning algorithm performances. For Support Vector Machine classifiers, adjusting kernel parameters increases drastically the recognition accuracy. Basically, cross-validation is performed by sweeping exhaustively the parameter space. The complexity of such grid search is exponential with respect to the number of optimized parameters. Recently, a gradient descent approach has been introduced in which reduces drastically the search steps of the optimal parameters. In this paper, we define the LCCP (Log Convex Concave Procedure) optimization scheme derived from the CCCP (Convex ConCave Procedure) for optimizing kernel parameters by minimizing the radius-margin bound. To apply the LCCP, we prove, for a particular choice of kernel, that the radius is log convex and the margin is log concave. The LCCP is more efficient than gradient descent technique since it insures that the radius margin bound decreases monotonically and converges to a local minimum without searching the size step. Experimentations with standard data sets are provided and discussed.
Unable to display preview. Download preview PDF.
- 2.Vapnik, V.: The Nature of Statistical Learning Theory, 2nd edn. Springer, New York (1999)Google Scholar
- 3.Tsuda, K.: Optimal hyperplane classifier with adaptive norm. Technical report tr-99-9, ETL (1999)Google Scholar
- 5.Boughorbel, S.: Kernels for Image Classification with SVM, Ph.D. thesis, submited to University of Paris Sud, Orsay (2005)Google Scholar