Stopping Conditions for Exact Computation of Leave-One-Out Error in Support Vector Machines
published: Aug. 29, 2008, recorded: July 2008, views: 31
Related content
48:34
665 views - Pavel Laskov, 2007
20:21
139 views - Pavel Laskov, 2005
07:59
176 views - Yoram Singer, 2008
01:12:20
7797 views - Umberto Eco, 2007
02:16:28
2202 views - Arnaud Doucet, 2007
01:12:00
891 views - Vladimir Vapnik, 2003
21:07
87 views - Yang Wang, 2008
21:56
86 views - Alexander Shekhovtsov, 2008
16:37
137 views - Xinhua Zhang, 2008
05:12:02
3887 views - Alexander J. Smola, 2008
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Description
We propose a new stopping condition for a Support Vector Machine (SVM) solver which precisely reflects the objective of the Leave-One-Out error computation. The stopping condition guarantees that the output on an intermediate SVM solution is identical to the output of the optimal SVM solution with one data point excluded from the training set. A simple augmentation of a general SVM training algorithm allows one to use a stopping criterion equivalent to the proposed sufficient condition. A comprehensive experimental evaluation of our method shows consistent speedup of the exact LOO computation by our method, up to the factor of 13 for the linear kernel. The new algorithm can be seen as an example of constructive guidance of an optimization algorithm towards achieving the best attainable expected risk at optimal computational cost.
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !




Write your own review or comment: