ACM Home Page
Please provide us with feedback. Feedback
Selecting for evolvable representations
Full text PdfPdf (308 KB)
Source Genetic And Evolutionary Computation Conference archive
Proceedings of the 8th annual conference on Genetic and evolutionary computation table of contents
Seattle, Washington, USA
SESSION: Genetic algorithms: papers table of contents
Pages: 1297 - 1304  
Year of Publication: 2006
ISBN:1-59593-186-4
Authors
Joseph Reisinger  University of Texas at Austin, Austin, TX
Risto Miikkulainen  University of Texas at Austin, Austin, TX
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 44,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1143997.1144199
What is a DOI?

ABSTRACT

Evolutionary algorithms tend to produce solutions that are not evolvable: Although current fitness may be high, further search is impeded as the effects of mutation and crossover become increasingly detrimental. In nature, in addition to having high fitness, organisms have evolvable genomes: phenotypic variation resulting from random mutation is structured and robust. Evolvability is important because it allows the population to produce meaningful variation, leading to efficient search. However, because evolvability does not improve immediate fitness, it must be selected for indirectly. One way to establish such a selection pressure is to change the fitness function systematically. Under such conditions, evolvability emerges only if the representation allows manipulating how genotypic variation maps onto phenotypic variation and if such manipulations lead to detectable changes in fitness. This research forms a framework for understanding how fitness function and representation interact to produce evolvability. Ultimately evolvable encodings may lead to evolutionary algorithms that exhibit the structured complexity and robustness found in nature.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
P. Bentley and S. Kumar. Three ways to grow designs: A comparison of embryogenies for an evolutionary design problem. In Proc. of the Genetic and Evolutionary Computation Conference, pages 35--43, Orlando, Florida, USA, 1999. Morgan Kaufmann.
 
3
 
4
 
5
T. F. Hansen. Is modularity necessary for evolvability? Remarks on the relationship between pleiotropy and evolvability. BioSystems, 69:83--94, 2002.
 
6
G. S. Hornby. Functional scalability through generative representations: The evolution of table designs. Environment and Planning B: Planning and Design, 31(4):569--587, 2004.
 
7
G. S. Hornby and J. B. Pollack. The advantages of generative grammatical encodings for physical design. In Proc. of CEC 2001, 2001.
 
8
M. A. Huynen. Exploring phenotype space through neutral evolution. Journal of Molecular Evolution, 43:165--169, 1996.
 
9
N. Kashtan and U. Alon. Spontaneous evolution of modularity and network motifs. Proc. of the National Academy of Sciences, 102(39), 2005.
 
10
M. Kirschner and J. Gerhart. Evolvability. PNAS, 95:8420--8427, 1998.
 
11
 
12
G. E. Liepins and M. D. Vose. Representational issues in genetic optimization. Journal of Experimental and Theoretical Artificial Intelligence, 2:101--115, 1990.
 
13
H. Lipson, J. Pollack, and N. Suh. On the origin of modular variation. Evolution, 56(8):1549--1556, 2002.
 
14
 
15
R. A. Raff. The Shape of Life: Genes, development, and the Evolution of Animal Form. The University of Chicago Press, 1996.
16
 
17
 
18
 
19
 
20
M. Toussaint. Compact representations as a search strategy: Compression EDA. Theoretical Computer Science, In press.
 
21
E. A. Variano, J. H. McCoy, and H. Lipson. Networks, dynamics and modularity. Physical Review Letters, 92(18), 2004.
 
22
G. Wagner and L. Altenberg. Complex adaptations and the evolution of evolvability. Evolution, 50(3):967--976, 1996.
 
23
 
24
D. Whitley, S. Rana, and R. Heckendorn. Representation Issues in Neighborhood Search and Evolutionary Algorithms, pages 39--58. John Wiley and Sons Ltd., 1997.


Collaborative Colleagues:
Joseph Reisinger: colleagues
Risto Miikkulainen: colleagues