Pith. sign in

REVIEW 1 cited by

Weighted Sobolev Approximation Rates for Neural Networks on Unbounded Domains

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 2411.04108 v1 pith:HIPDSPMN submitted 2024-11-06 cs.LG math.FAstat.ML

classification cs.LGmath.FAstat.ML
keywords networksresultssobolevspacesweightedapproximationdomainexisting
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this work, we consider the approximation capabilities of shallow neural networks in weighted Sobolev spaces for functions in the spectral Barron space. The existing literature already covers several cases, in which the spectral Barron space can be approximated well, i.e., without curse of dimensionality, by shallow networks and several different classes of activation function. The limitations of the existing results are mostly on the error measures that were considered, in which the results are restricted to Sobolev spaces over a bounded domain. We will here treat two cases that extend upon the existing results. Namely, we treat the case with bounded domain and Muckenhoupt weights and the case, where the domain is allowed to be unbounded and the weights are required to decay. We first present embedding results for the more general weighted Fourier-Lebesgue spaces in the weighted Sobolev spaces and then we establish asymptotic approximation rates for shallow neural networks that come without curse of dimensionality.

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