Experiments with. Cascading Design. Ben Kovitz Fluid Analogies Research Group Indiana University START

Similar documents
The Story So Far... The central problem of this course: Smartness( X ) arg max X. Possibly with some constraints on X.

Evolution of Populations. Chapter 17

The Evolution of Gene Dominance through the. Baldwin Effect

Alignment Algorithms. Alignment Algorithms

The Evolution of Sex Chromosomes through the. Baldwin Effect

Evolution Problem Drill 09: The Tree of Life

mrna Codon Table Mutant Dinosaur Name: Period:

Using phylogenetics to estimate species divergence times... Basics and basic issues for Bayesian inference of divergence times (plus some digression)

Evolutionary Computation

LOCAL SEARCH. Today. Reading AIMA Chapter , Goals Local search algorithms. Introduce adversarial search 1/31/14


The concept of the adaptive landscape

Variance Components: Phenotypic, Environmental and Genetic

This is DUE: Tuesday, Dec 4, 2012 Come prepared to share your findings with your group.

Evolutionary dynamics of populations with genotype-phenotype map

Reading for Lecture 13 Release v10

A Simple Haploid-Diploid Evolutionary Algorithm

Non-Adaptive Evolvability. Jeff Clune

Non-Convex Optimization. CS6787 Lecture 7 Fall 2017

These are my slides and notes introducing the Red Queen Game to the National Association of Biology Teachers meeting in Denver in 2016.

The neutral theory of molecular evolution

Understanding Natural Selection

UNIT V. Chapter 11 Evolution of Populations. Pre-AP Biology

Outline of lectures 3-6

NGSS UNIT OVERVIEW EVOLUTION

Darwin s Observations & Conclusions The Struggle for Existence

Basics of Proofs. 1 The Basics. 2 Proof Strategies. 2.1 Understand What s Going On

Evolutionary computation

Bio 1M: The evolution of apes. 1 Example. 2 Patterns of evolution. Similarities and differences. History

Science Unit Learning Summary

REVIEW 6: EVOLUTION. 1. Define evolution: Was not the first to think of evolution, but he did figure out how it works (mostly).

A.I.: Beyond Classical Search

The Inductive Proof Template

Reading for Lecture 6 Release v10

c 2007 Je rey A. Miron

Team members (First and Last Names): Fossil lab

Unit 7: Evolution Guided Reading Questions (80 pts total)

Endowed with an Extra Sense : Mathematics and Evolution

HEREDITY AND VARIATION

Phylogeny is the evolutionary history of a group of organisms. Based on the idea that organisms are related by evolution

Molecular Evolution & the Origin of Variation

Molecular Evolution & the Origin of Variation

Evolution (Chapters 15 & 16)

chatper 17 Multiple Choice Identify the choice that best completes the statement or answers the question.

V. Evolutionary Computing. Read Flake, ch. 20. Assumptions. Genetic Algorithms. Fitness-Biased Selection. Outline of Simplified GA

V. Evolutionary Computing. Read Flake, ch. 20. Genetic Algorithms. Part 5A: Genetic Algorithms 4/10/17. A. Genetic Algorithms

Outline of lectures 3-6

IV. Evolutionary Computing. Read Flake, ch. 20. Assumptions. Genetic Algorithms. Fitness-Biased Selection. Outline of Simplified GA

Beaming in your answers

Local Search & Optimization

Identify the 6 kingdoms into which all life is classified.

Evolution of Populations

Biostatistics and Design of Experiments Prof. Mukesh Doble Department of Biotechnology Indian Institute of Technology, Madras. Lecture 11 t- Tests

Quazi accurate photo history

1 A simple example. A short introduction to Bayesian statistics, part I Math 217 Probability and Statistics Prof. D.

Rolle s Theorem. The theorem states that if f (a) = f (b), then there is at least one number c between a and b at which f ' (c) = 0.

Inheritance part 1 AnswerIT

Evolutionary Developmental Biology

Implicit Differentiation Applying Implicit Differentiation Applying Implicit Differentiation Page [1 of 5]

WTHS Biology Keystone Exams

Major questions of evolutionary genetics. Experimental tools of evolutionary genetics. Theoretical population genetics.

Biology 11 UNIT 1: EVOLUTION LESSON 2: HOW EVOLUTION?? (MICRO-EVOLUTION AND POPULATIONS)

Evolution Unit: What is Evolution?

3/8/ Complex adaptations. 2. often a novel trait

Theory a well supported testable explanation of phenomenon occurring in the natural world.

Figure 1: Doing work on a block by pushing it across the floor.

Welcome to Evolution 101 Reading Guide

The Derivative of a Function

CS 331: Artificial Intelligence Local Search 1. Tough real-world problems

HBio Evolution 2 Practice test

5/31/2012. Speciation and macroevolution - Chapter

Q2 (4.6) Put the following in order from biggest to smallest: Gene DNA Cell Chromosome Nucleus. Q8 (Biology) (4.6)

