{"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-deep-reinforcement-learning-learn","title":"Distributed Deep Reinforcement Learning: Learn how to play Atari games in 21 minutes","arxiv_id":"1801.02852","date":"2018-01-09","proceeding":null,"authors":["Igor Adamski","Robert Adamski","Tomasz Grel","Adam Jędrych","Kamil Kaczmarek","Henryk Michalewski"],"abstract":"We present a study in Distributed Deep Reinforcement Learning (DDRL) focused\non scalability of a state-of-the-art Deep Reinforcement Learning algorithm\nknown as Batch Asynchronous Advantage ActorCritic (BA3C). We show that using\nthe Adam optimization algorithm with a batch size of up to 2048 is a viable\nchoice for carrying out large scale machine learning computations. This,\ncombined with careful reexamination of the optimizer's hyperparameters, using\nsynchronous training on the node level (while keeping the local, single node\npart of the algorithm asynchronous) and minimizing the memory footprint of the\nmodel, allowed us to achieve linear scaling for up to 64 CPU nodes. This\ncorresponds to a training time of 21 minutes on 768 CPU cores, as opposed to 10\nhours when using a single node with 24 cores achieved by a baseline single-node\nimplementation.","url_abs":"http://arxiv.org/abs/1801.02852v2","url_pdf":"http://arxiv.org/pdf/1801.02852v2.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-deep-reinforcement-learning-learn","repo_url":"https://github.com/deepsense-ai/Distributed-BA3C","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"atari-games","task_name":"Atari Games"},{"task_slug":null,"task_name":"CPU"},{"task_slug":"deep-reinforcement-learning","task_name":"Deep Reinforcement Learning"},{"task_slug":"2048","task_name":"Playing the Game of 2048"},{"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":"adam","method_name":"Adam"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/atari-games-on-atari-2600-beam-rider","task":"Atari Games","dataset":"Atari 2600 Beam Rider","model":"DDRL A3C","rank_in_archive_order":24,"of":49,"metrics":{"Score":"14900"},"uses_additional_data":false},{"leaderboard":"/sota/atari-games-on-atari-2600-boxing","task":"Atari Games","dataset":"Atari 2600 Boxing","model":"DDRL A3C","rank_in_archive_order":21,"of":45,"metrics":{"Score":"98"},"uses_additional_data":false},{"leaderboard":"/sota/atari-games-on-atari-2600-breakout","task":"Atari Games","dataset":"Atari 2600 Breakout","model":"DDRL A3C","rank_in_archive_order":36,"of":58,"metrics":{"Score":"350"},"uses_additional_data":false},{"leaderboard":"/sota/atari-games-on-atari-2600-pong","task":"Atari Games","dataset":"Atari 2600 Pong","model":"DDRL A3C","rank_in_archive_order":28,"of":52,"metrics":{"Score":"20"},"uses_additional_data":false},{"leaderboard":"/sota/atari-games-on-atari-2600-seaquest","task":"Atari Games","dataset":"Atari 2600 Seaquest","model":"DDRL A3C","rank_in_archive_order":39,"of":57,"metrics":{"Score":"1832"},"uses_additional_data":false},{"leaderboard":"/sota/atari-games-on-atari-2600-space-invaders","task":"Atari Games","dataset":"Atari 2600 Space Invaders","model":"DDRL A3C","rank_in_archive_order":49,"of":55,"metrics":{"Score":"650"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1801.02852","atlas_url":"https://app.syntology.ai/?focus=1801.02852","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":"1801.02852"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1801.02852\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1801.02852"},"call":"get_concepts_for_paper(arxiv_id=\"1801.02852\")"}],"by_repo":[{"repo":"deepsense-ai/Distributed-BA3C","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1602.01783"],"harvested_for_calls":[{"arxiv_id":"1602.01783","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1602.01783"},"call":"get_harvested_code_for_paper(arxiv_id=\"1602.01783\")"}]}],"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":"fca404998562d225ebd7f666eb2cf2ce2458dd54c72827bef586dad02e50c31b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}