{"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/verifiable-reinforcement-learning-via-policy","title":"Verifiable Reinforcement Learning via Policy Extraction","arxiv_id":"1805.08328","date":"2018-05-22","proceeding":"NeurIPS 2018 12","authors":["Osbert Bastani","Yewen Pu","Armando Solar-Lezama"],"abstract":"While deep reinforcement learning has successfully solved many challenging\ncontrol tasks, its real-world applicability has been limited by the inability\nto ensure the safety of learned policies. We propose an approach to verifiable\nreinforcement learning by training decision tree policies, which can represent\ncomplex policies (since they are nonparametric), yet can be efficiently\nverified using existing techniques (since they are highly structured). The\nchallenge is that decision tree policies are difficult to train. We propose\nVIPER, an algorithm that combines ideas from model compression and imitation\nlearning to learn decision tree policies guided by a DNN policy (called the\noracle) and its Q-function, and show that it substantially outperforms two\nbaselines. We use VIPER to (i) learn a provably robust decision tree policy for\na variant of Atari Pong with a symbolic state space, (ii) learn a decision tree\npolicy for a toy game based on Pong that provably never loses, and (iii) learn\na provably stable decision tree policy for cart-pole. In each case, the\ndecision tree policy achieves performance equal to that of the original DNN\npolicy.","url_abs":"http://arxiv.org/abs/1805.08328v2","url_pdf":"http://arxiv.org/pdf/1805.08328v2.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":"verifiable-reinforcement-learning-via-policy","repo_url":"https://github.com/quantumiracle/Cascading-Decision-Tree","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"verifiable-reinforcement-learning-via-policy","repo_url":"https://github.com/safe-rl-team/viper-verifiable-rl-impl","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"deep-reinforcement-learning","task_name":"Deep Reinforcement Learning"},{"task_slug":"imitation-learning","task_name":"Imitation Learning"},{"task_slug":"model-compression","task_name":"Model Compression"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"reinforcement-learning-2","task_name":"reinforcement-learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1805.08328","atlas_url":"https://app.syntology.ai/?focus=1805.08328","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":"1805.08328"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1805.08328\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1805.08328"},"call":"get_concepts_for_paper(arxiv_id=\"1805.08328\")"}],"by_repo":[{"repo":"quantumiracle/Cascading-Decision-Tree","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"safe-rl-team/viper-verifiable-rl-impl","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":"e8fa0aac7260e82e18b27d4076c42320b1e60f45b09104403d77a2afb91c4a8f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}