Pith. sign in

REVIEW 3 cited by

Nearly Optimal Approximation Rates for Deep Super ReLU Networks on Sobolev Spaces

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 2310.10766 v5 pith:4AWBJ5JC submitted 2023-10-16 math.NA cs.NA

Nearly Optimal Approximation Rates for Deep Super ReLU Networks on Sobolev Spaces

classification math.NA cs.NA
keywords reludnnsnetworkssobolevdeepdsrnsspacesderivatives
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
abstract

This paper introduces deep super ReLU networks (DSRNs) as a method for approximating functions in Sobolev spaces measured by Sobolev norms $W^{m,p}$ for $m\in\mathbb{N}$ with $m\ge 2$ and $1\le p\le +\infty$. Standard ReLU deep neural networks (ReLU DNNs) cannot achieve this goal. DSRNs consist primarily of ReLU DNNs, and several layers of the square of ReLU added at the end to smooth the networks output. This approach retains the advantages of ReLU DNNs, leading to the straightforward training. The paper also proves the optimality of DSRNs by estimating the VC-dimension of higher-order derivatives of DNNs, and obtains the generalization error in Sobolev spaces via an estimate of the pseudo-dimension of higher-order derivatives of DNNs.

discussion (0)

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

Forward citations

Cited by 3 Pith papers

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

  1. $\mathcal{C}^1$-approximation with rational functions and rational neural networks

    cs.LG 2025-08 conditional novelty 7.0

    C^1 approximation of Hölder functions by rational functions and rational neural networks is proven with rate N^{-(β-1)}, via a new rational approximation of ReQU.

  2. Generalization Guarantees for Multi-Input Neural Operator Learning in Sobolev Spaces

    cs.LG 2026-06 unverdicted novelty 6.0

    Derives explicit approximation and generalization rates for multi-input neural operators in Sobolev spaces that quantify each input's contribution to the error.

  3. Continuous Data Assimilation with Learned Surrogate Dynamics

    math.DS 2026-05 unverdicted novelty 6.0

    Nudging with learned surrogate dynamics converges exponentially to an explicit error floor determined by surrogate error and observation noise, with training data requirements quantified for noise-free cases.