✦ LIBER ✦

On the Complexity of Computing and Learning with Multiplicative Neural Networks

✍ Scribed by Schmitt, Michael

Book ID: 124097627
Publisher: MIT Press
Year: 2002
Tongue: English
Weight: 335 KB
Volume: 14
Category: Article
ISSN: 0899-7667
DOI: 10.1162/08997660252741121

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal size of neural networks with mul

Optimal size of neural networks with multiplicative learning

✍ R. Németh; T. Geszti 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 332 KB

Effect of complexity on learning ability

Effect of complexity on learning ability of recurrent neural networks

✍ N. Honma; K. Kitagawa; K. Abe 📂 Article 📅 1998 🏛 Springer Japan 🌐 English ⚖ 378 KB

Analytical description of the evolution

Analytical description of the evolution of neural networks: learning rules and complexity

✍ K. Holthausen; O. Breidbach 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 161 KB

On the complexity of loading shallow neu

On the complexity of loading shallow neural networks

✍ Stephen Judd 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 898 KB

We formalize a notion of loading information into connectionist networks that characterizes the training of feed-forward neural networks. This problem is NPcomplete, so we look for tractable subcases of the problem by placing constraints on the network architecture. The focus of these constraints is

On learning of Sigmoid Neural Networks

✍ Kayvan Najarian 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB

Topological and Dynamical Complexity of

Topological and Dynamical Complexity of Random Neural Networks

✍ Wainrib, Gilles; Touboul, Jonathan 📂 Article 📅 2013 🏛 The American Physical Society 🌐 English ⚖ 186 KB