Pith. sign in

REVIEW 2 cited by

Partitioned neural network approximation for partial differential equations enhanced with Lagrange multipliers and localized loss functions

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 2312.14370 v1 pith:NEF7FVSH submitted 2023-12-22 math.NA cs.NAphysics.comp-ph

Partitioned neural network approximation for partial differential equations enhanced with Lagrange multipliers and localized loss functions

classification math.NA cs.NAphysics.comp-ph
keywords networkneurallossfunctionfunctionslocalizedpartitionedsolution
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Partitioned neural network functions are used to approximate the solution of partial differential equations. The problem domain is partitioned into non-overlapping subdomains and the partitioned neural network functions are defined on the given non-overlapping subdomains. Each neural network function then approximates the solution in each subdomain. To obtain the convergent neural network solution, certain continuity conditions on the partitioned neural network functions across the subdomain interface need to be included in the loss function, that is used to train the parameters in the neural network functions. In our work, by introducing suitable interface values, the loss function is reformulated into a sum of localized loss functions and each localized loss function is used to train the corresponding local neural network parameters. In addition, to accelerate the neural network solution convergence, the localized loss function is enriched with an augmented Lagrangian term, where the interface condition and the boundary condition are enforced as constraints on the local solutions by using Lagrange multipliers. The local neural network parameters and Lagrange multipliers are then found by optimizing the localized loss function. To take the advantage of the localized loss function for the parallel computation, an iterative algorithm is also proposed. For the proposed algorithms, their training performance and convergence are numerically studied for various test examples.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

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

  1. Domain-Decomposition Neural Surrogates for Scalable Decentralized Ensemble Kalman Filter Based Parameter Identification in High-Dimensional Stochastic PDEs

    cs.CE 2026-07 conditional novelty 5.5

    Domain-decomposed neural surrogates with augmented-Lagrange coupling, paired with a block-preconditioned decentralized EnKF, match FEM-EnKF and approach MCMC posteriors on 3D elastic parameter ID at reduced forecast cost.

  2. Domain decomposition of large neural network surrogate models

    cs.CE 2026-03 conditional novelty 4.0

    Augmented-Lagrange domain decomposition enforces interface continuity between local neural nets and is reported to converge faster than the plain Lagrange version on 2D/3D elasticity surrogates.