pith. machine review for the scientific record. sign in

arxiv: 1607.07819 · v3 · submitted 2016-07-26 · 📊 stat.ML · math.ST· stat.TH

Recognition: unknown

Approximation by Combinations of ReLU and Squared ReLU Ridge Functions with ell¹ and ell⁰ Controls

Authors on Pith no claims yet
classification 📊 stat.ML math.STstat.TH
keywords relufunctionsridgecombinationserrorsparsitysquaredapproximated
0
0 comments X
read the original abstract

We establish $ L^{\infty} $ and $ L^2 $ error bounds for functions of many variables that are approximated by linear combinations of ReLU (rectified linear unit) and squared ReLU ridge functions with $ \ell^1 $ and $ \ell^0 $ controls on their inner and outer parameters. With the squared ReLU ridge function, we show that the $ L^2 $ approximation error is inversely proportional to the inner layer $ \ell^0 $ sparsity and it need only be sublinear in the outer layer $ \ell^0 $ sparsity. Our constructions are obtained using a variant of the Jones-Barron probabilistic method, which can be interpreted as either stratified sampling with proportionate allocation or two-stage cluster sampling. We also provide companion error lower bounds that reveal near optimality of our constructions. Despite the sparsity assumptions, we showcase the richness and flexibility of these ridge combinations by defining a large family of functions, in terms of certain spectral conditions, that are particularly well approximated by them.

This paper has not been read by Pith yet.

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. Adaptive Randomized Neural Networks with Locally Activation Function: Theory and Algorithm for Solving PDEs

    math.NA 2026-04 unverdicted novelty 6.0

    Randomized neural networks require a sampling domain sized to target smoothness for optimal approximation, and an adaptive PIRaNN method with partition-of-unity refinement solves PDEs with limited local regularity.