{"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/neural-map-structured-memory-for-deep","title":"Neural Map: Structured Memory for Deep Reinforcement Learning","arxiv_id":"1702.08360","date":"2017-02-27","proceeding":"ICLR 2018 1","authors":["Emilio Parisotto","Ruslan Salakhutdinov"],"abstract":"A critical component to enabling intelligent reasoning in partially\nobservable environments is memory. Despite this importance, Deep Reinforcement\nLearning (DRL) agents have so far used relatively simple memory architectures,\nwith the main methods to overcome partial observability being either a temporal\nconvolution over the past k frames or an LSTM layer. More recent work (Oh et\nal., 2016) has went beyond these architectures by using memory networks which\ncan allow more sophisticated addressing schemes over the past k frames. But\neven these architectures are unsatisfactory due to the reason that they are\nlimited to only remembering information from the last k frames. In this paper,\nwe develop a memory system with an adaptable write operator that is customized\nto the sorts of 3D environments that DRL agents typically interact with. This\narchitecture, called the Neural Map, uses a spatially structured 2D memory\nimage to learn to store arbitrary information about the environment over long\ntime lags. We demonstrate empirically that the Neural Map surpasses previous\nDRL memories on a set of challenging 2D and 3D maze environments and show that\nit is capable of generalizing to environments that were not seen during\ntraining.","url_abs":"http://arxiv.org/abs/1702.08360v1","url_pdf":"http://arxiv.org/pdf/1702.08360v1.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":"neural-map-structured-memory-for-deep","repo_url":"https://github.com/zuoxingdong/VIN_PyTorch_Visdom","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"deep-reinforcement-learning","task_name":"Deep Reinforcement Learning"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"reinforcement-learning-2","task_name":"reinforcement-learning"}],"methods":[{"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":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1702.08360","atlas_url":"https://app.syntology.ai/?focus=1702.08360","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":"1702.08360"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1702.08360\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1702.08360"},"call":"get_concepts_for_paper(arxiv_id=\"1702.08360\")"}],"by_repo":[{"repo":"zuoxingdong/VIN_PyTorch_Visdom","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1602.02867"],"harvested_for_calls":[{"arxiv_id":"1602.02867","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1602.02867"},"call":"get_harvested_code_for_paper(arxiv_id=\"1602.02867\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"092e28acbc0c9cdfcb50631c5aaeaac6d8665bb5ec3e61b6ab01e824948ebe5f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}