Curse of dimensionality in neural network optimization
From MaRDI portal
Cites work
- A mean field view of the landscape of two-layer 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
- Approximation rates for neural networks with general activation functions
- Breaking the curse of dimensionality with convex neural networks
- Deep network approximation characterized by number of neurons
- Deep Network Approximation for Smooth Functions
- Deep network with approximation error being reciprocal of width to power of square root of depth
- Deep ReLU Networks Overcome the Curse of Dimensionality for Generalized Bandlimited Functions
- DGM: a deep learning algorithm for solving partial differential equations
- Distance-based classification with Lipschitz functions
- Embeddings between Barron spaces with higher-order activation functions
- Error bounds for approximations with deep ReLU networks
- Gradient descent optimizes over-parameterized deep ReLU networks
- High-order approximation rates for shallow neural networks with cosine and \(\mathrm{ReLU}^k\) activation functions
- Kolmogorov width decay and poor approximators in machine learning: shallow neural networks, random feature models and neural tangent kernels
- Loss landscapes and optimization in over-parameterized non-linear systems and neural networks
- Lower bounds for artificial neural network approximations: a proof that shallow neural networks fail to overcome the curse of dimensionality
- Neural network approximation: three hidden layers are enough
- Optimal approximation rate of ReLU networks in terms of width and depth
- Optimal nonlinear approximation
- Optimal rates of approximation by shallow \(\operatorname{ReLU}^k\) neural networks and applications to nonparametric regression
- Optimal Transport
- Physics-informed neural networks: a deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations
- Product rules are optimal for numerical integration in classical smoothness spaces
- Representation formulas and pointwise properties for Barron functions
- SelectNet: self-paced learning for high-dimensional partial differential equations
- Sharp Bounds on the Approximation Rates, Metric Entropy, and n-Widths of Shallow Neural Networks
- Solving high-dimensional partial differential equations using deep learning
- The Barron space and the flow-induced function spaces for neural network models
- The curse of dimensionality for numerical integration of smooth functions
- Theoretical Insights Into the Optimization Landscape of Over-Parameterized Shallow Neural Networks
- Understanding machine learning. From theory to algorithms
- Universal approximation bounds for superpositions of a sigmoidal function
This page was built for publication: Curse of dimensionality in neural network optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7290866)
