A Penalty Approach for Differentiation Through Black-Box Quadratic Programming Solvers
Yuxuan Linghu, Zhiyuan Liu, Qi Deng

TL;DR
This paper introduces dXPP, a penalty-based differentiation framework for quadratic programs that improves computational efficiency and robustness by decoupling the solving and differentiation steps, enabling scalable and solver-agnostic differentiation.
Contribution
dXPP offers a novel penalty-based approach that bypasses KKT differentiation, allowing scalable, robust, and solver-agnostic differentiation through quadratic programs.
Findings
dXPP achieves substantial speedups on large-scale problems
It is competitive with KKT-based methods in accuracy
The approach improves robustness and efficiency in differentiating QPs
Abstract
Differentiating through the solution of a quadratic program (QP) is a central problem in differentiable optimization. Most existing approaches differentiate through the Karush--Kuhn--Tucker (KKT) system, but their computational cost and numerical robustness can degrade at scale. To address these limitations, we propose dXPP, a penalty-based differentiation framework that decouples QP solving from differentiation. In the solving step (forward pass), dXPP is solver-agnostic and can leverage any black-box QP solver. In the differentiation step (backward pass), we map the solution to a smooth approximate penalty problem and implicitly differentiate through it, requiring only the solution of a much smaller linear system in the primal variables. This approach bypasses the difficulties inherent in explicit KKT differentiation and significantly improves computational efficiency and robustness.…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRisk and Portfolio Optimization · Advanced Optimization Algorithms Research · Constraint Satisfaction and Optimization
