This portal has been archived. Explore the next generation of this technology.

Train and Test Tightness of LP Relaxations in Structured Prediction

lib:ac734b9d89148bdb (v1.0.0)

Authors: Ofer Meshi,Mehrdad Mahdavi,Adrian Weller,David Sontag
ArXiv: 1511.01419
Document:  PDF  DOI 
Abstract URL: http://arxiv.org/abs/1511.01419v3


Structured prediction is used in areas such as 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 to the striking observation that approximations based on linear programming (LP) relaxations are often tight on real-world instances. In particular, we show that learning with LP relaxed inference encourages integrality of training instances, and that tightness generalizes from train to test data.

Relevant initiatives  

Related knowledge about this paper Reproduced results (crowd-benchmarking and competitions) Artifact and reproducibility checklists Common formats for research projects and shared artifacts Reproducibility initiatives

Comments  

Please log in to add your comments!
If you notice any inapropriate content that should not be here, please report us as soon as possible and we will try to remove it within 48 hours!