Interior Point SVM
published: Sept. 1, 2008, recorded: July 2008, views: 244
Report a problem or upload filesIf 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.
Support vector machine training can be represented as a large quadratic program. We present an efficient and numerically stable algorithm for this problem using primal-dual interior point methods. Reformulating the problem to exploit separability of the Hessian eliminates the main source of computational complexity, resulting in an algorithm which requires only O(n) operations per iteration. Extensive use of L3 BLAS functions enables good parallel efficiency on shared-memory processors. As the algorithm works in primal and dual spaces simultaneously, our approach has the advantage of obtaining the hyperplane weights and bias directly from the solver.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !