Efficient max-margin Markov learning via conditional gradient and probabilistic inference

Posted in Science on July 23, 2008


Efficient max-margin Markov learning via conditional gradient and probabilistic inference

We present a general and efficient optimisation methodology for for max-margin sructured classification tasks. The efficiency of the method relies on the interplay of several techiques: marginalization of the dual of the structured SVM, or max-margin Markov problem; partial decomposition via a gradient formulation; and finally tight coupling of a max-likelihood inference algorithm into the optimization algorithm, as opposed to using inference as a working set maintenance mechanism only.

Author: Juho Rousu, University of Helsinki

Watch Video

Tags: Science, Lectures, Computer Science, Machine Learning, VideoLectures.Net, Markov Processes