Pith. sign in

REVIEW 1 cited by

Multi-level Neural Networks for high-dimensional parametric obstacle problems

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 2504.05026 v1 pith:R5ASMXDY submitted 2025-04-07 cs.LG cs.NAmath.FAmath.NA

Multi-level Neural Networks for high-dimensional parametric obstacle problems

classification cs.LG cs.NAmath.FAmath.NA
keywords obstaclealgorithmproblemchallengingdataequationhigh-dimensionalmulti-level
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

A new method to solve computationally challenging (random) parametric obstacle problems is developed and analyzed, where the parameters can influence the related partial differential equation (PDE) and determine the position and surface structure of the obstacle. As governing equation, a stationary elliptic diffusion problem is assumed. The high-dimensional solution of the obstacle problem is approximated by a specifically constructed convolutional neural network (CNN). This novel algorithm is inspired by a finite element constrained multigrid algorithm to represent the parameter to solution map. This has two benefits: First, it allows for efficient practical computations since multi-level data is used as an explicit output of the NN thanks to an appropriate data preprocessing. This improves the efficacy of the training process and subsequently leads to small errors in the natural energy norm. Second, the comparison of the CNN to a multigrid algorithm provides means to carry out a complete a priori convergence and complexity analysis of the proposed NN architecture. Numerical experiments illustrate a state-of-the-art performance for this challenging problem.

discussion (0)

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

Forward citations

Cited by 1 Pith paper

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

  1. Fourier Neural Operators with Least-Squares Readout Refit for Learning Random Obstacle-to-Solution Maps

    math.NA 2026-06 unverdicted novelty 6.0

    FNO with post-training least-squares readout refit outperforms vanilla FNO, DeepONet variants on random obstacle-to-solution maps from variational inequalities, especially for complex contact geometry.