{"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/novelty-search-for-deep-reinforcement","title":"Novelty Search for Deep Reinforcement Learning Policy Network Weights by Action Sequence Edit Metric Distance","arxiv_id":"1902.03142","date":"2019-02-08","proceeding":null,"authors":["Ethan C. Jackson","Mark Daley"],"abstract":"Reinforcement learning (RL) problems often feature deceptive local optima,\nand learning methods that optimize purely for reward signal often fail to learn\nstrategies for overcoming them. Deep neuroevolution and novelty search have\nbeen proposed as effective alternatives to gradient-based methods for learning\nRL policies directly from pixels. In this paper, we introduce and evaluate the\nuse of novelty search over agent action sequences by string edit metric\ndistance as a means for promoting innovation. We also introduce a method for\nstagnation detection and population resampling inspired by recent developments\nin the RL community that uses the same mechanisms as novelty search to promote\nand develop innovative policies. Our methods extend a state-of-the-art method\nfor deep neuroevolution using a simple-yet-effective genetic algorithm (GA)\ndesigned to efficiently learn deep RL policy network weights. Experiments using\nfour games from the Atari 2600 benchmark were conducted. Results provide\nfurther evidence that GAs are competitive with gradient-based algorithms for\ndeep RL. Results also demonstrate that novelty search over action sequences is\nan effective source of selection pressure that can be integrated into existing\nevolutionary algorithms for deep RL.","url_abs":"http://arxiv.org/abs/1902.03142v1","url_pdf":"http://arxiv.org/pdf/1902.03142v1.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-for-deep-reinforcement","repo_url":"https://github.com/ethancjackson/NoveltySearchLevenshtein","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"deep-reinforcement-learning","task_name":"Deep Reinforcement Learning"},{"task_slug":"evolutionary-algorithms","task_name":"Evolutionary Algorithms"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1902.03142","atlas_url":"https://app.syntology.ai/?focus=1902.03142","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":"1902.03142"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1902.03142\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1902.03142"},"call":"get_concepts_for_paper(arxiv_id=\"1902.03142\")"}],"by_repo":[{"repo":"ethancjackson/NoveltySearchLevenshtein","kind":"official","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":"c2cdc02a4555d9465b99685bbaae968a9f59f72cbc807c4c72ae0d4ef4eb73eb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}