{"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/novelty-search-in-representational-space-for","title":"Novelty Search in Representational Space for Sample Efficient Exploration","arxiv_id":"2009.13579","date":"2020-09-28","proceeding":"NeurIPS 2020 12","authors":["Ruo Yu Tao","Vincent François-Lavet","Joelle Pineau"],"abstract":"We present a new approach for efficient exploration which leverages a low-dimensional encoding of the environment learned with a combination of model-based and model-free objectives. Our approach uses intrinsic rewards that are based on the distance of nearest neighbors in the low dimensional representational space to gauge novelty. We then leverage these intrinsic rewards for sample-efficient exploration with planning routines in representational space for hard exploration tasks with sparse rewards. One key element of our approach is the use of information theoretic principles to shape our representations in a way so that our novelty reward goes beyond pixel similarity. We test our approach on a number of maze tasks, as well as a control problem and show that our exploration approach is more sample-efficient compared to strong baselines.","url_abs":"https://arxiv.org/abs/2009.13579v3","url_pdf":"https://arxiv.org/pdf/2009.13579v3.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":"novelty-search-in-representational-space-for","repo_url":"https://github.com/taodav/nsrs","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"efficient-exploration","task_name":"Efficient Exploration"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2009.13579","atlas_url":"https://app.syntology.ai/?focus=2009.13579","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.13579"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+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/taodav/nsrs","reach":null}],"summary":{"ran_draft_wrong":3},"by_repo_kind":{"official":{"samples":3,"ran":3,"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":"cf6acae38c9e50c2","entry":"exp_dec_error_pytorch","repo":"taodav/nsrs","repo_kind":"official","path":"nsrl/learning_algos/NSRS_pytorch.py","file_url":"https://github.com/taodav/nsrs/blob/HEAD/nsrl/learning_algos/NSRS_pytorch.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"cf6acae38c9e50c2"}},{"code_sha256_prefix":"95bf653972457526","entry":"exp_dec_error_pytorch_2","repo":"taodav/nsrs","repo_kind":"official","path":"nsrl/learning_algos/NSRS_pytorch.py","file_url":"https://github.com/taodav/nsrs/blob/HEAD/nsrl/learning_algos/NSRS_pytorch.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"95bf653972457526"}},{"code_sha256_prefix":"789a6111fa92576e","entry":"mean_squared_error_p_pytorch","repo":"taodav/nsrs","repo_kind":"official","path":"nsrl/learning_algos/NSRS_pytorch.py","file_url":"https://github.com/taodav/nsrs/blob/HEAD/nsrl/learning_algos/NSRS_pytorch.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"789a6111fa92576e"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}