✦ LIBER ✦

Lower bound for connectivity in local-learning neural networks

✍ Scribed by Yaser S Abu-Mostafa

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 457 KB
Volume: 4
Category: Article
ISSN: 0885-064X
DOI: 10.1016/0885-064x(88)90022-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Local conditions for phase transitions i

Local conditions for phase transitions in neural networks with variable connection strengths

✍ Frank E. McFadden; Yun Peng; James A. Reggia 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 898 KB

Qualitative changes in the behavior of a neural network may occur when parameters cross critical boundaries. These phase transitions may be triggered either by learning or by the intrinsic dynamics of the network, and must be understood in order to g~tarantee that the behavior of the model will be m

Local unsupervised learning rules for a

Local unsupervised learning rules for a spiking neural network with dendrite

✍ Olivier FL Manette 📂 Article 📅 2011 🏛 BioMed Central 🌐 English ⚖ 316 KB

How could synapse number and position on a dendrite affect neuronal behavior with respect to the decoding of firing rate and temporal pattern? We developed a model of a neuron with a passive dendrite and found that dendritic length and the particular synapse positions directly determine the behavior

A lower bound for interval routing in ge

A lower bound for interval routing in general networks

✍ Tse, Savio S. H.; Lau, Francis C. M. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB 👁 2 views

Interval routing is a space-efficient routing method for point-to-point communication networks. The method has drawn considerable attention in recent years because of its being incorporated into the design of a commercially available routing chip. The method is based on proper labeling of edges of t

Reinforcement learning in random neural

Reinforcement learning in random neural networks for cascaded decisions

✍ Ugur Halici 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 771 KB

Lower Bounds for Dynamic Tree Embedding

Lower Bounds for Dynamic Tree Embedding in Bipartite Networks

✍ Keqin Li; Yi Pan; Hong Shen; Gilbert H. Young; Si Qing Zheng 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 332 KB

Artificial Neural Networks for Modeling

Artificial Neural Networks for Modeling Knowing and Learning in Science

✍ Wolff-Michael Roth 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB 👁 2 views

Recent neurobiological evidence suggests that environmentally derived activity plays a central role in regulating neuronal growth and neuronal connectivity. Artificial neural networks with distributed representations display many features of knowing and learning that are known from biological intell