Pith. sign in

REVIEW 3 cited by

First Order System Least Squares 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

arxiv 2409.20264 v1 pith:2CDKUQBL submitted 2024-09-30 math.NA cs.LGcs.NA

classification math.NAcs.LGcs.NA
keywords neuralnetworksresidualnumericalsystemadaptivedeepexact
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We introduce a conceptual framework for numerically solving linear elliptic, parabolic, and hyperbolic PDEs on bounded, polytopal domains in euclidean spaces by deep neural networks. The PDEs are recast as minimization of a least-squares (LSQ for short) residual of an equivalent, well-posed first-order system, over parametric families of deep neural networks. The associated LSQ residual is a) equal or proportional to a weak residual of the PDE, b) additive in terms of contributions from localized subnetworks, indicating locally ``out-of-equilibrium'' of neural networks with respect to the PDE residual, c) serves as numerical loss function for neural network training, and d) constitutes, even with incomplete training, a computable, (quasi-)optimal numerical error estimator in the context of adaptive LSQ finite element methods. In addition, an adaptive neural network growth strategy is proposed which, assuming exact numerical minimization of the LSQ loss functional, yields sequences of neural networks with realizations that converge rate-optimally to the exact solution of the first order system LSQ formulation.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Non-Asymptotic Variational Learning for Monotone Nonlinear Multiscale Elliptic Equations: Scale-Robust Primal-Dual Bounds and Strong-Form Statistical Ill-Conditioning

    math.NA 2026-07 conditional novelty 6.0 of 10

    Variational and primal-dual training of multiscale PDE networks have epsilon-uniform error bounds, while strong-residual training classes provably have Rademacher complexity at least 1/(ε√N) and 1/(ε²√N).

  2. Neural Very Weak Formulations enabling Hardware-Oriented deep PDE solvers

    math.NA 2026-07 conditional novelty 6.0 of 10

    A neural very-weak-formulation (NVWF) method solves elliptic PDEs with low-regularity and 1-bit quantized networks, avoiding automatic differentiation while reaching 0.2–6.7% relative L2 errors in the test problems.

  3. A deep first-order system least squares method for the obstacle problem

    math.NA 2025-08 conditional novelty 6.0 of 10

    A deep first-order least-squares neural method approximates solution, gradient, and multiplier of the obstacle problem, with Gamma-convergence guarantees and tests up to dimension 20.

Pith tools