Material Detail

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

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

This video was recorded at Open House on Multi-Task and Complex Outputs Learning, London 2006. 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.

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Browse...

Disciplines with similar materials as Efficient max-margin Markov learning via conditional gradient and probabilistic inference

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.