TR on Efficient Incremental SVM Computations

[S. Sathiya Keerthi]

A Useful Bound for Incremental Computations in SVM Algorithms 

S.S. Keerthi and C.J. Ong 
National University of Singapore

Abstract:

A simple bound is given that is useful for checking the optimality 
of points whose lagrange multipliers take bound values. This bound 
is very inexpensive to compute and is useful in various scenarios. 

To download a gzipped postscript file containing the report, go to:
http://guppy.mpe.nus.edu.sg/~mpessk/svm.shtml