scientific article; zbMATH DE number 2080455

MaRDI QIDQ4473252zbMATH OpenFDO

Authors Barbara Hammer, Bhaskar Dasgupta

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1968/19680264.htm

Mathematics Subject Classification ID

Computational learning theory (68Q32) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• On approximate learning by multi-layered feedforward circuits
• Hardness results for neural network approximation problems
• Training a Single Sigmoidal Neuron Is Hard
• scientific article; zbMATH DE number 2080651
• On the infeasibility of training neural networks with small mean-squared error

Cited in

(6)

• On approximate learning by multi-layered feedforward circuits
• Multilevel Fine-Tuning: Closing Generalization Gaps in Approximation of Solution Maps under a Limited Budget for Training Data
• Bounds on the learning capacity of some multi-layer networks
• scientific article; zbMATH DE number 1928632 (Why is no real title available?)
• Training a Single Sigmoidal Neuron Is Hard
• Scalable learning method for feedforward neural networks using minimal-enclosing-ball approximation

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473252)