Streaming Complexity of SVMs

Cited by: 0|Bibtex|Views28|Links

Abstract:

We study the space complexity of solving the bias-regularized SVM problem in the streaming model. This is a classic supervised learning problem that has drawn lots of attention, including for developing fast algorithms for solving the problem approximately. One of the most widely used algorithms for approximately optimizing the SVM obje...More

Code:

Data:

Your rating :
0

 

Tags
Comments