Approximation results for gradient flow trained neural networks
From MaRDI portal
Cites work
- A theoretical analysis of deep neural networks and parametric PDEs
- Approximation by Combinations of ReLU and Squared ReLU Ridge Functions With <inline-formula> <tex-math notation="LaTeX">$\ell^1$ </tex-math> </inline-formula> and <inline-formula>
- Approximation rates for neural networks with general activation functions
- Approximation spaces of deep neural networks
- Better approximations of high dimensional smooth functions by deep neural networks with rectified power units
- Breaking the curse of dimensionality with convex neural networks
- Characterization of Sobolev spaces on the sphere
- Constructive deep ReLU neural network approximation
- Deep Network Approximation for Smooth Functions
- Deep Neural Network Approximation Theory
- Deep ReLU networks and high-order finite element methods
- Efficient approximation of solutions of parametric linear transport equations by ReLU DNNs
- Error bounds for approximations with deep ReLU networks
- Error bounds for approximations with deep ReLU neural networks in \(W^{s , p}\) norms
- Expansions for the multivariate normal
- Gradient descent optimizes over-parameterized deep ReLU networks
- Greedy training algorithms for neural networks and applications to PDEs
- High-dimensional probability. An introduction with applications in data science
- High-order approximation rates for shallow neural networks with cosine and \(\mathrm{ReLU}^k\) activation functions
- scientific article; zbMATH DE number 1405266 (Why is no real title available?)
- Neural network approximation
- Nonlinear approximation and (deep) ReLU networks
- Nonlinear approximation via compositions
- On the universal consistency of an over-parametrized deep neural network estimate learned by gradient descent
- Optimal approximation of piecewise smooth functions using deep ReLU neural networks
- Optimal Convergence Rates for the Orthogonal Greedy Algorithm
- Proof of the theory-to-practice gap in deep learning via sampling complexity bounds for neural network approximation spaces
- Provable approximation properties for deep neural networks
- Tail bounds via generic chaining
- The Barron space and the flow-induced function spaces for neural network models
- The gap between theory and practice in function approximation with deep neural networks
- The Modern Mathematics of Deep Learning
- Towards a mathematical understanding of neural network-based machine learning: what we know and what we don't
- Wide neural networks of any depth evolve as linear models under gradient descent *
Cited in
(3)- Approximation and gradient descent training with neural networks
- Non-convergence to global minimizers for Adam and stochastic gradient descent optimization and constructions of local minimizers in the training of artificial neural networks
- Non-convergence to global minimizers in data driven supervised deep learning: Adam and stochastic gradient descent optimization provably fail to converge to global minimizers in the training of deep neural networks with ReLU activation
This page was built for publication: Approximation results for gradient flow trained neural networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6955712)
