{"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/thinking-fast-and-slow-with-deep-learning-and","title":"Thinking Fast and Slow with Deep Learning and Tree Search","arxiv_id":"1705.08439","date":"2017-05-23","proceeding":"NeurIPS 2017 12","authors":["Thomas Anthony","Zheng Tian","David Barber"],"abstract":"Sequential decision making problems, such as structured prediction, robotic\ncontrol, and game playing, require a combination of planning policies and\ngeneralisation of those plans. In this paper, we present Expert Iteration\n(ExIt), a novel reinforcement learning algorithm which decomposes the problem\ninto separate planning and generalisation tasks. Planning new policies is\nperformed by tree search, while a deep neural network generalises those plans.\nSubsequently, tree search is improved by using the neural network policy to\nguide search, increasing the strength of new plans. In contrast, standard deep\nReinforcement Learning algorithms rely on a neural network not only to\ngeneralise plans, but to discover them too. We show that ExIt outperforms\nREINFORCE for training a neural network to play the board game Hex, and our\nfinal tree search agent, trained tabula rasa, defeats MoHex 1.0, the most\nrecent Olympiad Champion player to be publicly released.","url_abs":"http://arxiv.org/abs/1705.08439v4","url_pdf":"http://arxiv.org/pdf/1705.08439v4.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":"thinking-fast-and-slow-with-deep-learning-and","repo_url":"https://github.com/coreylowman/ragz","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"thinking-fast-and-slow-with-deep-learning-and","repo_url":"https://github.com/coreylowman/synthesis","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"thinking-fast-and-slow-with-deep-learning-and","repo_url":"https://github.com/evangravelle/AI-projects","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"thinking-fast-and-slow-with-deep-learning-and","repo_url":"https://github.com/richemslie/galvanise_zero","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"decision-making","task_name":"Decision Making"},{"task_slug":"deep-learning","task_name":"Deep Learning"},{"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":"sequential-decision-making","task_name":"Sequential Decision Making"},{"task_slug":"structured-prediction","task_name":"Structured Prediction"},{"task_slug":"reinforcement-learning-2","task_name":"reinforcement-learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1705.08439","atlas_url":"https://app.syntology.ai/?focus=1705.08439","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":"1705.08439"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1705.08439\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1705.08439"},"call":"get_concepts_for_paper(arxiv_id=\"1705.08439\")"}],"by_repo":[{"repo":"coreylowman/ragz","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"coreylowman/synthesis","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"evangravelle/AI-projects","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"richemslie/galvanise_zero","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":"5c656dfb7256c059e8f2465ba73b9d49a59851d3cddcb095eb9e4c382e43b68c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}