Only Project Once: Projection-Adaptive Loss for Exact Constraint Satisfaction
Not on the map. Why?
Abstract (arXiv)
Precise constraint satisfaction is a prerequisite to deploying learned models in many areas, motivating methods that repair raw neural predictions with a repair procedure. Current methods unroll multiple repair steps in training and softly penalize constraint violations that remain after the unroll. This is compute- and memory-intensive, lacks robustness when the repair fails to converge, and surrenders most of the constraint satisfaction work to the repair. Our central finding is that, contrary to common practice, a single detached projection step suffices in training. We accomplish this with a Projection-Adaptive Loss (PAL), which uses the constraint residual after this single step to adaptively weigh constraint penalties on the raw prediction. In experiments, PAL is the only method that retains virtually perfect feasibility on extremely nonlinear constraints, and matches or outperforms current methods on synthetic and engineering benchmarks. Because it only requires a single detached projection step, PAL trains 2.5x faster than the canonical repair-based method (DC3) on its own ACOPF benchmark. PAL can also be trained when constraints are expensive to evaluate (e.g., via neural surrogates), a setting where current unrolled methods are memory-intractable.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 18 of its 35 references that are in the map. First posted on arXiv 3 Oct 2026.
Builds on
18 of 35 references.
References · 18
- 2020Fourier Features Let Networks Learn High Frequency Functions in Low Dimensional Domainscited by 2,200
- 2017OptNet: Differentiable Optimization as a Layer in Neural Networkscited by 599
- 2024LTX-Video: Realtime Video Latent Diffusioncited by 581
- 2019Differentiable Convex Optimization Layerscited by 465
- 2021Safe Learning in Robotics: From Learning-Based Control to Safe Reinforcement Learningcited by 371
- 2021DC3: A learning method for optimization with hard constraintscited by 184
- 2017pandapower - an Open Source Python Tool for Convenient Modeling, Analysis and Optimization of Electric Power Systemscited by 85
- 2023ACE: A fast, skillful learned global atmospheric model for climate predictioncited by 56
- 2020DeepOPF: A Feasibility-Optimized Deep Neural Network Approach for AC Optimal Power Flow Problemscited by 47
- 2024HardNet: Hard-Constrained Neural Networks with Universal Approximation Guaranteescited by 31
- 2025FSNet: Feasibility-Seeking Neural Network for Constrained Optimization with Guaranteescited by 21
- 2025Pinet: Optimizing hard-constrained neural networks with orthogonal projection layerscited by 19
6 more
- 2025ENFORCE: Nonlinear Constrained Learning with Adaptive-depth Neural Projectioncited by 17
- 2023An adaptive augmented Lagrangian method for training physics and equality constrained artificial neural networkscited by 16
- 2021Modeling Design and Control Problems Involving Neural Network Surrogatescited by 9
- 2024FloorSet -- a VLSI Floorplanning Dataset with Design Constraints of Real-World SoCscited by 3
- 2026SnareNet: Flexible Repair Layers for Neural Networks with Hard Constraintscited by 2
- 2026Pretrained Video Models as Differentiable Physics Simulators for Urban Wind Flowscited by 2
Built on by
Not cited yet.