Loading Deep Networks Is Hard: The Pyramidal Case

DOI10.1162/0899766053011519MaRDI QIDQ5696500zbMATH OpenOpenAlexFDO

Authors David Windisch

Publication date 18 October 2005

Published in Neural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1162/0899766053011519

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• On the complexity of loading shallow neural networks
• scientific article; zbMATH DE number 774006
• The capacity of feedforward neural networks
• scientific article; zbMATH DE number 67614
• The computational intractability of training sigmoidal neural networks

Cites work

• Hardness results for neural network approximation problems
• Learning representations by back-propagating errors
• Robust trainability of single neurons
• Theory of majority decision elements
• Training a Single Sigmoidal Neuron Is Hard

Cited in

(2)

• On the complexity of loading shallow neural networks
• scientific article; zbMATH DE number 774006 (Why is no real title available?)

This page was built for publication: Loading Deep Networks Is Hard: The Pyramidal Case

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