Pith. sign in

REVIEW 3 cited by

Optimal Approximation of Zonoids and Uniform Approximation by Shallow Neural Networks

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 2307.15285 v3 pith:75QT7FKQ submitted 2023-07-28 stat.ML cs.LGcs.NAmath.NA

classification stat.MLcs.LGcs.NAmath.NA
keywords approximationuniformdeterminefirstnetworksneuraloptimalproblems
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

We study the following two related problems. The first is to determine to what error an arbitrary zonoid in $\mathbb{R}^{d+1}$ can be approximated in the Hausdorff distance by a sum of $n$ line segments. The second is to determine optimal approximation rates in the uniform norm for shallow ReLU$^k$ neural networks on their variation spaces. The first of these problems has been solved for $d\neq 2,3$, but when $d=2,3$ a logarithmic gap between the best upper and lower bounds remains. We close this gap, which completes the solution in all dimensions. For the second problem, our techniques significantly improve upon existing approximation rates when $k\geq 1$, and enable uniform approximation of both the target function and its derivatives.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Barron regularity of many particle Schr\"odinger eigenfunctions

    math.AP 2025-08 accept novelty 7.0 of 10

    Many-particle Schrödinger eigenfunctions with singular potentials are shown to lie in spectral Barron spaces up to a sharp smoothness index, giving the missing regularity theory for neural-network quantum solvers.

  2. Sharp uniform approximation for spectral Barron functions by deep neural networks

    math.NA 2025-07 conditional novelty 6.0 of 10

    ReLU networks approximate spectral Barron functions of smoothness as low as 1/2 at the N^{-1/2} rate, and L-layer networks achieve sharp N^{-sL} rates for 0<sL<=1/2.

  3. Do Neural Networks Really Beat the Curse of Dimensionality? A Bit-Complexity View

    cs.LG 2026-08 conditional novelty 5.0 of 10

    When approximation quality is measured per bit instead of per parameter, neural networks do not fundamentally beat classical methods; the real limit is the metric entropy of the target function class.

Pith tools