{"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/action-branching-architectures-for-deep","title":"Action Branching Architectures for Deep Reinforcement Learning","arxiv_id":"1711.08946","date":"2017-11-24","proceeding":null,"authors":["Arash Tavakoli","Fabio Pardo","Petar Kormushev"],"abstract":"Discrete-action algorithms have been central to numerous recent successes of\ndeep reinforcement learning. However, applying these algorithms to\nhigh-dimensional action tasks requires tackling the combinatorial increase of\nthe number of possible actions with the number of action dimensions. This\nproblem is further exacerbated for continuous-action tasks that require fine\ncontrol of actions via discretization. In this paper, we propose a novel neural\narchitecture featuring a shared decision module followed by several network\nbranches, one for each action dimension. This approach achieves a linear\nincrease of the number of network outputs with the number of degrees of freedom\nby allowing a level of independence for each individual action dimension. To\nillustrate the approach, we present a novel agent, called Branching Dueling\nQ-Network (BDQ), as a branching variant of the Dueling Double Deep Q-Network\n(Dueling DDQN). We evaluate the performance of our agent on a set of\nchallenging continuous control tasks. The empirical results show that the\nproposed agent scales gracefully to environments with increasing action\ndimensionality and indicate the significance of the shared decision module in\ncoordination of the distributed action branches. Furthermore, we show that the\nproposed agent performs competitively against a state-of-the-art continuous\ncontrol algorithm, Deep Deterministic Policy Gradient (DDPG).","url_abs":"http://arxiv.org/abs/1711.08946v2","url_pdf":"http://arxiv.org/pdf/1711.08946v2.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":"action-branching-architectures-for-deep","repo_url":"https://github.com/atavakol/action-branching-agents","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"action-branching-architectures-for-deep","repo_url":"https://github.com/BFAnas/BranchingDQN_keras","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"action-branching-architectures-for-deep","repo_url":"https://github.com/MoMe36/BranchingDQN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"action-branching-architectures-for-deep","repo_url":"https://github.com/atavakol/action-hypergraph-networks","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"action-branching-architectures-for-deep","repo_url":"https://github.com/bastienvanderplaetse/action-branching-dqn","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"continuous-control","task_name":"Continuous Control"},{"task_slug":"deep-reinforcement-learning","task_name":"Deep Reinforcement Learning"},{"task_slug":"general-reinforcement-learning","task_name":"General Reinforcement Learning"},{"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"},{"task_slug":"reinforcement-learning-2","task_name":"reinforcement-learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1711.08946","atlas_url":"https://app.syntology.ai/?focus=1711.08946","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":"1711.08946"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1711.08946\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1711.08946"},"call":"get_concepts_for_paper(arxiv_id=\"1711.08946\")"}],"by_repo":[{"repo":"atavakol/action-branching-agents","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1511.05952"],"harvested_for_calls":[{"arxiv_id":"1511.05952","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1511.05952"},"call":"get_harvested_code_for_paper(arxiv_id=\"1511.05952\")"}]},{"repo":"BFAnas/BranchingDQN_keras","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"MoMe36/BranchingDQN","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"atavakol/action-hypergraph-networks","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2010.14680"],"harvested_for_calls":[{"arxiv_id":"2010.14680","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2010.14680"},"call":"get_harvested_code_for_paper(arxiv_id=\"2010.14680\")"}]},{"repo":"bastienvanderplaetse/action-branching-dqn","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":"c0e1ca7e537361d8111fa1d40cc2b56c46c8b4f27c9277e5c14a0aa8c978b06d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}