REVIEW 13 cited by
OptNet: Differentiable Optimization as a Layer in Neural Networks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
OptNet: Differentiable Optimization as a Layer in Neural Networks
read the original abstract
This paper presents OptNet, a network architecture that integrates optimization problems (here, specifically in the form of quadratic programs) as individual layers in larger end-to-end trainable deep networks. These layers encode constraints and complex dependencies between the hidden states that traditional convolutional and fully-connected layers often cannot capture. We explore the foundations for such an architecture: we show how techniques from sensitivity analysis, bilevel optimization, and implicit differentiation can be used to exactly differentiate through these layers and with respect to layer parameters; we develop a highly efficient solver for these layers that exploits fast GPU-based batch solves within a primal-dual interior point method, and which provides backpropagation gradients with virtually no additional cost on top of the solve; and we highlight the application of these approaches in several problems. In one notable example, the method is learns to play mini-Sudoku (4x4) given just input and output games, with no a-priori information about the rules of the game; this highlights the ability of OptNet to learn hard constraints better than other neural architectures.
Forward citations
Cited by 13 Pith papers
-
The Statistical Cost of Adaptation in Multi-Source Transfer Learning
Multi-source transfer learning incurs an intrinsic adaptation cost that can exceed one, with phase transitions separating regimes where bias-agnostic estimators match oracle performance from those where they cannot.
-
Scaling Nonlinear Optimization: Many Problems One GPU
jaxipm is the first GPU-batched IPOPT solver in JAX using heterogeneous iteration fusion and iteration-level batching, delivering up to 32.85x higher throughput than standard IPOPT on quadrotor NMPC benchmarks.
-
Regularized Large Neighborhood Search
RLNS regularizes LNS to perform block Gibbs sampling under entropy, interpolating between pseudolikelihood and exact MLE for differentiable combinatorial optimization.
-
Causal Optimizer Interaction Calculus: Hidden Geometric Relaxation and Identifiable Interventions
Under fixed innovation coupling, finite-horizon optimizers admit minimal pathwise realizations and incidence-identifiable Möbius effects, with a five-term readout transfer from hidden relaxation and a closed reduced-v...
-
Restricted Dynamic Geometric Complexity: Path-Space Reduction and M\"obius--Jacobi Response
RDGC is the least affine-invariant length of an admissible metric path to a Hessian-relative condition target, with global Green and bordered Jacobi–KKT response laws on Hadamard path space.
-
CredibleDFGO: Differentiable Factor Graph Optimization with Credibility Supervision
CredibleDFGO adds explicit supervision of covariance credibility to differentiable factor graph optimization for GNSS by using proper scoring rules on the predictive distribution, yielding more trustworthy uncertainti...
-
A Distributionally Robust Reinforcement Learning Framework for Constrained Urban EV Dispatch
A robust semi-Markov RL agent with MILP feasibility projection and Wasserstein ambiguity set achieves $1.22M net profit on an NYC EV simulator with zero feeder violations, outperforming heuristic and other RL baselines.
-
Causal Optimizer Interaction Calculus: Hidden Geometric Relaxation and Identifiable Interventions
A modular calculus decomposes optimizer updates into geometric preconditioning plus structured nongeometric mechanisms, with a direction-expressivity theorem showing full SPD geometry captures exactly strict descent d...
-
Restricted Dynamic Geometric Complexity: Path-Space Reduction and M\"obius--Jacobi Response
Restricted dynamic geometric complexity measures the intrinsic affine-invariant path distance from an initial metric to a condition-number target when the metric family is structurally constrained, with exact LMI and ...
-
Accelerating and Scaling MPC-Guided Reinforcement Learning for Humanoid Locomotion and Manipulation
MPC-RL combines a centroidal-dynamics MPC reward with a batched GPU solver (π^n MPC) to accelerate RL training for humanoid locomotion and manipulation tasks.
-
CredibleDFGO: Differentiable Factor Graph Optimization with Credibility Supervision
CredibleDFGO extends DFGO by training a weighting network with NLL and energy score supervision so that the Hessian-derived covariances better match actual positioning errors on UrbanNav scenes.
-
A Distributionally Robust Reinforcement Learning Framework for Constrained Urban EV Dispatch
PD-RSAC, a distributionally robust SAC variant with GCN encoder and MILP constraint projection, reports $1.22M net profit on an NYC taxi-based EV simulator while achieving zero feeder violations, outperforming heurist...
-
Deep Learning for Sequential Decision Making under Uncertainty: Foundations, Frameworks, and Frontiers
A tutorial framing deep learning as a complement to optimization for sequential decision-making under uncertainty, with applications in supply chains, healthcare, and energy.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.