BPQP reformulates the backward pass of differentiable convex optimization layers as an equality-constrained quadratic program, allowing fast ADMM-based solvers to compute gradients.
Smart predict-and-optimize for hard combina- torial optimization problems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning
BPQP reformulates the backward pass of differentiable convex optimization layers as an equality-constrained quadratic program, allowing fast ADMM-based solvers to compute gradients.