QPLayer: efficient differentiation of convex quadratic optimization - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2023

QPLayer: efficient differentiation of convex quadratic optimization


Optimization layers within neural network architectures have become increasingly popular for their ability to solve a wide range of machine learning tasks and to model domain-specific knowledge. However, designing optimization layers requires careful consideration as the underlying optimization problems might be infeasible during training. Motivated by applications in learning, control, and robotics, this work focuses on convex quadratic programming (QP) layers. The specific structure of this type of optimization layer can be efficiently exploited for faster computations while still allowing rich modeling capabilities. We leverage primal-dual augmented Lagrangian techniques for computing derivatives of both feasible and infeasible QPs. Not requiring feasibility allows, as a byproduct, for more flexibility in the QP to be learned. The effectiveness of our approach is demonstrated in a few standard learning experiments, obtaining three to ten times faster computations than alternative state-of-the-art methods while being more accurate and numerically robust. Along with these contributions, we provide an open-source C++ software package called QPLayer for efficiently differentiating convex QPs and which can be interfaced with modern learning frameworks.
Fichier principal
Vignette du fichier
QPLayer_Preprint.pdf (2.53 Mo) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04133055 , version 1 (19-06-2023)



  • HAL Id : hal-04133055 , version 1


Antoine Bambade, Fabian Schramm, Adrien Taylor, Justin Carpentier. QPLayer: efficient differentiation of convex quadratic optimization. 2023. ⟨hal-04133055⟩
598 View
901 Download


Gmail Mastodon Facebook X LinkedIn More