Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the sample complexity for nonoverlapping neural networks

From MaRDI portal
Publication:1964680
Jump to:navigation, search

DOI10.1023/A:1007609822199zbMath0941.68115OpenAlexW1674714310MaRDI QIDQ1964680

Michael Schmitt

Publication date: 23 February 2000

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1007609822199


zbMATH Keywords

neural network


Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)


Related Items (1)

On the Complexity of Computing and Learning with Multiplicative Neural Networks







This page was built for publication: On the sample complexity for nonoverlapping neural networks

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1964680&oldid=14413216"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 16:37.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki