Approximate Hard-Margin SVM

A (primal) hard-margin SVM is an optimization problem of the following form: minα1,,αn012i,j=1nαiαjyiyjk(xi,xj)\min\limits_{\alpha_1,\ldots,\alpha_n\geq 0} \frac{1}{2} \sum \limits_{i,j = 1}^n \alpha_i \alpha_j y_i y_j k(x_i, x_j) subject to yif(xi)1,i=1,,ny_i f(x_i) \geq 1, i = 1, \ldots, n where f(x):=i=1nαiyik(xi,x)f(x) := \sum_{i=1}^n \alpha_i y_i k(x_i, x)


Insufficient data to display graph

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Displaying 1 of 1 reductions

Other relevant algorithms

Insuffient Data to display table