Decomposition Algorithms for Training Large-Scale Semiparametric Support Vector Machines

  • Authors:
  • Sangkyun Lee;Stephen J. Wright

  • Affiliations:
  • Computer Sciences Department, University of Wisconsin-Madison, Madison, USA 53706;Computer Sciences Department, University of Wisconsin-Madison, Madison, USA 53706

  • Venue:
  • ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part II
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

We describe a method for solving large-scale semiparametric support vector machines (SVMs) for regression problems. Most of the approaches proposed to date for large-scale SVMs cannot accommodate the multiple equality constraints that appear in semiparametric problems. Our approach uses a decomposition framework, with a primal-dual algorithm to find an approximate saddle point for the min-max formulation of each subproblem. We compare our method with algorithms previously proposed for semiparametric SVMs, and show that it scales well as the number of training examples grows.