Multiplicative Binding, Representation Operators & Analogy

By Ross W. Gayler. 1998

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. J. Urgen Schmidhuber
3. Klaus Greff
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): “In this article, we focus on the VSA framework called Multiply-Add-Permute (Gayler, 1998, 2003).”
• The Problem of Rapid Variable Creation (2009, background): “Both VSAs (as exemplified in Gayler, 1998; Kanerva, 1997; Plate, 1994; Rachkovskij & Kussul, 2001) and their conceptual ancestor, tensor product representations (Smolensky, 1990), permit effective binding of values to variables, and, in the presence of suitable processing mechanisms, interesting…”