LaRank, SGD-QN - Fast Optimizers for Linear SVM
Published on Sep 01, 20086419 Views
Originally proposed for solving multiclass SVM, the LaRank algorithm is a dual coordinate ascent algorithm relying on a randomized exploration inspired by the perceptron algorithm [Bordes05, Bordes07]