Pith. sign in

REVIEW 2 cited by

Sobolev Training 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

arxiv 2101.08932 v2 pith:TXIKAAOI submitted 2021-01-22 math.NA cs.NA

classification math.NAcs.NA
keywords lossfunctionneuraltrainingsobolevconvergencecorrespondingnetwork
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Physics Informed Neural Networks (PINNs) is a promising application of deep learning. The smooth architecture of a fully connected neural network is appropriate for finding the solutions of PDEs; the corresponding loss function can also be intuitively designed and guarantees the convergence for various kinds of PDEs. However, the rate of convergence has been considered as a weakness of this approach. This paper proposes Sobolev-PINNs, a novel loss function for the training of PINNs, making the training substantially efficient. Inspired by the recent studies that incorporate derivative information for the training of neural networks, we develop a loss function that guides a neural network to reduce the error in the corresponding Sobolev space. Surprisingly, a simple modification of the loss function can make the training process similar to \textit{Sobolev Training} although PINNs is not a fully supervised learning task. We provide several theoretical justifications that the proposed loss functions upper bound the error in the corresponding Sobolev spaces for the viscous Burgers equation and the kinetic Fokker--Planck equation. We also present several simulation results, which show that compared with the traditional $L^2$ loss function, the proposed loss function guides the neural network to a significantly faster convergence. Moreover, we provide the empirical evidence that shows that the proposed loss function, together with the iterative sampling techniques, performs better in solving high dimensional PDEs.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Neural Shortest Path for Surface Reconstruction from Point Clouds

    cs.LG 2025-02 conditional novelty 6.0 of 10

    A vector-valued neural field that learns the exact shortest path to a surface reconstructs open 3D shapes from point clouds while recovering distance and gradient jointly.

  2. Introduction to optimization methods for training SciML models

    math.NA 2026-01 unverdicted

    A tutorial review of optimization for SciML that explains PDE-induced stiffness through the NTK/Hessian spectrum and surveys adaptive sampling, second-order, and preconditioning methods.

Pith tools