{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/active-exploration-for-inverse-reinforcement","title":"Active Exploration for Inverse Reinforcement Learning","arxiv_id":"2207.08645","date":"2022-07-18","proceeding":null,"authors":["David Lindner","Andreas Krause","Giorgia Ramponi"],"abstract":"Inverse Reinforcement Learning (IRL) is a powerful paradigm for inferring a reward function from expert demonstrations. Many IRL algorithms require a known transition model and sometimes even a known expert policy, or they at least require access to a generative model. However, these assumptions are too strong for many real-world applications, where the environment can be accessed only through sequential interaction. We propose a novel IRL algorithm: Active exploration for Inverse Reinforcement Learning (AceIRL), which actively explores an unknown environment and expert policy to quickly learn the expert's reward function and identify a good policy. AceIRL uses previous observations to construct confidence intervals that capture plausible reward functions and find exploration policies that focus on the most informative regions of the environment. AceIRL is the first approach to active IRL with sample-complexity bounds that does not require a generative model of the environment. AceIRL matches the sample complexity of active IRL with a generative model in the worst case. Additionally, we establish a problem-dependent bound that relates the sample complexity of AceIRL to the suboptimality gap of a given IRL problem. We empirically evaluate AceIRL in simulations and find that it significantly outperforms more naive exploration strategies.","url_abs":"https://arxiv.org/abs/2207.08645v4","url_pdf":"https://arxiv.org/pdf/2207.08645v4.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":"active-exploration-for-inverse-reinforcement","repo_url":"https://github.com/lasgroup/aceirl","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"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":{"atlas_url":"https://app.syntology.ai/?focus=2207.08645","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.08645"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"deterministic:regex_extraction","url":"https://github.com/lasgroup/aceirl","reach":null}],"summary":{"ran":3,"ran_fixture":6,"ran_draft_wrong":1,"unverified":1},"by_repo_kind":{"official":{"samples":11,"ran":10,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"0522ffc045f31a88","entry":"MDP","repo":"lasgroup/aceirl","repo_kind":"official","path":"src/active_irl/aceirl/algorithm.py","file_url":"https://github.com/lasgroup/aceirl/blob/HEAD/src/active_irl/aceirl/algorithm.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"0522ffc045f31a88"}},{"code_sha256_prefix":"adacd2e6a6786757","entry":"MaximumEntropyIRL","repo":"lasgroup/aceirl","repo_kind":"official","path":"src/active_irl/aceirl/algorithm.py","file_url":"https://github.com/lasgroup/aceirl/blob/HEAD/src/active_irl/aceirl/algorithm.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"adacd2e6a6786757"}},{"code_sha256_prefix":"f86e4d591b2e9ab0","entry":"Optimizer","repo":"lasgroup/aceirl","repo_kind":"official","path":"src/active_irl/aceirl/algorithm.py","file_url":"https://github.com/lasgroup/aceirl/blob/HEAD/src/active_irl/aceirl/algorithm.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"f86e4d591b2e9ab0"}},{"code_sha256_prefix":"fe5bfbf984382770","entry":"check_transitions_rewards","repo":"lasgroup/aceirl","repo_kind":"official","path":"src/active_irl/aceirl/algorithm.py","file_url":"https://github.com/lasgroup/aceirl/blob/HEAD/src/active_irl/aceirl/algorithm.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"fe5bfbf984382770"}},{"code_sha256_prefix":"98ecc07fcf64ca4a","entry":"ensure_policy_stochastic","repo":"lasgroup/aceirl","repo_kind":"official","path":"src/active_irl/aceirl/algorithm.py","file_url":"https://github.com/lasgroup/aceirl/blob/HEAD/src/active_irl/aceirl/algorithm.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"98ecc07fcf64ca4a"}},{"code_sha256_prefix":"7facf02a555704ba","entry":"fixed_n_rounding","repo":"lasgroup/aceirl","repo_kind":"official","path":"src/active_irl/aceirl/algorithm.py","file_url":"https://github.com/lasgroup/aceirl/blob/HEAD/src/active_irl/aceirl/algorithm.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"7facf02a555704ba"}},{"code_sha256_prefix":"bccca2ca0688106a","entry":"get_hoeffding_ci","repo":"lasgroup/aceirl","repo_kind":"official","path":"src/active_irl/aceirl/algorithm.py","file_url":"https://github.com/lasgroup/aceirl/blob/HEAD/src/active_irl/aceirl/algorithm.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"bccca2ca0688106a"}},{"code_sha256_prefix":"2a38774ec59331df","entry":"policy_evaluation","repo":"lasgroup/aceirl","repo_kind":"official","path":"src/active_irl/aceirl/algorithm.py","file_url":"https://github.com/lasgroup/aceirl/blob/HEAD/src/active_irl/aceirl/algorithm.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"2a38774ec59331df"}},{"code_sha256_prefix":"b5db74785a2b476f","entry":"random_argmax","repo":"lasgroup/aceirl","repo_kind":"official","path":"src/active_irl/aceirl/algorithm.py","file_url":"https://github.com/lasgroup/aceirl/blob/HEAD/src/active_irl/aceirl/algorithm.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"b5db74785a2b476f"}},{"code_sha256_prefix":"09b98208eac525f2","entry":"value_iteration","repo":"lasgroup/aceirl","repo_kind":"official","path":"src/active_irl/aceirl/algorithm.py","file_url":"https://github.com/lasgroup/aceirl/blob/HEAD/src/active_irl/aceirl/algorithm.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"09b98208eac525f2"}},{"code_sha256_prefix":"3e1682770c3f8812","entry":"ActiveIRL","repo":"lasgroup/aceirl","repo_kind":"official","path":"src/active_irl/aceirl/algorithm.py","file_url":"https://github.com/lasgroup/aceirl/blob/HEAD/src/active_irl/aceirl/algorithm.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"3e1682770c3f8812"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}