Validation in Distributed Representations

Srinivasan, SH and Murty, Narasimha M (1991) Validation in Distributed Representations. In: 1991 IEEE Region 10 International Conference on EC3-Energy, Computer, Communication and Control Systems. TENCON '91, 28-30 August, New Delhi,India, Vol.2, 162-164.

Preview

PDF Validation_in_Distributed_Representations.pdf Download (208kB)

Abstract

In the Hopfield model of content addressable memory, the number of spurious attractors is exponential in the dimensionality of the memory. Hence it is highly likely that the system converges to a spurious memory on an arbitrary input. It is desirable that the system has a way of checking whether its state corresponds to any one of the stored patterns. In this paper we show that it is possible to validate the patterns in a distributed fashion. The model uses complex activations and synapses for this purpose. The genuine memories are defined to be real attractors.Under some assumptions we show that the expected number of spurious attractors is negligibly small. We also calculate the capacity of the model.

Item Type:	Conference Paper
Publisher:	IEEE
Additional Information:	Copyright 1990 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	25 Aug 2008
Last Modified:	19 Sep 2010 04:27
URI:	http://eprints.iisc.ac.in/id/eprint/6907

Actions (login required)

View Item