๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The three-state layered neural network with finite dilution

โœ Scribed by W.K Theumann; R Erichsen Jr.

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
246 KB
Volume
341
Category
Article
ISSN
0378-4371

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Feed-forward chains of recurrent attract
Feed-forward chains of recurrent attractor neural networks with finite dilution near saturation
โœ F.L. Metz; W.K. Theumann ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 268 KB

A stationary state replica analysis for a dual neural network model that interpolates between a fully recurrent symmetric attractor network and a strictly feed-forward layered network, studied by Coolen and Viana, is extended in this work to account for finite dilution of the recurrent Hebbian inter

Bounds on the complexity of recurrent ne
Bounds on the complexity of recurrent neural network implementations of finite state machines
โœ Bill G. Horne; Don R. Hush ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 823 KB

In this paper the efficiency of recurrent neural network implementations of m-state finite state machines will be explored. Specifically, it will be shown that the node complexity for the unrestricted case can be bounded above by O(v/-m-). It will also be shown that the node complexity is 0( ~) when