Pith. sign in

REVIEW 1 cited by

Adaptive Neural Network Subspace Method for Solving Partial Differential Equations with High Accuracy

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 2412.02586 v1 pith:2UT3VDPQ submitted 2024-12-03 math.NA cs.NA

Adaptive Neural Network Subspace Method for Solving Partial Differential Equations with High Accuracy

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

Based on neural network and adaptive subspace approximation method, we propose a new machine learning method for solving partial differential equations. The neural network is adopted to build the basis of the finite dimensional subspace. Then the discrete solution is obtained by using the subspace approximation. Especially, based on the subspace approximation, a posteriori error estimator can be derivated by the hypercircle technique. This a posteriori error estimator can act as the loss function for adaptively refining the parameters of neural network.

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. Lower Bound on the Representation Complexity of Antisymmetric Tensor Product Functions

    math.NA 2025-01 unverdicted novelty 6.0

    Minimum number of terms for exact antisymmetry in a class of TPFs grows exponentially with dimension, shown via CP rank of antisymmetric tensors.