Some comparisons between linear approximation and approximation by neural networks
From MaRDI portal
Recommendations
- Some comparisons of complexity in dictionary-based and linear computational models
- Comparison of worst case errors in linear and neural network approximation
- Geometric Rates of Approximation by Neural Networks
- scientific article; zbMATH DE number 1545336
- Dimension-independent rates of approximation by neural networks
Cited in
(11)- When is approximation by Gaussian networks necessarily a linear process?
- Nonparametric nonlinear regression using polynomial and neural approximators: a numerical comparison
- Neural networks, linear functions and neglected nonlinearity
- scientific article; zbMATH DE number 2073951 (Why is no real title available?)
- Comparison of worst case errors in linear and neural network approximation
- Can dictionary-based computational models outperform the best linear ones?
- Bounds on the complexity of neural‐network models and comparison with linear methods
- Comparison of four gradient-learning algorithms for neural network Wiener models
- On some similarities and differences between deep neural networks and kernel learning machines
- Some comparisons of complexity in dictionary-based and linear computational models
- On sharpness of error bounds for univariate approximation by single hidden layer feedforward neural networks
This page was built for publication: Some comparisons between linear approximation and approximation by neural networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943029)
