{"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/back-to-basics-benchmarking-canonical","title":"Back to Basics: Benchmarking Canonical Evolution Strategies for Playing Atari","arxiv_id":"1802.08842","date":"2018-02-24","proceeding":null,"authors":["Patryk Chrabaszcz","Ilya Loshchilov","Frank Hutter"],"abstract":"Evolution Strategies (ES) have recently been demonstrated to be a viable\nalternative to reinforcement learning (RL) algorithms on a set of challenging\ndeep RL problems, including Atari games and MuJoCo humanoid locomotion\nbenchmarks. While the ES algorithms in that work belonged to the specialized\nclass of natural evolution strategies (which resemble approximate gradient RL\nalgorithms, such as REINFORCE), we demonstrate that even a very basic canonical\nES algorithm can achieve the same or even better performance. This success of a\nbasic ES algorithm suggests that the state-of-the-art can be advanced further\nby integrating the many advances made in the field of ES in the last decades.\n  We also demonstrate qualitatively that ES algorithms have very different\nperformance characteristics than traditional RL algorithms: on some games, they\nlearn to exploit the environment and perform much better while on others they\ncan get stuck in suboptimal local minima. Combining their strengths with those\nof traditional RL algorithms is therefore likely to lead to new advances in the\nstate of the art.","url_abs":"http://arxiv.org/abs/1802.08842v1","url_pdf":"http://arxiv.org/pdf/1802.08842v1.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":"back-to-basics-benchmarking-canonical","repo_url":"https://github.com/PatrykChrabaszcz/Canonical_ES_Atari","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}}],"tasks":[{"task_slug":"atari-games","task_name":"Atari Games"},{"task_slug":"benchmarking","task_name":"Benchmarking"},{"task_slug":"mujoco","task_name":"MuJoCo"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1802.08842","atlas_url":"https://app.syntology.ai/?focus=1802.08842","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":"1802.08842"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1802.08842\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1802.08842"},"call":"get_concepts_for_paper(arxiv_id=\"1802.08842\")"}],"by_repo":[{"repo":"PatrykChrabaszcz/Canonical_ES_Atari","kind":"official","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":"a60046aabb65827f1db87faab9b997a2c1b83ff28177d222ccf1f05dadc44eef","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}