{"url":"/method/associative-lstm","slug":"associative-lstm","name":"Associative LSTM","full_name":"Associative LSTM","full_name_withheld":false,"description_markdown":"An **Associative LSTM** combines an [LSTM](https://paperswithcode.com/method/lstm) with ideas from Holographic Reduced Representations (HRRs) to enable key-value storage of data. HRRs use a “binding” operator to implement key-value\r\nbinding between two vectors (the key and its associated content). They natively implement associative arrays; as a byproduct, they can also easily implement stacks, queues, or lists.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Associative Long Short-Term Memory","paper":"/paper/associative-long-short-term-memory","first_author":"Ivo Danihelka","n_authors":5,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/associative-long-short-term-memory"},"source":{"url":"http://arxiv.org/abs/1602.03032v2","title":"Associative Long Short-Term Memory","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Sequential","area_id":"sequential","collection":"Recurrent Neural Networks","url":"/methods/category/recurrent-neural-networks","pwc_aliases":[]}],"n_papers_tagged":1,"archive_num_papers":1,"papers_newest_first":[{"paper":"/paper/associative-long-short-term-memory","title":"Associative Long Short-Term Memory","date":"2016-02-09","arxiv_id":"1602.03032","n_code_links":3,"syntology":null}],"papers_shown":1,"tasks":[{"task":"/task/memorization","name":"Memorization","papers":1},{"task":"/task/retrieval","name":"Retrieval","papers":1}],"tasks_shown":2,"n_tasks":2,"usage_by_year":[{"year":"2016","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/associative-lstm"},"syntology_read_at":"2026-09-24T18:15:14+00:00"}