Structured Prediction using Linear Programming Relaxations
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Dr Daniel Roy.
Predicting structured objects such as parse trees or protein folds is
often formulated as combinatorial optimization, where the goal is to
find the most likely structure given the available evidence. Linear
programming relaxations are a powerful tool for solving these
optimization problems. Learning for structured prediction corresponds
to inverse combinatorial optimization, finding parameters for the
model such that for each of the data points, the optimal solution is
the desired structure. This talk will survey algorithms and theory
relating to learning for structured prediction using linear
programming relaxations, as applied to dependency parsing in natural
language processing, multi-label prediction, and protein side-chain
placement.
Based on joint work with Michael Collins, Amir Globerson, Tommi
Jaakkola, Terry Koo, Ofer Meshi, and Sasha Rush.
This talk is part of the Machine Learning @ CUED series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
|