Stability of completely connected recursive neural networks (Q2705691)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Stability of completely connected recursive neural networks |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stability of completely connected recursive neural networks |
scientific article |
Statements
16 October 2001
0 references
recursive neural networks
0 references
completely connected networks
0 references
stability of neural networks
0 references
Stability of completely connected recursive neural networks (English)
0 references
The linear stability of completely connected recursive neural networks is discussed. Conditions are found for the weights in the case when small disturbances of inputs are allowed such that the outputs change also very little. This is done for discrete-time dynamic neural networks with the sigmoidal transfer function. The same is performed when the inputs are kept fixed but the weights can be disturbed. The linear stability is handled for, so to speak, frozen neural networks by means of a Taylor series expansion technique. The authors also require the corresponding conditions for stability to be conditions of structural stability of such neural networks. This seems not to be a precise statement as for structural stability one would need rather the stability against small disturbances of the neural network transfer function as well as of the coefficients in the equations.
0 references
0.7997888326644897
0 references
0.7780063152313232
0 references
0.7606902718544006
0 references
0.7539897561073303
0 references
0.7441679239273071
0 references