{"title":"Genetic Operators in Evolutionary Music Composition","authors":"Csaba Sulyok","doi":"10.1109/SYNASC.2018.00047","DOIUrl":null,"url":null,"abstract":"Genetic operators represent the alterations applied to entities within an evolutionary algorithm; they help create a new generation from an existing one, ensuring genetic diversity while also preserving the emergent overall strengths of a population. In this paper, we investigate different approaches to hyperparameter configuration of genetic operators within a linear genetic programming framework. We analyze the benefits of adaptively setting operator distributions and rates using hill climbing. A comparison is drawn between the constant and adaptive methodologies. This research is part of our ongoing work on evolutionary music composition, where we cast the actions of a virtual composer as instructions on a Turing-complete virtual register machine. The created music is assessed by statistical similarity to a given corpus. The frailty to change of our genotype dictates fine-tuning of the genetic operators to help convergence. Our results show that adaptive methods only provide a marginal improvement over constant settings and only in select cases, such as globally altering operator hyperparameters without changing the distribution. In other cases, they prove detrimental to the final grades.","PeriodicalId":273805,"journal":{"name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2018.00047","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
Genetic operators represent the alterations applied to entities within an evolutionary algorithm; they help create a new generation from an existing one, ensuring genetic diversity while also preserving the emergent overall strengths of a population. In this paper, we investigate different approaches to hyperparameter configuration of genetic operators within a linear genetic programming framework. We analyze the benefits of adaptively setting operator distributions and rates using hill climbing. A comparison is drawn between the constant and adaptive methodologies. This research is part of our ongoing work on evolutionary music composition, where we cast the actions of a virtual composer as instructions on a Turing-complete virtual register machine. The created music is assessed by statistical similarity to a given corpus. The frailty to change of our genotype dictates fine-tuning of the genetic operators to help convergence. Our results show that adaptive methods only provide a marginal improvement over constant settings and only in select cases, such as globally altering operator hyperparameters without changing the distribution. In other cases, they prove detrimental to the final grades.