An SMO algorithm for the potential support vector machine.
We describe a fast sequential minimal optimization (SMO) procedure for solving the dual optimization problem of the recently proposed potential support vector machine (P-SVM). The new SMO consists of a sequence of iteration steps in which the Lagrangian is optimized with respect to either one (single SMO) or two (dual SMO) of the Lagrange multipliers while keeping the other variables fixed. An efficient selection procedure for Lagrange multipliers is given, and two heuristics for improving the SMO procedure are described: block optimization and annealing of the regularization parameter epsilon. A comparison of the variants shows that the dual SMO, including block optimization and annealing, performs efficiently in terms of computation time. In contrast to standard support vector machines (SVMs), the P-SVM is applicable to arbitrary dyadic data sets, but benchmarks are provided against libSVM's epsilon-SVR and C-SVC implementations for problems that are also solvable by standard SVM methods. For those problems, computation time of the P-SVM is comparable to or somewhat higher than the standard SVM. The number of support vectors found by the P-SVM is usually much smaller for the same generalization performance.
Knebel
Tilman
T
Neural Information Processing Group, Fakultät IV, Technische Universität Berlin, 10587 Berlin, Germany. tk@cs.tu-berlin.de
Hochreiter
Sepp
S
Obermayer
Klaus
K
D000465:Algorithms; D001185:Artificial Intelligence; D003198:Computer Simulation; D016571:Neural Networks, Computer; D013997:Time Factors