Complexity of network training for classes of Neural Networks

DOI10.1007/3-540-60454-5_40MaRDI QIDQ6083912zbMATH OpenFDO

Authors Charles C. Pinter

Publication date 8 December 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60454-5_40

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• On the infeasibility of training neural networks with small mean-squared error
• The computational intractability of training sigmoidal neural networks
• Complexity of training ReLU neural network
• Training a Single Sigmoidal Neuron Is Hard
• Hardness results for neural network approximation problems

Cites work

• On learning a union of half spaces
• On the complexity of loading shallow neural networks

Cited in

(1)

• Reachability in Simple Neural Networks

This page was built for publication: Complexity of network training for classes of Neural Networks

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