{"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/multi-pass-q-networks-for-deep-reinforcement","title":"Multi-Pass Q-Networks for Deep Reinforcement Learning with Parameterised Action Spaces","arxiv_id":"1905.04388","date":"2019-05-10","proceeding":null,"authors":["Craig J. Bester","Steven D. James","George D. Konidaris"],"abstract":"Parameterised actions in reinforcement learning are composed of discrete actions with continuous action-parameters. This provides a framework for solving complex domains that require combining high-level actions with flexible control. The recent P-DQN algorithm extends deep Q-networks to learn over such action spaces. However, it treats all action-parameters as a single joint input to the Q-network, invalidating its theoretical foundations. We analyse the issues with this approach and propose a novel method, multi-pass deep Q-networks, or MP-DQN, to address them. We empirically demonstrate that MP-DQN significantly outperforms P-DQN and other previous algorithms in terms of data efficiency and converged policy performance on the Platform, Robot Soccer Goal, and Half Field Offense domains.","url_abs":"https://arxiv.org/abs/1905.04388v1","url_pdf":"https://arxiv.org/pdf/1905.04388v1.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":"multi-pass-q-networks-for-deep-reinforcement","repo_url":"https://github.com/cycraig/MP-DQN","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"multi-pass-q-networks-for-deep-reinforcement","repo_url":"https://github.com/cycraig/gym-goal","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"multi-pass-q-networks-for-deep-reinforcement","repo_url":"https://github.com/cycraig/gym-platform","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"multi-pass-q-networks-for-deep-reinforcement","repo_url":"https://github.com/opendilab/DI-engine/blob/main/ding/policy/pdqn.py","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"control-with-prametrised-actions","task_name":"Control with Prametrised Actions"},{"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":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/control-with-prametrised-actions-on-half","task":"Control with Prametrised Actions","dataset":"Half Field Offence","model":"MP-DQN","rank_in_archive_order":1,"of":2,"metrics":{"Goal Probability":"0.913"},"uses_additional_data":false},{"leaderboard":"/sota/control-with-prametrised-actions-on-platform","task":"Control with Prametrised Actions","dataset":"Platform","model":"MP-DQN","rank_in_archive_order":1,"of":2,"metrics":{"Return":"0.987"},"uses_additional_data":false},{"leaderboard":"/sota/control-with-prametrised-actions-on-robot","task":"Control with Prametrised Actions","dataset":"Robot Soccer Goal","model":"MP-DQN","rank_in_archive_order":1,"of":2,"metrics":{"Goal Probability":"0.789"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1905.04388","atlas_url":"https://app.syntology.ai/?focus=1905.04388","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":"1905.04388"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1905.04388\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1905.04388"},"call":"get_concepts_for_paper(arxiv_id=\"1905.04388\")"}],"by_repo":[{"repo":"cycraig/MP-DQN","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":4,"harvested_for":["1509.01644","1511.04143","1810.06394","2109.05490"],"harvested_for_calls":[{"arxiv_id":"1509.01644","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1509.01644"},"call":"get_harvested_code_for_paper(arxiv_id=\"1509.01644\")"},{"arxiv_id":"1511.04143","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1511.04143"},"call":"get_harvested_code_for_paper(arxiv_id=\"1511.04143\")"},{"arxiv_id":"1810.06394","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1810.06394"},"call":"get_harvested_code_for_paper(arxiv_id=\"1810.06394\")"},{"arxiv_id":"2109.05490","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2109.05490"},"call":"get_harvested_code_for_paper(arxiv_id=\"2109.05490\")"}]},{"repo":"cycraig/gym-goal","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1509.01644"],"harvested_for_calls":[{"arxiv_id":"1509.01644","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1509.01644"},"call":"get_harvested_code_for_paper(arxiv_id=\"1509.01644\")"}]},{"repo":"cycraig/gym-platform","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"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":"23d924ffe957f6912af06bb2a1c9d3213729f10e70eee960c346a86766bbe47b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}