Pith. sign in

REVIEW 1 cited by

Deep Ritz revisited

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 1912.03937 v2 pith:245IDMAY submitted 2019-12-09 math.NA cs.LGcs.NAcs.NEmath.AP

classification math.NAcs.LGcs.NAcs.NEmath.AP
keywords networksneuraldirichletpdespoissonproblemregularisedsome
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Recently, progress has been made in the application of neural networks to the numerical analysis of partial differential equations (PDEs). In the latter the variational formulation of the Poisson problem is used in order to obtain an objective function - a regularised Dirichlet energy - that was used for the optimisation of some neural networks. In this notes we use the notion of $\Gamma$-convergence to show that ReLU networks of growing architecture that are trained with respect to suitably regularised Dirichlet energies converge to the true solution of the Poisson problem. We discuss how this approach generalises to arbitrary variational problems under certain universality assumptions of neural networks and see that this covers some nonlinear stationary PDEs like the $p$-Laplace.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. PINN-DG: Residual neural network methods trained with Finite Elements

    math.NA 2025-07 conditional novelty 5.0 of 10

    PINN-DG replaces pointwise derivative losses with finite element interpolation plus discontinuous Galerkin consistency and penalty terms, and proves convergence of the discrete minimizers.

Pith tools