...
首页> 外文期刊>IEEE Transactions on Neural Networks >Designing asymmetric Hopfield-type associative memory with higher order hamming stability
【24h】

Designing asymmetric Hopfield-type associative memory with higher order hamming stability

机译:设计具有高阶汉明稳定性的非对称Hopfield型联想记忆

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

The problem of optimal asymmetric Hopfield-type associative memory (HAM) design based on perceptron-type learning algorithms is considered. It is found that most of the existing methods considered the design problem as either 1) finding optimal hyperplanes according to normal distance from the prototype vectors to the hyperplane surface or 2) obtaining weight matrix W=[w/sub ij/] by solving a constraint optimization problem. In this paper, we show that since the state space of the HAM consists of only bipolar patterns, i.e., V=(v/sub 1/,v/sub 2/,...,v/sub N/)/sup T//spl isin/{-1,+1}/sup N/, the basins of attraction around each prototype (training) vector should be expanded by using Hamming distance measure. For this reason, in this paper, the design problem is considered from a different point of view. Our idea is to systematically increase the size of the training set according to the desired basin of attraction around each prototype vector. We name this concept the higher order Hamming stability and show that conventional minimum-overlap algorithm can be modified to incorporate this concept. Experimental results show that the recall capability as well as the number of spurious memories are all improved by using the proposed method. Moreover, it is well known that setting all self-connections w/sub ii//spl forall/i to zero has the effect of reducing the number of spurious memories in state space. From the experimental results, we find that the basin width around each prototype vector can be enlarged by allowing nonzero diagonal elements on learning of the weight matrix W. If the magnitude of w/sub ii/ is small for all i, then the condition w/sub ii/=0/spl forall/i can be relaxed without seriously affecting the number of spurious memories in the state space. Therefore, the method proposed in this paper can be used to increase the basin width around each prototype vector with the cost of slightly increasing the number of spurious memories in the state space.
机译:研究了基于感知器型学习算法的最优非对称Hopfield型联想记忆(HAM)设计问题。发现大多数现有方法都将设计问题视为:1)根据从原型矢量到超平面表面的正常距离找到最佳超平面,或2)通过求解a获得权重矩阵W = [w / sub ij /]。约束优化问题。在本文中,我们表明,由于HAM的状态空间仅由双极性模式组成,即V =(v / sub 1 /,v / sub 2 /,...,v / sub N /)/ sup T // spl isin / {-1,+ 1} / sup N /,应使用汉明距离度量来扩展每个原型(训练)矢量周围的吸引盆地。因此,本文从不同的角度来考虑设计问题。我们的想法是根据每个原型向量周围的期望吸引盆,系统地增加训练集的大小。我们将此概念命名为高阶汉明稳定性,并表明可以对常规最小重叠算法进行修改以合并该概念。实验结果表明,该方法可以提高召回能力和虚假存储器的数量。此外,众所周知,将所有自连接w / sub ii // spl forall / i设置为零具有减少状态空间中虚假存储器的数量的效果。从实验结果中,我们发现可以通过在权重矩阵W的学习中允许非零对角线元素来扩大每个原型向量周围的盆地宽度。如果w / sub ii /的大小对于所有i都较小,则条件w / sub ii / = 0 / spl forall / i可以放宽,而不会严重影响状态空间中虚假内存的数量。因此,本文提出的方法可用于增加每个原型向量周围的水盆宽度,其代价是略微增加了状态空间中的虚假内存数量。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号