REVIEW 2 cited by
FO-PINNs: A First-Order formulation for Physics Informed 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
FO-PINNs: A First-Order formulation for Physics Informed Neural Networks
read the original abstract
Physics-Informed Neural Networks (PINNs) are a class of deep learning neural networks that learn the response of a physical system without any simulation data, and only by incorporating the governing partial differential equations (PDEs) in their loss function. While PINNs are successfully used for solving forward and inverse problems, their accuracy decreases significantly for parameterized systems. PINNs also have a soft implementation of boundary conditions resulting in boundary conditions not being exactly imposed everywhere on the boundary. With these challenges at hand, we present first-order physics-informed neural networks (FO-PINNs). These are PINNs that are trained using a first-order formulation of the PDE loss function. We show that, compared to standard PINNs, FO-PINNs offer significantly higher accuracy in solving parameterized systems, and reduce time-per-iteration by removing the extra backpropagations needed to compute the second or higher-order derivatives. Additionally, FO-PINNs can enable exact imposition of boundary conditions using approximate distance functions, which pose challenges when applied on high-order PDEs. Through three examples, we demonstrate the advantages of FO-PINNs over standard PINNs in terms of accuracy and training speedup.
Forward citations
Cited by 2 Pith papers
-
Physics-Informed Neural Networks for Discovering Periodic Orbits in the Gravitational Three-Body Problem
PINNs without initial conditions recover verifiable three-body periodic orbits from sparse noisy data, with training data—not init distribution—controlling which families emerge across seed ensembles.
-
Continuous Data Assimilation with Learned Surrogate Dynamics
Nudging with learned surrogate dynamics converges exponentially to an explicit error floor determined by surrogate error and observation noise, with training data requirements quantified for noise-free cases.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.