首页 | 官方网站   微博 | 高级检索  
     

基于约束优化的联想记忆模型学习算法
引用本文:汪涛,俞瑞钊.基于约束优化的联想记忆模型学习算法[J].通信学报,1992,13(5):88-92.
作者姓名:汪涛  俞瑞钊
作者单位:浙江大学计算机系,浙江大学计算机系,浙江大学计算机系 杭州 310027,杭州 310027,杭州 310027
摘    要:本文提出了一种对称互连神经元网络的学习策略,利用全局约束优化方法确定连接权。优化过程采用了梯度下降技术。这种学习算法可以保证训练样本成为系统的稳定吸引子,并且具有优化意义上的最大吸引域。本文讨论了网络的存储容量,训练样本的渐近稳定性和吸引域大小。计算机实验结果说明了学习算法的优越性。

关 键 词:联想记忆模型  约束优化  学习算法

Learning Strategy for Associative Memories Based on Constrained Minimization
Wang Tao,Yu Ruizhao and He Zhijun.Learning Strategy for Associative Memories Based on Constrained Minimization[J].Journal on Communications,1992,13(5):88-92.
Authors:Wang Tao  Yu Ruizhao and He Zhijun
Abstract:In the paper, a learning algorithm for symmetric associative memories is examined. Considoring two design criteria, we cast the learning procedure into a constrained minimization, solved by a gradient descent method. The learning approach guarantees storage of each desired pattern with attraction basin as large as possible. We also study storage capacity and the asymptotic stability. Several computer simulations show advantages of the learning algorithm.
Keywords:Associative memory  Constrained optimal learning algorithm  Gradient descent rule  Asymptotic stability  Basin of attraction  
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号