返回
摘要
En 中文
We present a new learning algorithm for the structure of recurrent neural networks. It is shown that any m linearly independent n-dimensional vectors can be stored in at most (n + m - 2)-dimensional symmetric network. A storage procedure which satisfy this bound is presented. We propose a new learning procedure for the domain of attraction which preserves both the equilibrium set and the stability property of the original system. It is shown that previously learned attraction regions remain invariant under the proposed learning rule. Our emphasis throughout this brief is on the design of associative memories and classifiers.
Keyword:
convergence domain of attraction
recurrent networks
structure learning
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.2
论文数:
9.8K
被引数:
2.2W
机构
暂无机构信息