NEUROEVOLUTION. Contents. Evolutionary Computation. Neuroevolution. Types of neuro-evolution algorithms

EVOLUTION change in populations over time

CS1800: Strong Induction. Professor Kevin Gold

Organizing Life s Diversity

Random Times and Their Properties

CPSC 340: Machine Learning and Data Mining. Regularization Fall 2017

The Living Environment Unit 4 History of Biologic Diversity Unit 15 Evolution: (15.2) Evidence of Evolution-class key. Name: Class key.

Introduction to Digital Evolution Handout Answers

There are 3 parts to this exam. Use your time efficiently and be sure to put your name on the top of each page.

Quick Sort Notes , Spring 2010

Lecture 15: Exploding and Vanishing Gradients

Learning objectives. Evolution in Action. Chapter 8: Evolution and Natural Selection. By the end of today s topic students should be able to:

Adaptive Traits. Natural selection results in evolution of adaptations. Adaptation: trait that enhances an organism's survival and reproduction

Input layer. Weight matrix [ ] Output layer

Name: Period Study Guide 17-1 and 17-2

EVOLUTION. HISTORY: Ideas that shaped the current evolutionary theory. Evolution change in populations over time.

Define: Alleles. Define: Chromosome. In DNA and RNA, molecules called bases pair up in certain ways.

Risk of extinction and bottleneck effect in Penna model

HUMAN BEING AS AN EVOLUTION OF EVOLUTION TALK GIVEN IN BRIAN SWIMME S EPIC OF EVOLUTION CLASS May 27, 1999

MA 3260 Lecture 10 - Boolean Algebras (cont.) Friday, October 19, 2018.

Grade 6 Math Circles 7/8 November, Approximations & Estimations

One sided tests. An example of a two sided alternative is what we ve been using for our two sample tests:

Computer Science 324 Computer Architecture Mount Holyoke College Fall Topic Notes: Digital Logic

Finding local extrema and intervals of increase/decrease


EVOLUTIONARY DISTANCES

Family Trees for all grades. Learning Objectives. Materials, Resources, and Preparation

EVOLUTION change in populations over time

Transcription:

START + -1.715 + 6.272 + 6.630 + 1.647 Experiments with + 8.667-5.701 Cascading Design P1 P2 P3 P4 Ben Kovitz Fluid Analogies Research Group Indiana University

The coordination problem An old creationist argument: The more refined the design, the harder to improve. Therefore evolution should slow down as complexity and refinement increase. Ripple in engineering: Whenever you change one part of a design, you must change other parts to maintain integrity. The more complex the design, the more ripple. So, in an evolutionary algorithm, improvement usually requires multiple, simultaneous beneficial mutations. Everyone in software engineering knows that it becomes progressively more expensive to add features to a software system as the system grows and matures with real use.

The coordination problem The requirement for coordination creates holey landscapes. Most small changes are lethal. Only big changes are good. Gavrilets, Sergey. Models of speciation: what have we learned in 40 years? Evolution 57.10 (2003): 2197-2215.

The coordination problem Benton, M. J. (1998). The quality of the fossil record of the vertebrates. The adequacy of the fossil record. Wiley, Chichester, UK, 269 303.! The fossil record suggests that natural evolution has found a solution to the coordination problem. Time axis goes up. K-T boundary: 66 Mya. Permian-Triassic extinction: 252 Mya. Cambrian explosion: 542 Mya. Width of line is number of distinct families. Kingdom-Phylum-Class- Order-Family-Genus-Species. This is not conclusive, but it suggests that at least in some cases, greater complexity opens up more opportunities for radical changes. The mutation rate is basically constant molecular clock, Vince Sarich.

The coordination problem Cuban man dubbed Twenty-Four proud of his four extra digits. The Blaze, August 21, 2011 This guy might have a clue about why. There s a single allele on the human genome where a tiny mutation causes this. The allele does not contain all the information needed to build arteries, veins, capillaries, nerves, skin cells, bone, etc.

Cascading design A cascading design is one in which each element does very little other than activate other elements. Metabolic networks Genetic regulatory networks Neural networks Object-oriented programs Fibrin clotting pathway (simplified) http://chemwiki.ucdavis.edu/user:delmar/blood_clotting_cascades Market economies? Minds? Internet? Cascading design roughly means a directed graph where the edges are some sort of simple causal influence. Make use of things that are not you. In market economies, you try to exploit comparative advantage as much as you can, and keep your own job simple and efficient. In minds, we constantly reuse and adapt. The Internet is a more-questionable example: link rather than try to provide all information yourself. The story of Hotmail s quick launch illustrates at least that the Internet exploits cascading design s ability to evolve fast.

Questions 1. Is cascading design enough to solve the coordination problem? Will a small mutation tend to produce a large, coordinated change in the phenotype? 2. Do cascading designs become progressively more evolvable? Without bolting on extras like genes to alter mutation rate. If selective pressure tends to make small mutations produce coordinated changes, then the expected value of single mutations should tend to increase.

