{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/associative-long-short-term-memory","title":"Associative Long Short-Term Memory","arxiv_id":"1602.03032","date":"2016-02-09","proceeding":null,"authors":["Ivo Danihelka","Greg Wayne","Benigno Uria","Nal Kalchbrenner","Alex Graves"],"abstract":"We investigate a new method to augment recurrent neural networks with extra\nmemory without increasing the number of network parameters. The system has an\nassociative memory based on complex-valued vectors and is closely related to\nHolographic Reduced Representations and Long Short-Term Memory networks.\nHolographic Reduced Representations have limited capacity: as they store more\ninformation, each retrieval becomes noisier due to interference. Our system in\ncontrast creates redundant copies of stored information, which enables\nretrieval with reduced noise. Experiments demonstrate faster learning on\nmultiple memorization tasks.","url_abs":"http://arxiv.org/abs/1602.03032v2","url_pdf":"http://arxiv.org/pdf/1602.03032v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"associative-long-short-term-memory","repo_url":"https://github.com/henrysteinitz/holographic-reduced-representations","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"associative-long-short-term-memory","repo_url":"https://github.com/henrysteinitz/neural-memory","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"associative-long-short-term-memory","repo_url":"https://github.com/mohammadpz/Associative_LSTM","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"memorization","task_name":"Memorization"},{"task_slug":"retrieval","task_name":"Retrieval"}],"methods":[{"method_slug":"adam","method_name":"Adam"},{"method_slug":"associative-lstm","method_name":"Associative LSTM"},{"method_slug":"holographic-reduced-representation","method_name":"Holographic Reduced Representation"},{"method_slug":"lstm","method_name":"LSTM"},{"method_slug":"sigmoid-activation","method_name":"Sigmoid Activation"},{"method_slug":"tanh-activation","method_name":"Tanh Activation"}],"datasets_introduced":[],"methods_introduced":[{"slug":"associative-lstm","name":"Associative LSTM","full_name":"Associative LSTM"}],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1602.03032","atlas_url":"https://app.syntology.ai/?focus=1602.03032","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1602.03032"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1602.03032\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1602.03032"},"call":"get_concepts_for_paper(arxiv_id=\"1602.03032\")"}],"by_repo":[{"repo":"henrysteinitz/holographic-reduced-representations","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"henrysteinitz/neural-memory","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"mohammadpz/Associative_LSTM","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"db164ce20f477d7d361a210ad7115b8c2eb660228815707e726cd763c2a6b276","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}