{"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/relative-entropy-regularized-policy-iteration","title":"Relative Entropy Regularized Policy Iteration","arxiv_id":"1812.02256","date":"2018-12-05","proceeding":null,"authors":["Abbas Abdolmaleki","Jost Tobias Springenberg","Jonas Degrave","Steven Bohez","Yuval Tassa","Dan Belov","Nicolas Heess","Martin Riedmiller"],"abstract":"We present an off-policy actor-critic algorithm for Reinforcement Learning\n(RL) that combines ideas from gradient-free optimization via stochastic search\nwith learned action-value function. The result is a simple procedure consisting\nof three steps: i) policy evaluation by estimating a parametric action-value\nfunction; ii) policy improvement via the estimation of a local non-parametric\npolicy; and iii) generalization by fitting a parametric policy. Each step can\nbe implemented in different ways, giving rise to several algorithm variants.\nOur algorithm draws on connections to existing literature on black-box\noptimization and 'RL as an inference' and it can be seen either as an extension\nof the Maximum a Posteriori Policy Optimisation algorithm (MPO) [Abdolmaleki et\nal., 2018a], or as an extension of Trust Region Covariance Matrix Adaptation\nEvolutionary Strategy (CMA-ES) [Abdolmaleki et al., 2017b; Hansen et al., 1997]\nto a policy iteration scheme. Our comparison on 31 continuous control tasks\nfrom parkour suite [Heess et al., 2017], DeepMind control suite [Tassa et al.,\n2018] and OpenAI Gym [Brockman et al., 2016] with diverse properties, limited\namount of compute and a single set of hyperparameters, demonstrate the\neffectiveness of our method and the state of art results. Videos, summarizing\nresults, can be found at goo.gl/HtvJKR .","url_abs":"http://arxiv.org/abs/1812.02256v1","url_pdf":"http://arxiv.org/pdf/1812.02256v1.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":"relative-entropy-regularized-policy-iteration","repo_url":"https://github.com/acyclics/MPO","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"continuous-control","task_name":"Continuous Control"},{"task_slug":"openai-gym","task_name":"OpenAI Gym"},{"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":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1812.02256","atlas_url":"https://app.syntology.ai/?focus=1812.02256","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":"1812.02256"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1812.02256\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1812.02256"},"call":"get_concepts_for_paper(arxiv_id=\"1812.02256\")"}],"by_repo":[{"repo":"acyclics/MPO","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"f921f6695508c5766bd8dcb187834d72aa56f6ad311ac7545b5ac9da48b880fc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}