scientific article; zbMATH DE number 2080651

MaRDI QIDQ4473545zbMATH OpenFDO

Authors Jiří Šíma

Publication date 4 August 2004

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

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(8)

• Hardness results for neural network approximation problems
• Complexity of training ReLU neural network
• The computational intractability of training sigmoidal neural networks
• Training a Single Sigmoidal Neuron Is Hard
• scientific article; zbMATH DE number 2080455 (Why is no real title available?)
• Distribution-specific hardness of learning neural networks
• On the infeasibility of training neural networks with small mean-squared error
• Computational limitations on training sigmoid neural networks

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 Q4473545)