SnareNet: Flexible Repair Layers for Neural Networks with Hard Constraints
Not on the map. Why?
Abstract (arXiv)
Neural networks are increasingly used as fast surrogate models across various domains, but unconstrained predictions can violate physical, operational, or safety requirements. We propose SnareNet, a feasibility-controlled architecture to learn mappings whose outputs must satisfy input-dependent constraints. SnareNet appends a differentiable repair layer that navigates in the constraint map's range space, steering iterates toward feasibility and producing a repaired output that satisfies constraints to a user-specified tolerance. We stabilize end-to-end training by adaptive relaxation, a new training paradigm that snares the neural network at initialization and shrinks it into the feasible set, enabling early exploration and strict feasibility later in training. On optimization learning and trajectory planning benchmarks, SnareNet consistently attains improved objective quality while satisfying constraints more reliably than prior work, and it is the first to enforce non-convex constraints at medium-to-high precision robustly across instances.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 31 of its 47 references that are in the map. First posted on arXiv 10 Feb 2026.
Builds on
31 of 47 references.
References · 31
- 2017MoleculeNet: A Benchmark for Molecular Machine Learningcited by 1,037
- 2015End-to-End Training of Deep Visuomotor Policiescited by 847
- 2016Automatic chemical design using a data-driven continuous representation of moleculescited by 762
- 2017OptNet: Differentiable Optimization as a Layer in Neural Networkscited by 588
- 2021Physics-Informed Neural Operator for Learning Partial Differential Equationscited by 516
- 2021Machine learning accelerated computational fluid dynamicscited by 461
- 2019A Survey of Deep Learning Techniques for Autonomous Drivingcited by 401
- 2019Control Barrier Functions: Theory and Applicationscited by 332
- 2021Physics-informed neural networks with hard constraints for inverse designcited by 277
- 2017A Semantic Loss Function for Deep Learning with Symbolic Knowledgecited by 267
- 2016Control Barrier Function Based Quadratic Programs for Safety Critical Systemscited by 261
- 2021DC3: A learning method for optimization with hard constraintscited by 181
19 more
- 2024Challenges in Training PINNs: A Loss Landscape Perspectivecited by 109
- 2019Physics-informed Autoencoders for Lyapunov-stable Fluid Flow Predictioncited by 67
- 2018Constrained-CNN losses for weakly supervised segmentationcited by 62
- 2025FourCastNet 3: A geometric approach to probabilistic machine-learning weather forecasting at scalecited by 56
- 2019DeepOPF: A Deep Neural Network Approach for Security-Constrained DC Optimal Power Flowcited by 50
- 2017Imposing Hard Constraints on Deep Networks: Promises and Limitationscited by 42
- 2019Constrained Deep Networks: Lagrangian Optimization via Log-Barrier Extensionscited by 30
- 2023RAYEN: Imposition of Hard Convex Constraints on Neural Networkscited by 30
- 2024Physics-Informed Neural Networks with Hard Linear Equality Constraintscited by 30
- 2024HardNet: Hard-Constrained Neural Networks with Universal Approximation Guaranteescited by 29
- 2022Learning to Solve Optimization Problems with Hard Linear Constraintscited by 23
- 2020Training neural networks under physical constraints using a stochastic augmented Lagrangian approachcited by 19
- 2025FSNet: Feasibility-Seeking Neural Network for Constrained Optimization with Guaranteescited by 19
- 2025Pinet: Optimizing hard-constrained neural networks with orthogonal projection layerscited by 17
- 2023Graph-based Time Series Clustering for End-to-End Hierarchical Forecastingcited by 16
- 2025Optimization Learningcited by 15
- 2025Physics-Informed Neural Networks with Hard Nonlinear Equality and Inequality Constraintscited by 14
- 2025Physically Valid Biomolecular Interaction Modeling with Gauss-Seidel Projectioncited by 3
- 2024A Collision Cone Approach for Control Barrier Functionscited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.