Pith. sign in

REVIEW 1 cited by

Nonlocal techniques for the analysis of deep ReLU neural network approximations

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.04847 v1 pith:R3YH4Z5F submitted 2025-04-07 cs.LG cs.CCcs.NAmath.NA

classification cs.LGcs.CCcs.NAmath.NA
keywords functionsneuralapproximationsbarronbasisclassesdeepfunction
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Recently, Daubechies, DeVore, Foucart, Hanin, and Petrova introduced a system of piece-wise linear functions, which can be easily reproduced by artificial neural networks with the ReLU activation function and which form a Riesz basis of $L_2([0,1])$. This work was generalized by two of the authors to the multivariate setting. We show that this system serves as a Riesz basis also for Sobolev spaces $W^s([0,1]^d)$ and Barron classes ${\mathbb B}^s([0,1]^d)$ with smoothness $0<s<1$. We apply this fact to re-prove some recent results on the approximation of functions from these classes by deep neural networks. Our proof method avoids using local approximations and allows us to track also the implicit constants as well as to show that we can avoid the curse of dimension. Moreover, we also study how well one can approximate Sobolev and Barron functions by ANNs if only function values are known.

Discussion (0). Sign in 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. Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data

    stat.ML 2025-08 reject novelty 6.0 of 10

    An explicit randomized training pipeline is claimed to yield uniform approximators from noisy data with minimax-optimal trainable parameters, but key sample-complexity claims are algebraically reversed and the proof s...

Pith tools