Scaling Properties of Coarse-Coded Symbol Memories
Abstract
Coarse coded memories have appeared in several neural network symbol processing models, such as Touretzky and Hinton's distributed connectionist production system DCPS, Touretzky's distributed implementation of Lisp S- expressions on a Boltzmann machine, and St. John and McClelland's PDP model of case role defaults. In order to determine how these models would scale, one must first have some understanding of the mathematics of coarse coded representations. For example, the working memory of DCPS, which stores triples of symbols and consists of 2,000 units, can hold roughly 20 items at a time out of a 15,625-symbol alphabet. How would DCPS scale if the alphabet size were raised to 50,000? With the current alphabet size, how many units would have to be added simply to double the working memory capacity to 40 triples? The authors present some analytical results related to these questions.
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 29, 1987
- Accession Number
- ADA204456
Entities
People
- David S. Touretzky
- Roni Rosenfeld
Organizations
- Carnegie Mellon University