DAE-HardNet: A Physics Constrained Neural Network Enforcing Differential-Algebraic Hard Constraints
Not on the map. Why?
Abstract (arXiv)
Traditional physics-informed neural networks (PINNs) do not always satisfy physics based constraints, especially when the constraints include differential operators. Rather, they minimize the constraint violations in a soft way. Strict satisfaction of differential-algebraic equations (DAEs) to embed domain knowledge and first-principles in data-driven models is generally challenging. This is because data-driven models consider the original functions to be black-box whose derivatives can only be obtained after evaluating the functions. We introduce DAE-HardNet, a physics-constrained (rather than simply physics-informed) neural network that learns both the functions and their derivatives simultaneously, while enforcing algebraic as well as differential constraints. This is done by projecting model predictions onto the constraint manifold using a differentiable projection layer. We apply DAE-HardNet to several systems and test problems governed by DAEs, including the dynamic Lotka-Volterra predator-prey system and transient heat conduction. We also show the ability of DAE-HardNet to estimate unknown parameters through a parameter estimation problem. Compared to multilayer perceptrons (MLPs) and PINNs, DAE-HardNet achieves orders of magnitude reduction in the physics loss while maintaining the prediction accuracy. It has the added benefits of learning the derivatives which improves the constrained learning of the backbone neural network prior to the projection layer. For specific problems, this suggests that the projection layer can be bypassed for faster inference. The current implementation and codes are available at https://github.com/SOULS-TAMU/DAE-HardNet.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 22 of its 47 references that are in the map. First posted on arXiv 5 Dec 2025.
Builds on
22 of 47 references.
References · 22
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2020Fourier Neural Operator for Parametric Partial Differential Equationscited by 2,908
- 2015Automatic differentiation in machine learning: a surveycited by 855
- 2021Characterizing possible failure modes in physics-informed neural networkscited by 643
- 2020When and why PINNs fail to train: A neural tangent kernel perspectivecited by 634
- 2017OptNet: Differentiable Optimization as a Layer in Neural Networkscited by 599
- 2021Physics-informed neural networks (PINNs) for fluid mechanics: A reviewcited by 473
- 2019Differentiable Convex Optimization Layerscited by 465
- 2021Factorized Fourier Neural Operatorscited by 249
- 2021DC3: A learning method for optimization with hard constraintscited by 184
- 2020Solving Allen-Cahn and Cahn-Hilliard Equations using the Adaptive Physics Informed Neural Networkscited by 123
10 more
- 2024Challenges in Training PINNs: A Loss Landscape Perspectivecited by 113
- 2024DeepOKAN: Deep Operator Network Based on Kolmogorov Arnold Networks for Mechanics Problemscited by 84
- 2024Kolmogorov Arnold Informed neural network: A physics-informed deep learning framework for solving forward and inverse problems based on Kolmogorov Arnold Networkscited by 67
- 2017Imposing Hard Constraints on Deep Networks: Promises and Limitationscited by 43
- 2024Physics-Informed Neural Networks with Hard Linear Equality Constraintscited by 30
- 2020Theory-guided hard constraint projection (HCP): a knowledge-based data-driven scientific machine learning methodcited by 29
- 2023AI-Aristotle: A Physics-Informed framework for Systems Biology Gray-Box Identificationcited by 29
- 2025ENFORCE: Nonlinear Constrained Learning with Adaptive-depth Neural Projectioncited by 17
- 2025Physics-Informed Neural Networks with Hard Nonlinear Equality and Inequality Constraintscited by 14
- 2025Physics-Constrained Machine Learning for Chemical Engineeringcited by 5
Built on by
Citing papers per year: 2026: 3.
3 papers.