On the complexity of loading shallow neural networks
From MaRDI portal
Publication:1105389
DOI10.1016/0885-064X(88)90019-2zbMath0648.68086MaRDI QIDQ1105389
Publication date: 1988
Published in: Journal of Complexity (Search for Journal in Brave)
neural networksloadingNP-completeconnectionist networksshallow networkssupport cone interaction graph
Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Applications of graph theory to circuits and networks (94C15)
Related Items (11)
A review of combinatorial problems arising in feedforward neural network design ⋮ On the complexity of approximating and illuminating three-dimensional convex polyhedra ⋮ On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees ⋮ Wrappers for feature subset selection ⋮ Neural networks and complexity theory ⋮ Complexity of network training for classes of Neural Networks ⋮ Learning from hints in neural networks ⋮ On learning a union of half spaces ⋮ Training a Single Sigmoidal Neuron Is Hard ⋮ Stable recovery of entangled weights: towards robust identification of deep neural networks from minimal samples ⋮ Information theory and recovery algorithms for data fusion in Earth observation
Cites Work
This page was built for publication: On the complexity of loading shallow neural networks
