Learning efficiently with approximate inference via dual losses
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation. Previous approaches for learning for structured prediction (e.g., cutting- plane, subgradient methods, perceptron) repe...
| Main Authors: | , , , |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
International Machine Learning Society,
2011-05-19T21:39:04Z.
|
| Subjects: | |
| Online Access: | Get fulltext |