{"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/asking-easy-questions-a-user-friendly","title":"Asking Easy Questions: A User-Friendly Approach to Active Reward Learning","arxiv_id":"1910.04365","date":"2019-10-10","proceeding":null,"authors":["Erdem Biyik","Malayandi Palan","Nicholas C. Landolfi","Dylan P. Losey","Dorsa Sadigh"],"abstract":"Robots can learn the right reward function by querying a human expert. Existing approaches attempt to choose questions where the robot is most uncertain about the human's response; however, they do not consider how easy it will be for the human to answer! In this paper we explore an information gain formulation for optimally selecting questions that naturally account for the human's ability to answer. Our approach identifies questions that optimize the trade-off between robot and human uncertainty, and determines when these questions become redundant or costly. Simulations and a user study show our method not only produces easy questions, but also ultimately results in faster reward learning.","url_abs":"https://arxiv.org/abs/1910.04365v1","url_pdf":"https://arxiv.org/pdf/1910.04365v1.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":"asking-easy-questions-a-user-friendly","repo_url":"https://github.com/Stanford-ILIAD/easy-active-learning","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"asking-easy-questions-a-user-friendly","repo_url":"https://github.com/Stanford-ILIAD/APReL","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1910.04365","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.04365"}},"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":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Stanford-ILIAD/easy-active-learning","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Stanford-ILIAD/APReL","reach":null}],"summary":{"ran_honours":1,"ran_draft_wrong":1,"ran_fixture":2,"unverified":3},"by_repo_kind":{"official":{"samples":6,"ran":3,"repositories":1},"listed":{"samples":1,"ran":1,"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":"65e75b79a6e091fa","entry":"feature_func","repo":"Stanford-ILIAD/APReL","repo_kind":"listed","path":"examples/simple.py","file_url":"https://github.com/Stanford-ILIAD/APReL/blob/HEAD/examples/simple.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"65e75b79a6e091fa"}},{"code_sha256_prefix":"8c46d08023023f82","entry":"generate_psi","repo":"Stanford-ILIAD/easy-active-learning","repo_kind":"official","path":"algos.py","file_url":"https://github.com/Stanford-ILIAD/easy-active-learning/blob/HEAD/algos.py","link_basis":"plan_row","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"8c46d08023023f82"}},{"code_sha256_prefix":"7211ac6cf9bb9e60","entry":"information_objective_psi","repo":"Stanford-ILIAD/easy-active-learning","repo_kind":"official","path":"algos.py","file_url":"https://github.com/Stanford-ILIAD/easy-active-learning/blob/HEAD/algos.py","link_basis":"plan_row","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"7211ac6cf9bb9e60"}},{"code_sha256_prefix":"c63e702a58807835","entry":"volume_objective_psi","repo":"Stanford-ILIAD/easy-active-learning","repo_kind":"official","path":"algos.py","file_url":"https://github.com/Stanford-ILIAD/easy-active-learning/blob/HEAD/algos.py","link_basis":"plan_row","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"c63e702a58807835"}},{"code_sha256_prefix":"7b31c8b445431412","entry":"feature","repo":"Stanford-ILIAD/easy-active-learning","repo_kind":"official","path":"feature.py","file_url":"https://github.com/Stanford-ILIAD/easy-active-learning/blob/HEAD/feature.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":"7b31c8b445431412"}},{"code_sha256_prefix":"355e0f4248993f2b","entry":"get_feedback","repo":"Stanford-ILIAD/easy-active-learning","repo_kind":"official","path":"simulation_utils.py","file_url":"https://github.com/Stanford-ILIAD/easy-active-learning/blob/HEAD/simulation_utils.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":"355e0f4248993f2b"}},{"code_sha256_prefix":"bbfd88d6d34e2002","entry":"speed","repo":"Stanford-ILIAD/easy-active-learning","repo_kind":"official","path":"feature.py","file_url":"https://github.com/Stanford-ILIAD/easy-active-learning/blob/HEAD/feature.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":"bbfd88d6d34e2002"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}