Sharp Bounds on the Approximation Rates, Metric Entropy, and n-Widths of Shallow Neural Networks

This publication has 39 references indexed in Scilit:

• Approximation and learning by greedy algorithms
  The Annals of Statistics, 2008
• Comparison of worst case errors in linear and neural network approximation
  IEEE Transactions on Information Theory, 2002
• Metric Entropy of Convex Hulls in Banach Spaces
  Journal of the London Mathematical Society, 1999
• Metric Entropy of Convex Hulls in Hilbert Spaces
  Bulletin of the London Mathematical Society, 1997
• Efficient agnostic learning of neural networks with bounded fan-in
  IEEE Transactions on Information Theory, 1996
• A Simple Lemma on Greedy Approximation in Hilbert Space and Convergence Rates for Projection Pursuit Regression and Neural Network Training
  The Annals of Statistics, 1992
• The entropy of convex bodies with ‘few’ extreme points
  1991
• Optimal nonlinear approximation
  manuscripta mathematica, 1989
• Gelfand numbers of operators with values in a Hilbert space
  Inventiones Mathematicae, 1988
• Inequalities of Bernstein-Jackson-type and the degree of compactness of operators in Banach spaces
  Annales de l'institut Fourier, 1985