{"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/hyperentm-evolving-scalable-neural-turing","title":"HyperENTM: Evolving Scalable Neural Turing Machines through HyperNEAT","arxiv_id":"1710.04748","date":"2017-10-12","proceeding":null,"authors":["Jakob Merrild","Mikkel Angaju Rasmussen","Sebastian Risi"],"abstract":"Recent developments within memory-augmented neural networks have solved\nsequential problems requiring long-term memory, which are intractable for\ntraditional neural networks. However, current approaches still struggle to\nscale to large memory sizes and sequence lengths. In this paper we show how\naccess to memory can be encoded geometrically through a HyperNEAT-based Neural\nTuring Machine (HyperENTM). We demonstrate that using the indirect HyperNEAT\nencoding allows for training on small memory vectors in a bit-vector copy task\nand then applying the knowledge gained from such training to speed up training\non larger size memory vectors. Additionally, we demonstrate that in some\ninstances, networks trained to copy bit-vectors of size 9 can be scaled to\nsizes of 1,000 without further training. While the task in this paper is\nsimple, these results could open up the problems amendable to networks with\nexternal memories to problems with larger memory vectors and theoretically\nunbounded memory sizes.","url_abs":"http://arxiv.org/abs/1710.04748v1","url_pdf":"http://arxiv.org/pdf/1710.04748v1.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":"hyperentm-evolving-scalable-neural-turing","repo_url":"https://github.com/kalanzai/ENTM_CSharpPort","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"kalanzai/ENTM_CSharpPort","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":"63cee8f120f040fdb82ade8c27f6174f7f5077c804ae1bbed9dbbc602f0bee92","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}