{"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/memory-based-control-with-recurrent-neural","title":"Memory-based control with recurrent neural networks","arxiv_id":"1512.04455","date":"2015-12-14","proceeding":null,"authors":["Nicolas Heess","Jonathan J. Hunt","Timothy P. Lillicrap","David Silver"],"abstract":"Partially observed control problems are a challenging aspect of reinforcement\nlearning. We extend two related, model-free algorithms for continuous control\n-- deterministic policy gradient and stochastic value gradient -- to solve\npartially observed domains using recurrent neural networks trained with\nbackpropagation through time.\n  We demonstrate that this approach, coupled with long-short term memory is\nable to solve a variety of physical control problems exhibiting an assortment\nof memory requirements. These include the short-term integration of information\nfrom noisy sensors and the identification of system parameters, as well as\nlong-term memory problems that require preserving information over many time\nsteps. We also demonstrate success on a combined exploration and memory problem\nin the form of a simplified version of the well-known Morris water maze task.\nFinally, we show that our approach can deal with high-dimensional observations\nby learning directly from pixels.\n  We find that recurrent deterministic and stochastic policies are able to\nlearn similarly good solutions to these tasks, including the water maze where\nthe agent must learn effective search strategies.","url_abs":"http://arxiv.org/abs/1512.04455v1","url_pdf":"http://arxiv.org/pdf/1512.04455v1.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":"memory-based-control-with-recurrent-neural","repo_url":"https://github.com/fshamshirdar/pytorch-rdpg","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"memory-based-control-with-recurrent-neural","repo_url":"https://github.com/quantumiracle/Popular-RL-Algorithms","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"memory-based-control-with-recurrent-neural","repo_url":"https://github.com/stevenpjg/RDPG","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"continuous-control","task_name":"Continuous Control"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"continuous-control","task_name":"continuous-control"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1512.04455","atlas_url":"https://app.syntology.ai/?focus=1512.04455","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":"1512.04455"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1512.04455\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1512.04455"},"call":"get_concepts_for_paper(arxiv_id=\"1512.04455\")"}],"by_repo":[{"repo":"fshamshirdar/pytorch-rdpg","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1509.02971"],"harvested_for_calls":[{"arxiv_id":"1509.02971","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1509.02971"},"call":"get_harvested_code_for_paper(arxiv_id=\"1509.02971\")"}]},{"repo":"quantumiracle/Popular-RL-Algorithms","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1801.01290"],"harvested_for_calls":[{"arxiv_id":"1801.01290","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1801.01290"},"call":"get_harvested_code_for_paper(arxiv_id=\"1801.01290\")"}]},{"repo":"stevenpjg/RDPG","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"767cedfe5e2b2d59533cbc1b44d5b210f49e2dd15f8ffe8857011c2985fc72fb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}