Solving multiclass support vector machines with LaRank

Optimization algorithms for large margin multiclass recognizers are often too costly to handle ambitious problems with structured outputs and exponential numbers of classes. Optimization algorithms that rely on the full gradient are not effective because, unlike the solution, the gradient is not sparse and is very large. The LaRank algorithm sidesteps this difficulty by relying on a randomized exploration inspired by the perceptron algorithm. We show that this approach is competitive with gradient based optimizers on simple multiclass problems. Furthermore, a single LaRank pass over the training examples delivers test error rates that are nearly as good as those of the final solution.

• Type: Conference
• Year: 2007
• Where: ICML
• Authors: Antoine Bordes, Jason Weston, Léon Bottou, Patrick Gallinari
• Keywords: Gradient Based Optimizers, ICML 2007, Machine Learning, Margin Multiclass Recognizers, Simple Multiclass Problems