{"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/learning-attractor-dynamics-for-generative","title":"Learning Attractor Dynamics for Generative Memory","arxiv_id":"1811.09556","date":"2018-11-23","proceeding":"NeurIPS 2018 12","authors":["Yan Wu","Greg Wayne","Karol Gregor","Timothy Lillicrap"],"abstract":"A central challenge faced by memory systems is the robust retrieval of a\nstored pattern in the presence of interference due to other stored patterns and\nnoise. A theoretically well-founded solution to robust retrieval is given by\nattractor dynamics, which iteratively clean up patterns during recall. However,\nincorporating attractor dynamics into modern deep learning systems poses\ndifficulties: attractor basins are characterised by vanishing gradients, which\nare known to make training neural networks difficult. In this work, we avoid\nthe vanishing gradient problem by training a generative distributed memory\nwithout simulating the attractor dynamics. Based on the idea of memory writing\nas inference, as proposed in the Kanerva Machine, we show that a\nlikelihood-based Lyapunov function emerges from maximising the variational\nlower-bound of a generative memory. Experiments shows it converges to correct\npatterns upon iterative retrieval and achieves competitive performance as both\na memory model and a generative model.","url_abs":"http://arxiv.org/abs/1811.09556v1","url_pdf":"http://arxiv.org/pdf/1811.09556v1.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":"learning-attractor-dynamics-for-generative","repo_url":"https://github.com/deepmind/dynamic-kanerva-machines","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"retrieval","task_name":"Retrieval"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1811.09556","atlas_url":"https://app.syntology.ai/?focus=1811.09556","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":"1811.09556"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1811.09556\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1811.09556"},"call":"get_concepts_for_paper(arxiv_id=\"1811.09556\")"}],"by_repo":[{"repo":"deepmind/dynamic-kanerva-machines","kind":"official","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":"80722efccd5c8a01c75b23be7aea3462439907235ec17ba7b7ad1a9aca077e0b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}