Learning Structured Prediction Models: A Large Margin Approach (2005)by B. Taskar, V. Chatalbashev, D. Koller, and C. Guestrin
Abstract:
We consider large margin estimation in a broad range of prediction models where inference involves solving combinatorial optimization problems, for example, weighted graphcuts or matchings. Our goal is to learn parameters such that inference using the model reproduces correct answers on the training data. Our method relies on the expressive power of convex optimization problems to compactly capture inference or solution optimality in structured prediction models. Directly embedding this structure within the learning formulation produces concise convex problems for efficient estimation of very complex and diverse models. We describe experimental results on a matching task, disulfide connectivity prediction, showing significant improvements over stateoftheart methods.
Download Information
B. Taskar, V. Chatalbashev, D. Koller, and C. Guestrin (2005). "Learning Structured Prediction Models: A Large Margin Approach." TwentySecond International Conference on Machine Learning (ICML).


Bibtex citation
@inproceedings{Taskar+al:ICML05,
title = {Learning Structured Prediction Models: {A} Large Margin Approach},
author = {B. Taskar and V. Chatalbashev and D. Koller and C. Guestrin},
booktitle = {TwentySecond International Conference on Machine Learning (ICML)},
year = 2005,
address = {Bonn, Germany},
}
full list
