Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

ICML
2008
IEEE

favoriteEmaildiscussreport

114views Machine Learning» more ICML 2008»

SVM optimization: inverse dependence on training set size

14 years 5 months ago

SVM optimization: inverse dependence on training set size

Download ttic.uchicago.edu

We discuss how the runtime of SVM optimization should decrease as the size of the training data increases. We present theoretical and empirical results demonstrating how a simple subgradient descent approach indeed displays such behavior, at least for linear kernels.

Shai Shalev-Shwartz, Nathan Srebro

Real-time Traffic

ICML 2008 | Machine Learning | Subgradient Descent Approach | Training Data Increases |

claim paper

Related Content

» Support vector machine classification for large data sets via minimum enclosing ball clust...

» Select the Size of Training Set for Financial Forecasting with Neural Networks

» Preextracting method for SVM classification based on the nonparametric KNN rule

» Pegasos Primal Estimated subGrAdient SOlver for SVM

» ConsensusBased Distributed Support Vector Machines

» Less is More Active Learning with Support Vector Machines

» Online Kernel SVM for realtime fMRI brain state prediction

» Classifying large data sets using SVMs with hierarchical clusters

» Consensusbased distributed linear support vector machines

Post Info
More Details (n/a)

Added	17 Nov 2009
Updated	17 Nov 2009
Type	Conference
Year	2008
Where	ICML
Authors	Shai Shalev-Shwartz, Nathan Srebro

Comments (0)