•For one set of classes, aTy > 0. For
other set: aTy < 0.
•Notationally convenient if, for second class, make y negative.
•Then, finding a linear separator means finding a such that, for all i,
•aTy > 0.
•Note, this is a linear program.
–Problem convex, so descent algorithms converge to global optimum.