Similar to Cartesian Genetic Programming, except nodes can be introduced and deleted by mutations. Unlike CGP, this is not intended to generate practical results. This is just a way to see the effect of cascading design, in a simple model of the common denominator of many kinds of cascading design: metabolic networks, OO code, etc. Experimental approach 10.000 Genotype START -0.165 + 5.892-3.788 P1 P2 P3 P4 Phenotype 10.570 1.650 none 7.542 I ve run many experiments to test this hypothesis. In the rest of this talk, I ll describe two of the more interesting ones. Compare the simplest meaningful cascading design against direct evolution of the phenotype. Genotype: Directed graph of arithmetic operations that feed into the phenotype vector. Phenotype: Vector of four real numbers Mutations that alter only a number are much more common. Number mutations are limited to a small range.

Experimental approach Fitness Reward a mathematical relationship between phenotype elements ( coordination ) as well as absolute numbers. Randomly change constants every 20 generations ( epoch ) while retaining the coordination. Population: 40. Phenotype 10.570 1.650 none 7.542

Experiment #1: Coordination gateway Fitness function Inverted-v function Gateway Equal to each other (radius 0.1) Both must be 1.0 10.570 1.650 none 7.542 After gateway Equal to c1 (radius 0.6) Equal to c2 2 (radius 0.6) Equal to c2 (radius 0.6) Cartoon example: It helps if both your legs are the same length. If the environment rewards longer legs than you have now, but legs of unequal length are catastrophically bad, it helps a lot if a single mutation can lengthen both legs by a little bit. Then you have a fitness gradient that you can hill-climb. If each leg is lengthened by a separate mutation, you need two simultaneous mutations to advance in fitness. The inverted-v function provides a steep hill to climb within the radius, and no gradient at all outside the radius.

Experiment #1: Coordination gateway Genotype + -1.715 START + 6.272 + 6.630 + 1.647 + 8.667-5.701 P1 P2 P3 P4 Phenotype 5.496 5.496 6.586 8.804 This is pretty typical. Most mutations don t alter P1 or P2. Most mutations that do alter P1 and P2 leave them equal.

Experiment #1: Coordination gateway Genotype START -2.379 0.207 + 7.963 + -0.338 + 0.990 5.434 + 9.886 + -9.811 + -0.859 + -6.847 P1 P2 P3 P4 Phenotype 13.790 13.790 1.649 3.349 a common feature of many graphs that evolved in both experiments: genotype nodes occur in chains or well-connected communities that provide many mutation targets, each of which varies the same global parameter of the phenotype nodes of direct relevance to the fitness function. Thus, the probability is very high that any mutation will preserve coordinations that have proven crucial in previous evolution

Experiment #1: Coordination gateway Direct evolution did improve over the first few epochs. The reason is, usually the best phenotypes at the end of an epoch at least have approximately equal P1 and P2. But they find it hard to evolve much beyond that, since P1 and P2 must stay equal in order to gain benefits from the rest of the fitness function. Cascading design: expected value of a mutation much lower, but max much higher. Most mutations are catastrophic, but a few are excellent, and that s all that matters.

Experiment #2: Invariant Ratio 1.145 2.130 3.892 8.370 Equal to c (radius 2.0) Equal to 2c (radius 2.0) Equal to 4c (radius 2.0) Fitness function Equal to 8c (radius 2.0) Pick a new random number -10.0 < c < 10.0 every epoch. Ratio of 2 between consecutive phenotype elements stays constant. One random constant per epoch. Note that the ratio is not itself rewarded. Only closeness to the absolute quantity is rewarded. 1 pt for each equality.

Experiment #2: Invariant Ratio Genotype START + 9.766-7.283 + 9.261 + 1.114-6.420 + 2.873 + 8.626-9.880 + 4.371 1.299 + -6.512 + -8.889 + 5.851 + 9.337 + -5.556 + 4.858 1.283-0.195 2.229 P0 P1 P2 P3 Phenotype 1.145 2.130 3.892 8.370 The rat s nest among the active nodes embodies the 2.0 constant ratio: change one number, and the ratio stays the same.

Experiment #2: Invariant ratio Direct evolution can usually get 2 of the nodes close to their target values, but no more. Cascading design usually got 3 nodes about right, but seldom got all 4. The ratio as represented in the genome was usually a little off from 2.0, so single mutations would often gain at one node while losing at another. So, this fitness function still traps cascading design at local optima.

If Conclusions phenotype is produced by cascading genome and fitness functions reward coordination and genome can model the coordination then selective pressure (selecting phenotypes by fitness) exerts indirect pressure to increase evolvability (of genotype). Locality is bad! Epistasis is good! Hypothesis: Hillifying the fitness landscape. Selective pressure on structure of genotype hillifies the fitness landscape as seen by the mutations that only affect numbers.

START + -1.715 + 6.272 + 6.630 + 1.647 + 8.667-5.701 P1 P2 P3 P4 The End