{"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/quality-diversity-through-surprise","title":"Quality Diversity Through Surprise","arxiv_id":"1807.02397","date":"2018-07-06","proceeding":null,"authors":["Daniele Gravina","Antonios Liapis","Georgios N. Yannakakis"],"abstract":"Quality diversity is a recent family of evolutionary search algorithms which\nfocus on finding several well-performing (quality) yet different (diversity)\nsolutions with the aim to maintain an appropriate balance between divergence\nand convergence during search. While quality diversity has already delivered\npromising results in complex problems, the capacity of divergent search\nvariants for quality diversity remains largely unexplored. Inspired by the\nnotion of surprise as an effective driver of divergent search and its\northogonal nature to novelty this paper investigates the impact of the former\nto quality diversity performance. For that purpose we introduce three new\nquality diversity algorithms which employ surprise as a diversity measure,\neither on its own or combined with novelty, and compare their performance\nagainst novelty search with local competition, the state of the art quality\ndiversity algorithm. The algorithms are tested in a robot navigation task\nacross 60 highly deceptive mazes. Our findings suggest that allowing surprise\nand novelty to operate synergistically for divergence and in combination with\nlocal competition leads to quality diversity algorithms of significantly higher\nefficiency, speed and robustness.","url_abs":"http://arxiv.org/abs/1807.02397v4","url_pdf":"http://arxiv.org/pdf/1807.02397v4.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":"quality-diversity-through-surprise","repo_url":"https://gitlab.com/2factor/QDSurprise","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"diversity","task_name":"Diversity"},{"task_slug":"robot-navigation","task_name":"Robot Navigation"}],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"gitlab.com/2factor/QDSurprise","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":"0361cf331fa26aa66b3028102d86868670458d6b02f0004a77fc4b79f788a73c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}