Papers › Interior Point Solving for LP-based prediction+optimisation

Interior Point Solving for LP-based prediction+optimisation

26 Oct 2020NeurIPS 2020 12arXiv:2010.13943archive 2025-07-28

Jayanta Mandi, Tias Guns

Solving optimization problems is the key to decision making in many real-life analytics applications. However, the coefficients of the optimization problems are often uncertain and dependent on external factors, such as future demand or energy or stock prices. Machine learning (ML) models, especially neural networks, are increasingly being used to estimate these coefficients in a data-driven way. Hence, end-to-end predict-and-optimize approaches, which consider how effective the predicted values are to solve the optimization problem, have received increasing attention. In case of integer linear programming problems, a popular approach to overcome their non-differentiabilty is to add a quadratic penalty term to the continuous relaxation, such that results from differentiating over quadratic programs can be used. Instead we investigate the use of the more principled logarithmic barrier term, as widely used in interior point solvers for linear programming. Specifically, instead of differentiating the KKT conditions, we consider the homogeneous self-dual formulation of the LP and we show the relation between the interior point step direction and corresponding gradients needed for learning. Finally our empirical experiments demonstrate our approach performs as good as if not better than the state-of-the-art QPTL (Quadratic Programming task loss) formulation of Wilder et al. and SPO approach of Elmachtoub and Grigas.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 26 code samples harvested from 1 repository linked to this paper: 12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 1 where Syntology's instrument failed) · 14 unverified. Where Syntology's instrument failed: 1 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 26 samples from 1 repository, 12 ran (11 with no instrument failure; 1 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-22 and 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

JayMan91/NeurIPSIntopt officialmentioned in paperpytorchMITSyntology: 26 samples, 12 ran (1 instrument-failed) · 14 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

26 samples harvested: 12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 1 where Syntology's instrument failed) · 14 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · our draft was wrong
11ran
14unverified

Licence: 1 of the 26 samples is pointer only, meaning Syntology does not serve that copy's text. For that sample, this paper's copy is under a permissive licence and cleared, but the stored copy of the same code that Syntology serves is not; the licence label's tooltip gives Syntology's recorded reason. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from JayMan91/NeurIPSIntopt. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.

JayMan91/NeurIPSIntopt official repository 26 samples, 12 ran (1 instrument-failed) · 14 unverified
bceloss shortespath/shortespath.py ran fingerprinted MIT (permissive) · 1a5b1471d8d531c6 · report fixture: signature inputs:ndarray/2/float, target:ndarray/2/float · returned float32 · level recorded 2026-09-25
bg_update_dense Interior/remove_redundancy.py ran MIT (permissive) · 47cf07ccf06eeb7e · report fixture: signature plu:tuple/1/ndarray, perm_r:ndarray/1/int, v:ndarray/1/float, j:int/0/int · returned tuple · level recorded 2026-09-25
bger Interior/qpthlocal/util.py ran · our draft was wrong fingerprinted MIT (permissive) here; the stored copy is pointer only · 612774f5e2ab3ddb · report fixture: signature x:Tensor/2/float, y:Tensor/2/float · returned Tensor · level recorded 2026-09-22
data_reading EnergyCost/ICON.py ran MIT (permissive) · ee1c6a3a00be8bc6 · report fixture: signature filename:str/0/str · returned dict · level recorded 2026-09-25
get_data in 223 papers sgd_learner.py ran fingerprinted MIT (permissive) · 2dd8ceebf2a365ec · report fixture: signature trch:Tensor/2/float, kn_nr:int/0/int, n_items:int/0/int · returned Tensor · level recorded 2026-09-25
get_kn_indicators sgd_learner.py ran MIT (permissive) · 1592e9edaea942e4 · report fixture: signature V_pred:ndarray/1/float, c:float/0/float, weights:ndarray/1/float, use_dp:bool/0/bool, relaxation:bool/0/bool, warmstart:NoneType/0/? · returned ndarray · level recorded 2026-09-25
get_sizes Interior/qpthlocal/util.py ran MIT (permissive) · d0357e296f7fb5bd · report fixture: signature G:Tensor/3/float, A:Tensor/2/float · returned tuple · level recorded 2026-09-25
make_matrix_intopt Interior/intopt_energy_mlp.py ran MIT (permissive) · 0247da76f1cc067c · report fixture: signature nbMachines:int/0/int, nbTasks:int/0/int, nbResources:int/0/int, MC:list/1/list, U:NoneType/0/?, D:list/1/int, E:list/1/int, L:list/1/int, P:list/1/float, idle:int/0/int, up:int/0/int, down:int/0/int, q:int/0/int · returned tuple · level recorded 2026-09-25
make_matrix_qp Interior/intopt_energy_mlp.py ran MIT (permissive) · d2b638cc9c3d61d1 · report fixture: signature nbMachines:int/0/int, nbTasks:int/0/int, nbResources:int/0/int, MC:list/1/list, U:list/1/float, D:list/1/int, E:list/1/int, L:list/1/int, P:list/1/float, idle:float/0/float, up:float/0/float, down:float/0/float, q:int/0/int · returned tuple · level recorded 2026-09-25
shortest_path sgd_learner.py ran MIT (permissive) · 95c25164471c4610 · report fixture: signature V_pred:ndarray/1/float, height:int/0/int, width:int/0/int · returned ndarray · level recorded 2026-09-25
solveKnapsackGreedily KnapsackSolving.py ran MIT (permissive) · ba3145cb5e3d8213 · report fixture: signature profits:list/1/int, weights:list/1/int, capacity:int/0/int · returned dict · level recorded 2026-09-25
to_np in 63 papers
census: 8 implementations from 14 papers, 2 distinct outputs across 2 buckets, one shared input per bucket
Interior/qpthlocal/util.py ran MIT (permissive) · b3e46dde438fad0b · report fixture: signature t:Tensor/2/float · returned ndarray · level recorded 2026-09-25
ICON_scheduling EnergyCost/ICON.py unverified MIT (permissive) · 2a98612374aa111c · report
ICON_scheduling_relaxation EnergyCost/ICON.py unverified MIT (permissive) · 61a4f21373e9ada4 · report
ICON_solution Interior/intopt_energy_mlp.py unverified MIT (permissive) · 7c9f8f4e9aa1a197 · report
IPOfunc Interior/ip_model_alter.py unverified MIT (permissive) · 28a6baddaa406aa9 · report
IPOfunc Interior/ip_model_whole.py unverified MIT (permissive) · 44ca414095aef85b · report
forward_gurobi_prebuilt Interior/qpthlocal/qp.py unverified MIT (permissive) · 6c1a6c7ee5b80feb · report
forward_single_np_gurobi Interior/qpthlocal/qp.py unverified MIT (permissive) · ecf413c2cedc33fa · report
get_energy in 6 papers get_energy.py unverified MIT (permissive) · 3ee7504e77ee94cb · report
get_energy_grouped get_energy.py unverified MIT (permissive) · 8234b742ce34e9d8 · report
get_energy_pandas get_energy.py unverified MIT (permissive) · 0d9b18d5fefc09ef · report
make_gurobi_model Interior/qpthlocal/qp.py unverified MIT (permissive) · 335370cd393b0855 · report
postsolve Interior/ip_model_alter.py unverified MIT (permissive) · d1bb4eef9d9eb2ba · report
solveKnapsackProblem KnapsackSolving.py unverified MIT (permissive) · 6788adf385135210 · report
solveKnapsackProblemRelaxation KnapsackSolving.py unverified MIT (permissive) · 964934cb816c76c8 · report

Tasks

Decision MakingPrediction

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections