@Article{Igel:2003:NC,
  author =       "Christian Igel and Marc Toussaint",
  title =        "Neutrality and Self-Adaptation",
  journal =      "Natural Computing",
  year =         "2003",
  volume =       "2",
  number =       "2",
  URL =          "http://ipsapp009.kluweronline.com/content/getfile/5030/5/1/abstract.htm",
  doi =          "doi:10.1023/A:1024906105255",
  pages =        "117--132",
  keywords =     "evolutionary computation, genotype-phenotype mapping,
                 neutrality, No-Free-Lunch theorem, redundancy,
                 self-adaptation, genetic programming",
  abstract =     "Neutral genotype-phenotype mappings can be observed in
                 natural evolution and are often used in evolutionary
                 computation. In this article, important aspects of such
                 encodings are analysed. First, it is shown that in the
                 absence of external control neutrality allows a
                 variation of the search distribution independent of
                 phenotypic changes. In particular, neutrality is
                 necessary for self-adaptation, which is used in a
                 variety of algorithms from all main paradigms of
                 evolutionary computation to increase efficiency.
                 Second, the average number of fitness evaluations
                 needed to find a desirable (e.g., optimally adapted)
                 genotype depending on the number of desirable genotypes
                 and the cardinality of the genotype space is derived.
                 It turns out that this number increases only marginally
                 when neutrality is added to an encoding presuming that
                 the fraction of desirable genotypes stays constant and
                 that the number of these genotypes is not too small.",
  notes =        "Article ID: 5126729",
}

{"_id":"PfKktHbqmKvABSohY","bibbaseid":"igel-toussaint-neutralityandselfadaptation-2003","downloads":0,"creationDate":"2018-10-05T11:34:49.561Z","title":"Neutrality and Self-Adaptation","author_short":["Igel, C.","Toussaint, M."],"year":2003,"bibtype":"article","biburl":"http://people.idsia.ch/~juergen/deep.bib","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Christian"],"propositions":[],"lastnames":["Igel"],"suffixes":[]},{"firstnames":["Marc"],"propositions":[],"lastnames":["Toussaint"],"suffixes":[]}],"title":"Neutrality and Self-Adaptation","journal":"Natural Computing","year":"2003","volume":"2","number":"2","url":"http://ipsapp009.kluweronline.com/content/getfile/5030/5/1/abstract.htm","doi":"doi:10.1023/A:1024906105255","pages":"117–132","keywords":"evolutionary computation, genotype-phenotype mapping, neutrality, No-Free-Lunch theorem, redundancy, self-adaptation, genetic programming","abstract":"Neutral genotype-phenotype mappings can be observed in natural evolution and are often used in evolutionary computation. In this article, important aspects of such encodings are analysed. First, it is shown that in the absence of external control neutrality allows a variation of the search distribution independent of phenotypic changes. In particular, neutrality is necessary for self-adaptation, which is used in a variety of algorithms from all main paradigms of evolutionary computation to increase efficiency. Second, the average number of fitness evaluations needed to find a desirable (e.g., optimally adapted) genotype depending on the number of desirable genotypes and the cardinality of the genotype space is derived. It turns out that this number increases only marginally when neutrality is added to an encoding presuming that the fraction of desirable genotypes stays constant and that the number of these genotypes is not too small.","notes":"Article ID: 5126729","bibtex":"@Article{Igel:2003:NC,\n author = \"Christian Igel and Marc Toussaint\",\n title = \"Neutrality and Self-Adaptation\",\n journal = \"Natural Computing\",\n year = \"2003\",\n volume = \"2\",\n number = \"2\",\n URL = \"http://ipsapp009.kluweronline.com/content/getfile/5030/5/1/abstract.htm\",\n doi = \"doi:10.1023/A:1024906105255\",\n pages = \"117--132\",\n keywords = \"evolutionary computation, genotype-phenotype mapping,\n neutrality, No-Free-Lunch theorem, redundancy,\n self-adaptation, genetic programming\",\n abstract = \"Neutral genotype-phenotype mappings can be observed in\n natural evolution and are often used in evolutionary\n computation. In this article, important aspects of such\n encodings are analysed. First, it is shown that in the\n absence of external control neutrality allows a\n variation of the search distribution independent of\n phenotypic changes. In particular, neutrality is\n necessary for self-adaptation, which is used in a\n variety of algorithms from all main paradigms of\n evolutionary computation to increase efficiency.\n Second, the average number of fitness evaluations\n needed to find a desirable (e.g., optimally adapted)\n genotype depending on the number of desirable genotypes\n and the cardinality of the genotype space is derived.\n It turns out that this number increases only marginally\n when neutrality is added to an encoding presuming that\n the fraction of desirable genotypes stays constant and\n that the number of these genotypes is not too small.\",\n notes = \"Article ID: 5126729\",\n}\n\n","author_short":["Igel, C.","Toussaint, M."],"key":"Igel:2003:NC","id":"Igel:2003:NC","bibbaseid":"igel-toussaint-neutralityandselfadaptation-2003","role":"author","urls":{"Paper":"http://ipsapp009.kluweronline.com/content/getfile/5030/5/1/abstract.htm"},"keyword":["evolutionary computation","genotype-phenotype mapping","neutrality","No-Free-Lunch theorem","redundancy","self-adaptation","genetic programming"],"downloads":0,"html":""},"search_terms":["neutrality","self","adaptation","igel","toussaint"],"keywords":["evolutionary computation","genotype-phenotype mapping","neutrality","no-free-lunch theorem","redundancy","self-adaptation","genetic programming"],"authorIDs":[],"dataSources":["EmYaiv9TCHbg7caTW"]}