Sample complexity for function learning tasks through linear neural networks
From MaRDI portal
Recommendations
Cited in
(18)- Using virtual sample generation to build up management knowledge in the early manufacturing stages
- Approximation by neural networks and learning theory
- Learning the mapping \(\mathbf{x}\mapsto \sum\limits_{i=1}^d x_i^2\): the cost of finding the needle in a haystack
- The sample complexity of learning linear predictors with the squared loss
- A note on a priori estimations of classification circuit complexity
- A study of the classification of low-dimensional data with supervised manifold learning
- 10.1162/153244302760200713
- Learning lipschitz functions
- Sample complexity for learning recurrent perceptron mappings
- scientific article; zbMATH DE number 1445318 (Why is no real title available?)
- Size-independent sample complexity of neural networks
- Estimates of Data Complexity in Neural-Network Learning
- An improved bound for learning Lipschitz functions
- Learning C^2 and Hölder functions
- Gaining degrees of freedom in subsymbolic learning
- Improved bounds on the sample complexity of learning
- On size-independent sample complexity of ReLU networks
- Sample complexity bounds for the local convergence of least squares approximation
This page was built for publication: Sample complexity for function learning tasks through linear neural networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4738577)
