REVIEW 6 cited by
DC3: A learning method for optimization with hard constraints
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
read the original abstract
Large optimization problems with hard constraints arise in many settings, yet classical solvers are often prohibitively slow, motivating the use of deep networks as cheap "approximate solvers." Unfortunately, naive deep learning approaches typically cannot enforce the hard constraints of such problems, leading to infeasible solutions. In this work, we present Deep Constraint Completion and Correction (DC3), an algorithm to address this challenge. Specifically, this method enforces feasibility via a differentiable procedure, which implicitly completes partial solutions to satisfy equality constraints and unrolls gradient-based corrections to satisfy inequality constraints. We demonstrate the effectiveness of DC3 in both synthetic optimization tasks and the real-world setting of AC optimal power flow, where hard constraints encode the physics of the electrical grid. In both cases, DC3 achieves near-optimal objective values while preserving feasibility.
Forward citations
Cited by 6 Pith papers
-
FMOPF: Latent Flow Matching with Constraint-Aware Interaction Priors for AC Optimal Power Flow
FMOPF uses latent flow matching plus a constraint-aware interaction prior to sample feasible near-optimal AC-OPF solutions, and reports the first generative-OPF scaling to 300 buses — but its feasibility claim is not ...
-
End-to-End Learning of Safe Optimal Feedback Control in High Dimensions with Control Barrier Function Layers
A scalable end-to-end training method for neural controllers with embedded control-barrier-function safety filters, demonstrated up to 1200 state dimensions and 400 control dimensions, with convergence guarantees unde...
-
Diffusion-based learning framework for Constrained Nonconvex Optimization with Weighted Bootstrapped Refinement
DiOpt combines a supervised warm-start with weighted bootstrapped self-training, achieving high feasibility and near-optimality on constrained nonconvex optimization benchmarks including AC optimal power flow and moti...
-
A Multi-stage Constrained Optimization Framework for Data-driven Problems
MCOF combines an entropy-constrained VAE, uniform latent transform, and constraint-priority filter to produce surrogate-feasible, diverse solutions for data-driven constrained optimization.
-
Case Studies of Generative Machine Learning Models for Dynamical Systems
Physics-informed VAEs with Hamiltonian-based losses generate trajectories that match training distributions and satisfy optimal-control equations from as few as 200 to 500 samples.
-
Physics-Informed Neural Networks with Hard Nonlinear Equality and Inequality Constraints
KKT-Hardnet enforces hard nonlinear equality and inequality constraints in neural network outputs via a differentiable KKT projection layer, reducing constraint violations to near machine precision.
Discussion (0). Continue with ORCID to comment.