Pages that link to "Item:Q4336293"
From MaRDI portal
The following pages link to The computational intractability of training sigmoidal neural networks (Q4336293):
Displaying 7 items.
- Ridgelets: estimating with ridge functions (Q1431441) (← links)
- Hardness results for neural network approximation problems (Q1603592) (← links)
- Some problems in the theory of ridge functions (Q1798075) (← links)
- Local greedy approximation for nonlinear regression and neural network training. (Q1848831) (← links)
- On approximate learning by multi-layered feedforward circuits (Q2581366) (← links)
- Training a Single Sigmoidal Neuron Is Hard (Q4409384) (← links)
- CONVERGENCE OF A LEAST‐SQUARES MONTE CARLO ALGORITHM FOR AMERICAN OPTION PRICING WITH DEPENDENT SAMPLE DATA (Q4635047) (← links)
