View Single Post
  #2  
Old 07-24-2013, 08:48 PM
yaser's Avatar
yaser yaser is offline
Caltech
 
Join Date: Aug 2009
Location: Pasadena, California, USA
Posts: 1,478
Default Re: Learning performance comparable to SVM that doesnt require QP

Quote:
Originally Posted by hsolo View Post
1. Is there any learning algorithm/approach that offers, in practice, performance comparable to SVM but that doesnt require QP?

For eg, http://cbcl.mit.edu/cbcl/publications/ps/rlsc.pdf

2. At a high level is it correct to think of regularization as introducing a 'softness' and thus a 'generalization dividend' for regression problems and of SVMs (soft kernels) as introducing a generalization dividend for classification problems, albeit at the cost of QP?
1. Different techniques outperform others in different problems, so other methods, including the one you mention, will indeed beat SVM in some cases. None of the methods wins in all applications.

2. This is a legitimate way of looking at it.
__________________
Where everyone thinks alike, no one thinks very much
Reply With Quote