Hi.

In the second programming assignment, we are asked to compute the margin obtained for each d.

However, we are using nonlinear SVM.

Doesn't this mean that we are using a polynomial kernel and therefore never finds w for the decision rule?

As I see it, one can calculate the margin easily only if he knows "b" and "w" in the SVM decision rule.

But we know them only for linear SVM…

How are we suppose to obtain the margin from libsvm?

The only thing we thought about is looking at the support vectors and finding 2 which are on the margin and from different classes and calculating the distance between them.

Is there something simpler we should do?

Thanks.