Sampling complexity of deep approximation spaces
DOI10.1142/S0219530524500234MaRDI QIDQ6649919
Philipp Grohs, Ahmed Abdeljawad
Publication date: 6 December 2024
Published in: Analysis and Applications (Singapore) (Search for Journal in Brave)
neural networksapproximation spacessampling complexityrandomized approximationinformation based complexity
Artificial neural networks and deep learning (68T07) Sampling theory, sample surveys (62D05) Learning and adaptive systems in artificial intelligence (68T05) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Rate of convergence, degree of approximation (41A25) Complexity and performance of numerical algorithms (65Y20) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multilayer feedforward networks are universal approximators
- On the rate of convergence of fully connected deep neural network regression estimates
- Approximation spaces of deep neural networks
- High-order approximation rates for shallow neural networks with cosine and \(\mathrm{ReLU}^k\) activation functions
- Optimal approximation of piecewise smooth functions using deep ReLU neural networks
- Nonparametric regression using deep neural networks with ReLU activation function
- Error bounds for approximations with deep ReLU networks
- Solving high-dimensional partial differential equations using deep learning
- Optimal Approximation with Sparsely Connected Deep Neural Networks
- Analysis of the Generalization Error: Empirical Risk Minimization over Deep Artificial Neural Networks Overcomes the Curse of Dimensionality in the Numerical Approximation of Black--Scholes Partial Differential Equations
- Approximations with deep neural networks in Sobolev time-space
- Deep ReLU networks and high-order finite element methods
- Deep neural networks for rotation-invariance approximation and learning
- Approximation by superpositions of a sigmoidal function
This page was built for publication: Sampling complexity of deep approximation spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6649919)
