scientific article; zbMATH DE number 67614

MaRDI QIDQ4013532zbMATH OpenFDO

Authors Jyh-Han Lin, Jeffrey Scott Vitter

Publication date 27 September 1992

zbMATH Keywords

optimal designneural netsNP-completetraining problemcascade netscomputational complexity of learning by neural netsneural net learning model

Mathematics Subject Classification ID

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

Recommendations

• Complexity of learning in artificial neural networks
• Publication:3484350
• scientific article; zbMATH DE number 5957227
• The computational intractability of training sigmoidal neural networks
• scientific article; zbMATH DE number 2018620

Cited in

(12)

• scientific article; zbMATH DE number 774006 (Why is no real title available?)
• scientific article; zbMATH DE number 19778 (Why is no real title available?)
• Minimal perceptrons for memorizing complex patterns
• scientific article; zbMATH DE number 1304387 (Why is no real title available?)
• Self-regulated complexity in neural networks
• On the complexity of belief network synthesis and refinement
• scientific article; zbMATH DE number 17222 (Why is no real title available?)
• scientific article; zbMATH DE number 19763 (Why is no real title available?)
• Complexity and neural networks
• Loading Deep Networks Is Hard: The Pyramidal Case
• On the complexity of computing and learning with multiplicative neural networks
• scientific article; zbMATH DE number 2018620 (Why is no real title available?)

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