Pages that link to "Item:Q4701411"
From MaRDI portal
The following pages link to Efficient estimation of neural weights by polynomial approximation (Q4701411):
Displaying 11 items.
- On sharpness of error bounds for univariate approximation by single hidden layer feedforward neural networks (Q777322) (← links)
- Lower estimation of approximation rate for neural networks (Q848260) (← links)
- Neural computation for robust approximate pole assignment (Q1305913) (← links)
- New study on neural networks: the essential order of approximation (Q1784569) (← links)
- A counterexample regarding ``New study on neural networks: the essential order of approximation'' (Q2185691) (← links)
- The essential order of approximation for nearly exponential type neural networks (Q2507488) (← links)
- Efficient calculation of the Gauss-Newton approximation of the Hessian matrix in neural networks (Q2885106) (← links)
- Constructive estimation of approximation for trigonometric neural networks (Q2902631) (← links)
- On sharpness of error bounds for multivariate neural network approximation (Q6060396) (← links)
- Towards a mathematical framework to inform neural network modelling via polynomial regression (Q6079052) (← links)
- ReLU neural networks of polynomial size for exact maximum flow computation (Q6086001) (← links)
