atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Train and Test Tightness of LP Relaxations in Structured Prediction

ICML 2016 · Learning theory and algorithms › Combinatorial and search optimization · approach: Predict-then-optimize learning · 2 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Train with LP relaxation instead of exact inferenceStructured prediction · Dependency parsing test dataintegral solutions (%): 83.47% -> 92.88%Helped
Train with LP relaxation instead of exact inferenceStructured prediction · Yeastintegral instances (%): 17.7% -> 99.57%Helped
Use random labels instead of ground-truth labels during LP-relaxed training (ablation)Multi-label classification · Multi-label classification with random labelstight training instances (%): 100%No clear effect
Train with exact inference instead of LP-relaxed inferenceStructured prediction · Noisy Scenetight instancesHurt
Use noisy singleton features, increasing reliance on pairwise interactions (ablation)Scene model · Noisy Scenetight instancesHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy