Learning the systematic transformation of holographic reduced representations

Authors:
Jane Neumann
Affiliations:
ICCS, Informatics, University of Edinburgh, 2 Buccleuch Place, Edinburgh EH8 9LW, UK
Venue:
Cognitive Systems Research
Year:
2002

Citing 7
Cited 1

Mapping part-whole hierarchies into connectionist networks

Artificial Intelligence - On connectionist symbol processing
Recursive distributed representations

Artificial Intelligence - On connectionist symbol processing
Tensor product variable binding and the representation of symbolic structures in connectionist systems

Artificial Intelligence - On connectionist symbol processing
Learning Distributed Representations of Concepts Using Linear Relational Embedding

IEEE Transactions on Knowledge and Data Engineering
Distributed representations and nested compositional structure

Distributed representations and nested compositional structure
Binding and Normalization of Binary Sparse Distributed Representations by Context-Dependent Thinning

Neural Computation
Learning distributed representations for the classification of terms

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

The problem of rapid variable creation

Neural Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Holographic Reduced Representation is a representational scheme which allows for the representation of variable-sized structures in a distributed manner. It has been shown that these compositional structures can be transformed holistically. However, in order to do so, the transformation vector was constructed by hand. In this paper we present two methods of learning the holistic transformation of Holographic Reduced Representations from examples. We show that the acquired knowledge can be generalised to structures containing unseen elements and to structures more complex than the training examples. These generalisations require a degree of systematicity which to our knowledge has not yet been achieved by other comparable methods.