Hopfield Neural Network (HNN) is a classic auto-associative memory formulation with a content-addressable property – allowing storage of multiple patterns and retrieval of one of the stored patterns on being presented with a cue that is a partial/noisy version of the stored pattern. In this work, we examine in detail two kinds of ‘attractors’ of HNN, namely, a) Point Attractors (PA) and b) Limit-Cycles (LC), and demonstrate their ability to handle ‘clustered’ data in the form of vector patterns (for PA) and vector sequence patterns (for LC). Specifically, we note: a) Both attractor types exhibit high performance in modeling ‘clustered’ data in their ‘basins of attraction’, b) LC-attractor type offers superior retrieval performance over PA, by retrieving a stored ‘sequence’ (with the corresponding individual stored vector-states forming the LC) more accurately than when the vector-patterns are stored as a PA. We posit that this is due to the state-to-state neuro-dynamical cohesion in Limit-Cycle attractors, brought about by our proposed 2-stage firing-rule with a State-Transition-and-Stabilization retrieval mechanism that binds vector-states more accurately.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Clustering by Limit-Cycles in Hopfield Neural Network

  • Jhelum Das,
  • Vandana M. Ladwani,
  • V. Ramasubramanian

摘要

Hopfield Neural Network (HNN) is a classic auto-associative memory formulation with a content-addressable property – allowing storage of multiple patterns and retrieval of one of the stored patterns on being presented with a cue that is a partial/noisy version of the stored pattern. In this work, we examine in detail two kinds of ‘attractors’ of HNN, namely, a) Point Attractors (PA) and b) Limit-Cycles (LC), and demonstrate their ability to handle ‘clustered’ data in the form of vector patterns (for PA) and vector sequence patterns (for LC). Specifically, we note: a) Both attractor types exhibit high performance in modeling ‘clustered’ data in their ‘basins of attraction’, b) LC-attractor type offers superior retrieval performance over PA, by retrieving a stored ‘sequence’ (with the corresponding individual stored vector-states forming the LC) more accurately than when the vector-patterns are stored as a PA. We posit that this is due to the state-to-state neuro-dynamical cohesion in Limit-Cycle attractors, brought about by our proposed 2-stage firing-rule with a State-Transition-and-Stabilization retrieval mechanism that binds vector-states more accurately.