Binary Spatter-Coding of Ordered K-Tuples

By Pentti Kanerva. 1996

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Sjoerd van Steenkiste
2. Klaus Greff
3. J. Urgen Schmidhuber
4. Yoshua Bengio
5. Sergey Levine
6. Quoc V. Le
7. Trevor Darrell
8. Kyunghyun Cho

Citations in the corpus

• On the Binding Problem in Artificial Neural Networks (2020, background): “TPRs were first introduced in Smolensky (1990) and several modifications have since been proposed that consider different binding, unbinding, and conjunction operations (Plate, 1995; Kanerva, 1996; Gayler, 1998; see Kelly et al., 2013 for an overview).”
• Resonator Networks, 1: An Efficient Solution for Factoring High-Dimensional, Distributed Representations of Data Structures (2020, methodology): “Here we show how this may be accomplished within the framework of Vector Symbolic Architectures (VSAs) (Plate, 1991; Gayler, 1998; Kanerva, 1996), whereby data structures are encoded by combining high-dimensional vectors with operations that together form an algebra on the space of distributed repre”