Dependence of Computational Models on Input Dimension: Tractability of Approximation and Optimization Tasks
From MaRDI portal
Cited in
(19)- Correlations of random classifiers on large data sets
- Probabilistic lower bounds for approximation by shallow perceptron networks
- Universal approximation with quadratic deep networks
- Robust min-max optimal control design for systems with uncertain models: a neural dynamic programming approach
- Negative results for approximation using single layer and multilayer feedforward neural networks
- Almost optimal estimates for approximation and learning by radial basis function networks
- Two fast and accurate heuristic RBF learning rules for data classification
- Smart sampling and incremental function learning for very large high dimensional data
- Approximate dynamic programming for stochastic \(N\)-stage optimization with application to optimal consumption under uncertainty
- On the curse of dimensionality in the Ritz method
- Complexity of shallow networks representing finite mappings
- Accuracy of approximations of solutions to Fredholm equations by kernel methods
- Wavelet neural networks functional approximation and application
- On the approximation of functions by tanh neural networks
- Approximation capabilities of neural networks on unbounded domains
- Lower bounds for artificial neural network approximations: a proof that shallow neural networks fail to overcome the curse of dimensionality
- Approximation of classifiers by deep perceptron networks
- Data-driven performance metrics for neural network learning
- Approximation error estimates by noise-injected neural networks
This page was built for publication: Dependence of Computational Models on Input Dimension: Tractability of Approximation and Optimization Tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5272131)
