Interior Point Solving for LP-based prediction+optimisation
Jayanta Mandi, Tias Guns

TL;DR
This paper introduces an interior point method-based approach for differentiating through LP solutions in predict-and-optimize tasks, showing competitive performance with existing methods like QPTL and SPO.
Contribution
It proposes using the logarithmic barrier within the homogeneous self-dual LP formulation for end-to-end learning, offering a more principled alternative to quadratic penalty methods.
Findings
Approach performs as well or better than state-of-the-art methods.
Utilizes interior point steps for gradient computation in predict-and-optimize.
Demonstrates effectiveness on empirical experiments.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsAdvanced Optimization Algorithms Research · Advanced Bandit Algorithms Research · Advanced Multi-Objective Optimization Algorithms
