A better approximation for balls

DOI10.1006/JATH.1999.3441MaRDI QIDQ1577916zbMATH OpenOpenAlexFDO

Authors Gerald H. L. Cheang, Andrew R. Barron

Publication date 27 August 2000

Published in Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/8225adfd1e8595d0788681fdc0c3d1652444c2a5

Mathematics Subject Classification ID

Approximation by other special function classes (41A30)

Recommendations

• Approximation with neural networks activated by ramp sigmoids
• Approximation by spherical neural networks with sigmoidal functions
• scientific article; zbMATH DE number 1083116
• Essential rate for approximation by spherical neural networks

Cites work

• scientific article; zbMATH DE number 3744021 (Why is no real title available?)
• scientific article; zbMATH DE number 51427 (Why is no real title available?)
• scientific article; zbMATH DE number 51537 (Why is no real title available?)
• scientific article; zbMATH DE number 3231758 (Why is no real title available?)
• scientific article; zbMATH DE number 3083197 (Why is no real title available?)
• A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
• Approximation by superpositions of a sigmoidal function
• Approximation of Convex Bodies by Polytopes
• Approximation of convex bodies by polytopes
• Convergence of stochastic processes
• Decision theoretic generalizations of the PAC model for neural net and other learning applications
• Metric entropy of some classes of sets with differentiable boundaries
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Sup-norm approximation bounds for networks through probabilistic methods
• Universal approximation bounds for superpositions of a sigmoidal function

Cited in

(14)

• Weak stability of \(\ell_1\)-minimization methods in sparse data reconstruction
• Approximating the covariance ellipsoid
• Best approximation by linear combinations of characteristic functions of half-spaces.
• Hankel kernels of higher weight for the ball
• Improved results on estimating and extending the radius of an attraction ball
• Using Rademacher permutations to reduce randomness
• Approximation of convex sets by polytopes
• Approximation with neural networks activated by ramp sigmoids
• Approximative compactness of linear combinations of characteristic functions
• Financial market structures revealed by pricing rules: efficient complete markets are prevalent
• Precise smoothing effect in the exterior of balls
• Minimization of Error Functionals over Perceptron Networks
• Logarithmic reduction of the level of randomness in some probabilistic geometric constructions
• A Sobolev-type upper bound for rates of approximation by linear combinations of Heaviside plane waves

This page was built for publication: A better approximation for balls

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1577916)