scientific article; zbMATH DE number 1182753

zbMATH Open0905.41011MaRDI QIDQ4400833FDOQ4400833

Authors: Věra Kůrková 

Publication date: 11 January 1999

Title of this publication is not available (Why is that?)

Recommendations

• Dimension-independent bounds on the degree of approximation by neural networks
• Geometric Rates of Approximation by Neural Networks
• Rates of approximation by neural networks with four layers
• Bounds on rates of variable-basis and neural-network approximation

zbMATH Keywords

neural networksupper boundsmultivariable function approximation

Mathematics Subject Classification ID

Approximation by other special function classes (41A30)

Cited In (26)

• Approximation rates for neural networks with encodable weights in smoothness spaces
• Title not available (Why is that?)
• Geometric Rates of Approximation by Neural Networks
• Can dictionary-based computational models outperform the best linear ones?
• Some comparisons of complexity in dictionary-based and linear computational models
• On the rate of convergence in topology preserving neural networks
• Lower estimation of approximation rate for neural networks
• High-dimensional dynamics of generalization error in neural networks
• Unlocking Your Bike the Easy Way
• Bounds on rates of variable-basis and neural-network approximation
• Complexity of Gaussian-radial-basis networks approximating smooth functions
• Lower bounds for artificial neural network approximations: a proof that shallow neural networks fail to overcome the curse of dimensionality
• Title not available (Why is that?)
• Uniform approximation rates and metric entropy of shallow neural networks
• Approximation rates for neural networks with general activation functions
• Improved rates and asymptotic normality for nonparametric neural network estimators
• Dimension-independent bounds on the degree of approximation by neural networks
• Rates of approximation by neural networks with four layers
• Learning with generalization capability by kernel methods of bounded complexity
• Deep learning: a statistical viewpoint
• On convergence rate of projection neural networks
• Complexity estimates based on integral transforms induced by computational units
• Some implications of interval approach to dimension for network complexity
• Measure Theoretic Results for Approximation by Neural Networks with Limited Weights
• Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets
• A Sobolev-type upper bound for rates of approximation by linear combinations of Heaviside plane waves

This page was built for publication:

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