Pages that link to "Item:Q5272131"
From MaRDI portal
The following pages link to Dependence of Computational Models on Input Dimension: Tractability of Approximation and Optimization Tasks (Q5272131):
Displaying 17 items.
- On the curse of dimensionality in the Ritz method (Q274083) (← links)
- Accuracy of approximations of solutions to Fredholm equations by kernel methods (Q433295) (← links)
- Correlations of random classifiers on large data sets (Q2100403) (← links)
- Probabilistic lower bounds for approximation by shallow perceptron networks (Q2181058) (← links)
- Universal approximation with quadratic deep networks (Q2185719) (← links)
- Robust min-max optimal control design for systems with uncertain models: a neural dynamic programming approach (Q2185769) (← links)
- Negative results for approximation using single layer and multilayer feedforward neural networks (Q2226355) (← links)
- Almost optimal estimates for approximation and learning by radial basis function networks (Q2251472) (← links)
- Two fast and accurate heuristic RBF learning rules for data classification (Q2418116) (← links)
- Smart sampling and incremental function learning for very large high dimensional data (Q2418181) (← links)
- Approximate dynamic programming for stochastic \(N\)-stage optimization with application to optimal consumption under uncertainty (Q2450902) (← links)
- Complexity of Shallow Networks Representing Finite Mappings (Q2814145) (← links)
- Wavelet neural networks functional approximation and application (Q5097861) (← links)
- On the approximation of functions by tanh neural networks (Q6055124) (← links)
- Approximation capabilities of neural networks on unbounded domains (Q6055159) (← links)
- Lower bounds for artificial neural network approximations: a proof that shallow neural networks fail to overcome the curse of dimensionality (Q6155895) (← links)
- Approximation of classifiers by deep perceptron networks (Q6488832) (← links)
