Pages that link to "Item:Q998978"

The following pages link to Complexity of Gaussian-radial-basis networks approximating smooth functions (Q998978):

Displaying 18 items.

• Error estimates of quasi-interpolation and its derivatives (Q421819) (← links)
• Accuracy of approximations of solutions to Fredholm equations by kernel methods (Q433295) (← links)
• Can dictionary-based computational models outperform the best linear ones? (Q456017) (← links)
• Some comparisons of complexity in dictionary-based and linear computational models (Q553254) (← links)
• Suboptimal solutions to dynamic optimization problems via approximations of the policy functions (Q613579) (← links)
• New insights into Witsenhausen's counterexample (Q694180) (← links)
• Comparing fixed and variable-width Gaussian networks (Q889280) (← links)
• Estimates of variation with respect to a set and applications to optimization problems (Q970575) (← links)
• Approximation schemes for functional optimization problems (Q1024253) (← links)
• The rate of approximation of Gaussian radial basis neural networks in continuous function space (Q1940856) (← links)
• Complexity estimates based on integral transforms induced by computational units (Q1941596) (← links)
• Dynamic programming and value-function approximation in sequential decision problems: error analysis and numerical results (Q1949593) (← links)
• Probabilistic lower bounds for approximation by shallow perceptron networks (Q2181058) (← links)
• Two fast and accurate heuristic RBF learning rules for data classification (Q2418116) (← links)
• Complexity of Shallow Networks Representing Finite Mappings (Q2814145) (← links)
• An Integral Upper Bound for Neural Network Approximation (Q3399370) (← links)
• Wavelet neural networks functional approximation and application (Q5097861) (← links)
• Lower bounds for artificial neural network approximations: a proof that shallow neural networks fail to overcome the curse of dimensionality (Q6155895) (← links)