{"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/distributed-distributional-deterministic","title":"Distributed Distributional Deterministic Policy Gradients","arxiv_id":"1804.08617","date":"2018-04-23","proceeding":"ICLR 2018 1","authors":["Gabriel Barth-Maron","Matthew W. Hoffman","David Budden","Will Dabney","Dan Horgan","Dhruva TB","Alistair Muldal","Nicolas Heess","Timothy Lillicrap"],"abstract":"This work adopts the very successful distributional perspective on\nreinforcement learning and adapts it to the continuous control setting. We\ncombine this within a distributed framework for off-policy learning in order to\ndevelop what we call the Distributed Distributional Deep Deterministic Policy\nGradient algorithm, D4PG. We also combine this technique with a number of\nadditional, simple improvements such as the use of $N$-step returns and\nprioritized experience replay. Experimentally we examine the contribution of\neach of these individual components, and show how they interact, as well as\ntheir combined contributions. Our results show that across a wide variety of\nsimple control tasks, difficult manipulation tasks, and a set of hard\nobstacle-based locomotion tasks the D4PG algorithm achieves state of the art\nperformance.","url_abs":"http://arxiv.org/abs/1804.08617v1","url_pdf":"http://arxiv.org/pdf/1804.08617v1.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":"distributed-distributional-deterministic","repo_url":"https://github.com/schatty/D4PG-pytorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"distributed-distributional-deterministic","repo_url":"https://github.com/vgudapati/DRLND_Collaboration_Competetion","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"distributed-distributional-deterministic","repo_url":"https://github.com/zhou-henry/distributed-distributional-drq","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"distributed-distributional-deterministic","repo_url":"https://github.com/HzcIrving/DLRL-PlayGround","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"distributed-distributional-deterministic","repo_url":"https://github.com/opendilab/DI-engine/blob/main/ding/policy/d4pg.py","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"continuous-control","task_name":"Continuous Control"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"continuous-control","task_name":"continuous-control"}],"methods":[{"method_slug":"adam","method_name":"Adam"},{"method_slug":"batch-normalization","method_name":"Batch Normalization"},{"method_slug":"d4pg","method_name":"D4PG"},{"method_slug":"n-step-returns","method_name":"N-step Returns"},{"method_slug":"prioritized-experience-replay","method_name":"Prioritized Experience Replay"}],"datasets_introduced":[],"methods_introduced":[{"slug":"d4pg","name":"D4PG","full_name":"Distributed Distributional DDPG"}],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1804.08617","atlas_url":"https://app.syntology.ai/?focus=1804.08617","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":"1804.08617"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1804.08617\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1804.08617"},"call":"get_concepts_for_paper(arxiv_id=\"1804.08617\")"}],"by_repo":[{"repo":"schatty/D4PG-pytorch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"vgudapati/DRLND_Collaboration_Competetion","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"zhou-henry/distributed-distributional-drq","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2107.09645"],"harvested_for_calls":[{"arxiv_id":"2107.09645","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2107.09645"},"call":"get_harvested_code_for_paper(arxiv_id=\"2107.09645\")"}]},{"repo":"HzcIrving/DLRL-PlayGround","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["1812.02900","2006.09359"],"harvested_for_calls":[{"arxiv_id":"1812.02900","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1812.02900"},"call":"get_harvested_code_for_paper(arxiv_id=\"1812.02900\")"},{"arxiv_id":"2006.09359","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.09359"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.09359\")"}]},{"repo":"opendilab/DI-engine","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":4,"harvested_for":["1707.01495","1901.02860","2106.01345","2304.12824"],"harvested_for_calls":[{"arxiv_id":"1707.01495","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1707.01495"},"call":"get_harvested_code_for_paper(arxiv_id=\"1707.01495\")"},{"arxiv_id":"1901.02860","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1901.02860"},"call":"get_harvested_code_for_paper(arxiv_id=\"1901.02860\")"},{"arxiv_id":"2106.01345","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.01345"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.01345\")"},{"arxiv_id":"2304.12824","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2304.12824"},"call":"get_harvested_code_for_paper(arxiv_id=\"2304.12824\")"}]}],"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":"942d8ddf60478074d5ec274f61e6def627121ceb5324889732b6dcb199dadeb4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}