AI Paper Atlas

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

Learning Linear Programs from Optimal Decisions

Yingcong Tan, Daria Terekhov, Andrew Delong

NeurIPS 2020 · Learning theory and algorithms › Combinatorial and search optimization · approach: Predict-then-optimize learning · 11 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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
use gradient-based SQP outer solver (with LP differentiation) instead of gradient-free COBYLAparametric LP learning · Synthetic PLP (D=10, M1=80, K=6)fraction reaching zero AOE training loss: ~25\% -> 60-75\%Improved
use gradient-based SQP instead of random searchparametric LP learning · Synthetic PLP (D=10, M1=80, K=6)zero AOE training lossImproved
gradient-based SQP instead of gradient-free methods for full coefficient learning (890 parameters)parametric LP learning · Synthetic LP, all coefficients learnedzero AOE training lossImproved
gradient-based SQP instead of RS and COBYLAmin-cost multi-commodity flow learning · Nguyen-Dupuis graph, 100 instancestraining and testing lossImproved
backprop through interior point instead of implicit or direct gradients (ablation)SQP · Synthetic PLPtime to successHurt
implicit differentiation instead of backprop/direct (ablation)SQP · Synthetic PLP with higher Dsuccess rateImproved

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