Spectral complexity of deep neural networks
From MaRDI portal
Cites work
- A Quantitative Functional Central Limit Theorem for Shallow Neural Networks
- A representer theorem for deep kernel learning
- Approximation by superpositions of a sigmoidal function
- Bayesian learning for neural networks
- Deep vs. shallow networks: an approximation theory perspective
- Gaussian random field approximation via Stein's method with applications to wide random neural networks
- scientific article; zbMATH DE number 3477793 (Why is no real title available?)
- scientific article; zbMATH DE number 1405266 (Why is no real title available?)
- scientific article; zbMATH DE number 7064043 (Why is no real title available?)
- Isotropic Gaussian random fields on the sphere: regularity, fast simulation and stochastic partial differential equations
- Level Sets and Extrema of Random Processes and Fields
- Measuring Complexity of Learning Schemes Using Hessian-Schatten Total Variation
- Nonlinear approximation and (deep) ReLU networks
- Nonparametric regression using deep neural networks with ReLU activation function
- On the number of regions of piecewise linear neural networks
- Positive definite functions on spheres
- Quantitative CLTs in deep neural networks
- Random Fields and Geometry
- Random fields on the sphere. Representation, limit theorems and cosmological applications
- Random neural networks in the infinite width limit as Gaussian processes
- Spherical harmonics and approximations on the unit sphere. An introduction
- Theory of Reproducing Kernels
This page was built for publication: Spectral complexity of deep neural networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6938078)
