Name
Abstract | ||
|---|---|---|
Structured prediction is used in areas including computer vision and natural language processing to predict structured outputs such as segmentations or parse trees. In these settings, prediction is performed by MAP inference or, equivalently, by solving an integer linear program. Because of the complex scoring functions required to obtain accurate predictions, both learning and inference typically require the use of approximate solvers. We propose a theoretical explanation for the striking observation that approximations based on linear programming (LP) relaxations are often tight (exact) on real-world instances. In particular, we show that learning with LP relaxed inference encourages integrality of training instances, and that this training tightness generalizes to test data.
|
Year | DOI | Venue |
|---|---|---|
2019 | 10.17863/CAM.242 | ICML |
DocType | Volume | Issue |
Journal | 20 | 1 |
ISSN | Citations | PageRank |
1532-4435 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ofer Meshi | 1 | 154 | 12.94 |
| Mehrdad Mahdavi | 2 | 1213 | 65.15 |
| Adrian Weller | 3 | 141 | 27.59 |
| David Sontag | 4 | 1784 | 88.59 |