{"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/learning-and-planning-in-complex-action","title":"Learning and Planning in Complex Action Spaces","arxiv_id":"2104.06303","date":"2021-04-13","proceeding":null,"authors":["Thomas Hubert","Julian Schrittwieser","Ioannis Antonoglou","Mohammadamin Barekatain","Simon Schmitt","David Silver"],"abstract":"Many important real-world problems have action spaces that are high-dimensional, continuous or both, making full enumeration of all possible actions infeasible. Instead, only small subsets of actions can be sampled for the purpose of policy evaluation and improvement. In this paper, we propose a general framework to reason in a principled way about policy evaluation and improvement over such sampled action subsets. This sample-based policy iteration framework can in principle be applied to any reinforcement learning algorithm based upon policy iteration. Concretely, we propose Sampled MuZero, an extension of the MuZero algorithm that is able to learn in domains with arbitrarily complex action spaces by planning over sampled actions. We demonstrate this approach on the classical board game of Go and on two continuous control benchmark domains: DeepMind Control Suite and Real-World RL Suite.","url_abs":"https://arxiv.org/abs/2104.06303v1","url_pdf":"https://arxiv.org/pdf/2104.06303v1.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":"learning-and-planning-in-complex-action","repo_url":"https://github.com/opendilab/LightZero","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"continuous-control","task_name":"Continuous Control"},{"task_slug":"game-of-go","task_name":"Game of Go"},{"task_slug":"continuous-control","task_name":"continuous-control"}],"methods":[{"method_slug":"average-pooling","method_name":"Average Pooling"},{"method_slug":"batch-normalization","method_name":"Batch Normalization"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"monte-carlo-tree-search","method_name":"Monte-Carlo Tree Search"},{"method_slug":"muzero","method_name":"MuZero"},{"method_slug":"prioritized-experience-replay","method_name":"Prioritized Experience Replay"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"residual-block","method_name":"Residual Block"},{"method_slug":"residual-connection","method_name":"Residual Connection"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/continuous-control-on-acrobot-swingup","task":"Continuous Control","dataset":"acrobot.swingup","model":"SMuZero","rank_in_archive_order":1,"of":1,"metrics":{"Return":"417.52"},"uses_additional_data":false},{"leaderboard":"/sota/continuous-control-on-ball-in-cup-catch-2","task":"Continuous Control","dataset":"ball_in_cup.catch","model":"SMuZero","rank_in_archive_order":1,"of":1,"metrics":{"Return":"977.38"},"uses_additional_data":false},{"leaderboard":"/sota/continuous-control-on-cartpole-balance","task":"Continuous Control","dataset":"cartpole.balance","model":"SMuZero","rank_in_archive_order":1,"of":1,"metrics":{"Return":"984.86"},"uses_additional_data":false},{"leaderboard":"/sota/continuous-control-on-cartpole-balance-sparse","task":"Continuous Control","dataset":"cartpole.balance_sparse","model":"SMuZero","rank_in_archive_order":1,"of":2,"metrics":{"Return":"998.14"},"uses_additional_data":false},{"leaderboard":"/sota/continuous-control-on-cartpole-swingup-2","task":"Continuous Control","dataset":"cartpole.swingup","model":"SMuZero","rank_in_archive_order":1,"of":2,"metrics":{"Return":"868.87"},"uses_additional_data":false},{"leaderboard":"/sota/continuous-control-on-cartpole-swingup-sparse","task":"Continuous Control","dataset":"cartpole.swingup_sparse","model":"SMuZero","rank_in_archive_order":1,"of":1,"metrics":{"Return":"846.91"},"uses_additional_data":false},{"leaderboard":"/sota/continuous-control-on-cheetah-run-2","task":"Continuous Control","dataset":"cheetah.run","model":"SMuZero","rank_in_archive_order":1,"of":2,"metrics":{"Return":"914.39"},"uses_additional_data":false},{"leaderboard":"/sota/continuous-control-on-finger-spin-2","task":"Continuous Control","dataset":"finger.spin","model":"SMuZero","rank_in_archive_order":1,"of":1,"metrics":{"Return":"986.38"},"uses_additional_data":false},{"leaderboard":"/sota/continuous-control-on-finger-turn-easy","task":"Continuous Control","dataset":"finger.turn_easy","model":"SMuZero","rank_in_archive_order":1,"of":1,"metrics":{"Return":"972.53"},"uses_additional_data":false},{"leaderboard":"/sota/continuous-control-on-finger-turn-hard","task":"Continuous Control","dataset":"finger.turn_hard","model":"SMuZero","rank_in_archive_order":1,"of":2,"metrics":{"Return":"963.07"},"uses_additional_data":false},{"leaderboard":"/sota/continuous-control-on-hopper-hop","task":"Continuous Control","dataset":"hopper.hop","model":"SMuZero","rank_in_archive_order":1,"of":1,"metrics":{"Return":"528.24"},"uses_additional_data":false},{"leaderboard":"/sota/continuous-control-on-hopper-stand","task":"Continuous Control","dataset":"hopper.stand","model":"SMuZero","rank_in_archive_order":1,"of":1,"metrics":{"Return":"926.5"},"uses_additional_data":false},{"leaderboard":"/sota/continuous-control-on-pendulum-swingup","task":"Continuous Control","dataset":"pendulum.swingup","model":"SMuZero","rank_in_archive_order":1,"of":1,"metrics":{"Return":"837.76"},"uses_additional_data":false},{"leaderboard":"/sota/continuous-control-on-quadruped-run","task":"Continuous Control","dataset":"quadruped.run","model":"SMuZero","rank_in_archive_order":1,"of":1,"metrics":{"Return":"923.54"},"uses_additional_data":false},{"leaderboard":"/sota/continuous-control-on-quadruped-walk","task":"Continuous Control","dataset":"quadruped.walk","model":"SMuZero","rank_in_archive_order":1,"of":1,"metrics":{"Return":"933.77"},"uses_additional_data":false},{"leaderboard":"/sota/continuous-control-on-reacher-easy-2","task":"Continuous Control","dataset":"reacher.easy","model":"SMuZero","rank_in_archive_order":1,"of":1,"metrics":{"Return":"982.26"},"uses_additional_data":false},{"leaderboard":"/sota/continuous-control-on-reacher-hard","task":"Continuous Control","dataset":"reacher.hard","model":"SMuZero","rank_in_archive_order":1,"of":1,"metrics":{"Return":"971.53"},"uses_additional_data":false},{"leaderboard":"/sota/continuous-control-on-walker-run","task":"Continuous Control","dataset":"walker.run","model":"SMuZero","rank_in_archive_order":1,"of":1,"metrics":{"Return":"931.06"},"uses_additional_data":false},{"leaderboard":"/sota/continuous-control-on-walker-stand","task":"Continuous Control","dataset":"walker.stand","model":"SMuZero","rank_in_archive_order":1,"of":2,"metrics":{"Return":"987.79"},"uses_additional_data":false},{"leaderboard":"/sota/continuous-control-on-walker-walk-2","task":"Continuous Control","dataset":"walker.walk","model":"SMuZero","rank_in_archive_order":1,"of":2,"metrics":{"Return":"975.46"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2104.06303","atlas_url":"https://app.syntology.ai/?focus=2104.06303","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":"2104.06303"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2104.06303\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2104.06303"},"call":"get_concepts_for_paper(arxiv_id=\"2104.06303\")"}],"by_repo":[{"repo":"opendilab/LightZero","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2509.07945"],"harvested_for_calls":[{"arxiv_id":"2509.07945","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2509.07945"},"call":"get_harvested_code_for_paper(arxiv_id=\"2509.07945\")"}]}],"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":"60dfccc1c4c5be70507cb5fa5e44ac676e9aca315cfa16f39c39490aced6c6a6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}