Associative Long Short-Term Memory
Ivo Danihelka, Greg Wayne, Benigno Uria, Nal Kalchbrenner, Alex Graves

TL;DR
This paper introduces an associative memory extension to LSTM networks using complex-valued vectors, enabling faster learning and improved retrieval accuracy without increasing model size.
Contribution
It proposes a novel associative memory mechanism based on complex vectors that enhances LSTM performance by reducing retrieval noise and increasing redundancy.
Findings
Faster learning on memorization tasks
Reduced retrieval noise due to redundancy
Comparable or improved performance without extra parameters
Abstract
We investigate a new method to augment recurrent neural networks with extra memory without increasing the number of network parameters. The system has an associative memory based on complex-valued vectors and is closely related to Holographic Reduced Representations and Long Short-Term Memory networks. Holographic Reduced Representations have limited capacity: as they store more information, each retrieval becomes noisier due to interference. Our system in contrast creates redundant copies of stored information, which enables retrieval with reduced noise. Experiments demonstrate faster learning on multiple memorization tasks.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Memory and Neural Computing · Ferroelectric and Negative Capacitance Devices · Neural Networks and Reservoir Computing
MethodsSigmoid Activation · Tanh Activation · Holographic Reduced Representation · Long Short-Term Memory · Adam · Associative LSTM
