{"url":"/sota/atari-games-on-atari-game","task":{"name":"Atari Games","url":"/task/atari-games","note":null},"dataset":{"name":"atari game","url":null},"category":"Playing Games","categories":["Playing Games"],"category_note":null,"description":"The Atari 2600 Games task (and dataset) involves training an agent to achieve high game scores.\r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [Playing Atari with Deep Reinforcement Learning](https://arxiv.org/pdf/1312.5602v1.pdf) )</span>","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["Human World Record Breakthrough"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Human World Record Breakthrough":null}},"counts":{"rows":9,"rows_with_code":7,"rows_with_paper_page":9,"rows_dated":9,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"GDI-H3","metrics":{"Human World Record Breakthrough":"22"},"uses_additional_data":false,"paper_date":"2022-06-07","paper":"/paper/generalized-data-distribution-iteration","paper_url":"https://arxiv.org/abs/2206.03192v4","paper_title":"Generalized Data Distribution Iteration","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":2,"model":"Muzero","metrics":{"Human World Record Breakthrough":"19"},"uses_additional_data":false,"paper_date":"2019-11-19","paper":"/paper/mastering-atari-go-chess-and-shogi-by","paper_url":"https://arxiv.org/abs/1911.08265v2","paper_title":"Mastering Atari, Go, Chess and Shogi by Planning with a Learned Model","code":"https://github.com/werner-duvaud/muzero-general","n_code_links":18,"syntology":{"n_ran":43,"n_unverified":21,"n_samples":64,"n_pointer_only_licence":62}},{"rank_in_archive_order":3,"model":"Agent57","metrics":{"Human World Record Breakthrough":"18"},"uses_additional_data":false,"paper_date":"2020-03-30","paper":"/paper/agent57-outperforming-the-atari-human","paper_url":"https://arxiv.org/abs/2003.13350v1","paper_title":"Agent57: Outperforming the Atari Human Benchmark","code":"https://github.com/michaelnny/deep_rl_zoo","n_code_links":5,"syntology":{"n_ran":0,"n_unverified":9,"n_samples":9,"n_pointer_only_licence":0}},{"rank_in_archive_order":4,"model":"Go-Explore","metrics":{"Human World Record Breakthrough":"17"},"uses_additional_data":false,"paper_date":"2019-01-30","paper":"/paper/go-explore-a-new-approach-for-hard","paper_url":"https://arxiv.org/abs/1901.10995v4","paper_title":"Go-Explore: a New Approach for Hard-Exploration Problems","code":"https://github.com/uber-research/go-explore","n_code_links":3,"syntology":{"n_ran":2,"n_unverified":2,"n_samples":4,"n_pointer_only_licence":4}},{"rank_in_archive_order":5,"model":"GDI-I3","metrics":{"Human World Record Breakthrough":"17"},"uses_additional_data":false,"paper_date":"2022-06-07","paper":"/paper/generalized-data-distribution-iteration","paper_url":"https://arxiv.org/abs/2206.03192v4","paper_title":"Generalized Data Distribution Iteration","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":6,"model":"R2D2","metrics":{"Human World Record Breakthrough":"15"},"uses_additional_data":false,"paper_date":"2019-05-01","paper":"/paper/recurrent-experience-replay-in-distributed","paper_url":"https://openreview.net/forum?id=r1lyTjAqYX","paper_title":"Recurrent Experience Replay in Distributed Reinforcement Learning","code":"https://github.com/opendilab/DI-engine/blob/main/ding/policy/r2d2.py","n_code_links":3,"syntology":null},{"rank_in_archive_order":7,"model":"NGU","metrics":{"Human World Record Breakthrough":"8"},"uses_additional_data":false,"paper_date":"2020-02-14","paper":"/paper/never-give-up-learning-directed-exploration-1","paper_url":"https://arxiv.org/abs/2002.06038v1","paper_title":"Never Give Up: Learning Directed Exploration Strategies","code":"https://github.com/opendilab/DI-engine","n_code_links":6,"syntology":{"n_ran":7,"n_unverified":7,"n_samples":14,"n_pointer_only_licence":0}},{"rank_in_archive_order":8,"model":"Muesli","metrics":{"Human World Record Breakthrough":"5"},"uses_additional_data":false,"paper_date":"2021-04-13","paper":"/paper/muesli-combining-improvements-in-policy","paper_url":"https://arxiv.org/abs/2104.06159v2","paper_title":"Muesli: Combining Improvements in Policy Optimization","code":"https://github.com/YuriCat/MuesliJupyterExample","n_code_links":2,"syntology":{"n_ran":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":9,"model":"Rainbow","metrics":{"Human World Record Breakthrough":"4"},"uses_additional_data":false,"paper_date":"2017-10-06","paper":"/paper/rainbow-combining-improvements-in-deep","paper_url":"http://arxiv.org/abs/1710.02298v1","paper_title":"Rainbow: Combining Improvements in Deep Reinforcement Learning","code":"https://github.com/thu-ml/tianshou","n_code_links":34,"syntology":{"n_ran":2,"n_unverified":4,"n_samples":6,"n_pointer_only_licence":1}}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,264 of the 9,581 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9581,"papers_checked":6264,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":3316},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":6,"rows_with_any_sample_ran":5,"distinct_papers_with_graph_line":6,"distinct_papers_with_any_sample_ran":5,"samples_over_distinct_papers":{"n_ran":57,"n_unverified":43,"n_samples":100,"n_pointer_only_licence":67,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":57,"n_unverified":43,"n_samples":100,"n_pointer_only_licence":67,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}