Recursive Distributed Representations (1990)
Cached
Download Links
- [ftp.cis.ohio-state.edu]
- [www.demo.cs.brandeis.edu]
- [demo.cs.brandeis.edu]
- [www.blutner.de]
- DBLP
Other Repositories/Bibliography
| Venue: | Artificial Intelligence |
| Citations: | 299 - 9 self |
BibTeX
@ARTICLE{Pollack90recursivedistributed,
author = {Jordan B. Pollack},
title = {Recursive Distributed Representations},
journal = {Artificial Intelligence},
year = {1990},
volume = {46},
pages = {77--105}
}
Years of Citing Articles
OpenURL
Abstract
A long-standing difficulty for connectionist modeling has been how to represent variable-sized recursive data structures, such as trees and lists, in fixed-width patterns. This paper presents a connectionist architecture which automatically develops compact distributed representations for such compositional structures, as well as efficient accessing mechanisms for them. Patterns which stand for the internal nodes of fixed-valence trees are devised through the recursive use of back-propagation on three-layer autoassociative encoder networks. The resulting representations are novel, in that they combine apparently immiscible aspects of features, pointers, and symbol structures. They form a bridge between the data structures necessary for high-level cognitive tasks and the associative, pattern recognition machinery provided by neural networks. 2 J. B. Pollack 1. Introduction One of the major stumbling blocks in the application of Connectionism to higherlevel cognitive tasks, such as Na...







