The Black Art of Evolution. Chrisantha Fernando Collegium Budapest 2005.

Slides:



Advertisements
Similar presentations
An Introduction to Evolution Dr. Chrisantha Fernando Systems Biology Centre University of Birmingham Dr. Chrisantha Fernando Systems Biology Centre University.
Advertisements

Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)
Introduction to Evolutionary Computation. Questions to consider during this lesson:  - How is digital evolution similar to biological evolution? How.
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
Genetic Algorithms. Some Examples of Biologically Inspired AI Neural networks Evolutionary computation (e.g., genetic algorithms) Immune-system-inspired.
1 Chapter 13 Artificial Life: Learning through Emergent Behavior.
02/03/07DePaul University, HON2071 Evolutionary Computation Module for HON207.
Genetic Algorithms1 COMP305. Part II. Genetic Algorithms.
Evolutionary Computation Introduction Peter Andras s.
Evolutionary Algorithms Simon M. Lucas. The basic idea Initialise a random population of individuals repeat { evaluate select vary (e.g. mutate or crossover)
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
The Neuronal Replicator Hypothesis Chrisantha Fernando 1,2,3 Eörs Szathmary 1,4,5 1 Collegium Budapest (Institute for Advanced Study), Budapest, Hungary.
CS 447 Advanced Topics in Artificial Intelligence Fall 2002.
The Standard Genetic Algorithm Dr. Chrisantha Fernando Systems Biology Centre University of Birmingham Dr. Chrisantha Fernando Systems Biology Centre University.
Genetic Programming. Agenda What is Genetic Programming? Background/History. Why Genetic Programming? How Genetic Principles are Applied. Examples of.
From Extropians to Evolutionary Robotics Simon D. Levy PHIL April 2013 What Machines (Don't) Tell Us About (Trans)Human Nature.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Genetic Programming.
Genetic Algorithm.
The Role of Artificial Life, Cellular Automata and Emergence in the study of Artificial Intelligence Ognen Spiroski CITY Liberal Studies 2005.
1 Evolutionary Growth of Genomes for the Development and Replication of Multi-Cellular Organisms with Indirect Encodings Stefano Nichele and Gunnar Tufte.
Evolutionary Algorithms BIOL/CMSC 361: Emergence Lecture 4/03/08.
Evolvability of Autocatalytic Reaction Networks
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
Evolution Strategies Evolutionary Programming Genetic Programming Michael J. Watts
CS 484 – Artificial Intelligence1 Announcements Lab 4 due today, November 8 Homework 8 due Tuesday, November 13 ½ to 1 page description of final project.
Computer Science Dept, San Jose State University, CA Self Reproducing CA’s and Programs Shruti Parihar May 06, 2003.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Course material – G. Tempesti Course material will generally be available the day before the lecture Includes.
What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.
1 Chapter 13 Artificial Life: Learning through Emergent Behavior.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Evolving Virtual Creatures & Evolving 3D Morphology and Behavior by Competition Papers by Karl Sims Presented by Sarah Waziruddin.
Soft Computing A Gentle introduction Richard P. Simpson.
Themes of Biology.  Biology is the study of life.
Derivative Free Optimization G.Anuradha. Contents Genetic Algorithm Simulated Annealing Random search method Downhill simplex method.
Artificial Intelligence Chapter 4. Machine Evolution.
Random Boolean Networks. Attractors A Boolean network has 2 ^N possible states. Sooner or later it will reach a previously visited state, and thus,
Strategies and Rubrics for Teaching Chaos and Complex Systems Theories as Elaborating, Self-Organizing, and Fractionating Evolutionary Systems Fichter,
Genetic Algorithms. 2 Overview Introduction To Genetic Algorithms (GAs) GA Operators and Parameters Genetic Algorithms To Solve The Traveling Salesman.
EE749 I ntroduction to Artificial I ntelligence Genetic Algorithms The Simple GA.
Evolvability and Cross-Talk in Chemical Networks Chrisantha Fernando Jon Rowe Systems Biology Centre & School of Computer Science Birmingham University,
Strategies and Rubrics for Teaching Chaos and Complex Systems Theories as Elaborating, Self-Organizing, and Fractionating Evolutionary Systems Fichter,
DNA replication ?  DNA replication- the basis for biological inheritance, is a fundamental process occurring in all living organisms to copy their DNA.
Darwin for all Seasons Eörs Szathmáry Collegium Budapest and Eötvös University.
Contribution of second order evolution to evolutionary algorithms Virginie LEFORT July 11 th.
Genetic Algorithms MITM613 (Intelligent Systems).
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
Hard problems of the origin of life
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
The Origin and Maintenance of Life Nicolas Kosoy.
EVOLUTIONARY SYSTEMS AND GENETIC ALGORITHMS NAME: AKSHITKUMAR PATEL STUDENT ID: GRAD POSITION PAPER.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Introduction to Genetic Algorithms
Genetic Algorithm in TDR System
Genetic Algorithms.
Introduction to Evolutionary Computing
Evolution Strategies Evolutionary Programming
Our understanding of man’s place in the universe
Evolutionary Algorithms
Artificial Intelligence (CS 370D)
Basics of Genetic Algorithms (MidTerm – only in RED material)
Autcatalytic networks
Dr. Unnikrishnan P.C. Professor, EEE
Basics of Genetic Algorithms
Boltzmann Machine (BM) (§6.4)
CHAPTER I. of EVOLUTIONARY ROBOTICS Stefano Nolfi and Dario Floreano
A Gentle introduction Richard P. Simpson
Beyond Classical Search
Presentation transcript:

The Black Art of Evolution. Chrisantha Fernando Collegium Budapest 2005

Part 1: Understanding evolution as an engineering tool. Part 2: Understanding how living systems facilitate evolution.

Requirements for Evolution. Units must replicate. Units must show heredity across generations (like begets like). Heredity. Heredity should not be exact. Variability. Some variants must produce more offspring than others. Selection. Selection can be artificial or natural.

Consequences of Evolution. Over many generations, the make-up of the population changes. Without the need for any individual to change, successive generations change, and in some sense (usually) adapts to the conditions. Evolution can be seen as a search within a many-dimensional, search space, a fitness landscape, with a population moving to the mountain tops of high fitness.

Can We Do Evolution Ourselves? Yes. Make a genotype: Interpret/Translate the genotype into a phenotype: E.g. the neural network (nervous system) controller for a robot. A simple example. Evolving paper gliders.

Fold TL to BR towards you Fold horiz middle away Fold vertical middle towards Fold TR to BL towards you Fold horiz middle away Fold vertical middle away I. Harvey.

1.Generate 20 random sequences of folding instructions 2.Fold each piece of paper according to instructions written on them 3.Throw them all out of the window 4.Pick up the ones that went furthest, look at the instrns 5.Produce 20 new pieces of paper, writing on each bits of sequences from parent pieces of paper 6.Repeat from (2) on.

Some real examples of things artificially evolved. TABLES Fitness function rewarded structures for maximizing: height; surface area; stability/volume; and minimizing the number of cubes. Hornby et al

Locomotion etc… Hornby et al Karl Sims

Evolving Nervous Systems for Robots. Dario Floreano et al

The Black Art. A lot of prior knowledge about the problem went into the design of the genetic algorithm. What was this prior knowledge? How can real evolution have worked without someone putting this prior knowledge in?

The Black Art of Evolution. We programmed in replication, heredity, variation and selection explicitly. 1.We had to invent the genotype-phenotype map ourselves. 2.We had to make the paper gliders with our own hands, they did not self-replicate. 3. We had to define the genetic operators, i.e. how mutation and recombination works. 4. We had to specify the unit of evolution (glider) ourselves. 5.We had to define the criteria for selection (fitness function) and define the selection algorithm ourselves. Real fitness is determined ecologically, co-evolution occurs. Artificial co-evolution is v. tricky to get right. The ‘black art’ is not trivial, and in fact is crucial for any artificial evolution to work. How has natural evolution done the ‘black art’ itself?

1. The Genotype-Phenotype Map. Artificial Evolution. How can I sensibly encode different phenotypes (possible solutions) as genotypes (artificial DNA, strings of symbols) ? For heredity and variation to work properly, as far as possible, small changes in G (mutations) should make small changes in P. And inheriting bits of G from different parents should ideally result in inheriting bits of each parent’s phenotypic characteristics. Direct Encodings: Does not scale up to large phenotypes. Indirect/Generative/Developmental Encodings: Difficult to design by hand. Requires prior knowledge of solution space. Too computationally expensive to search through space of possible encodings. Are often brittle.

1. The Genotype-Phenotype Map. Biological Evolution. How does information coded in the genotype make the phenotype? Biological Principles (Self-Similarity, Modularity, Neutrality). Self-Similarity.

How does the genotype-phenotype map work in real organisms? GENE REGULA- TORY NETWORK

Josh Bongard Block Pushing using a Gene Regulatory Network Controled Morphology.

Neutrality. ’Constant innovation’ -- You never get stuck !

Examples of Neutrality of GP Map. RNA Sequence --> RNA Structure. Evolvable Hardware.

2. Can we make self-replicating things? Non-chemical self-replicating systems have not been evolvable. Formal Self-Replicating Systems. Chris Langton

2. Von Neumann’s Self Replicating Automata. Able to copy any tape. But not robust to mutation. Also takes ages to work!

Template Replication (from Breivik).

3. We had to choose the genetic operators, i.e. type of variation. Mutation: Rate, vector, point. Recombination: Single point, double, random. Complex structured operators acting on larger genetic units. Real evolution has ‘tuned’ and evolved the genetic operators themselves.

4 & 5. Emergent Units of Evolution in an Ecology. Tierra is a finite world in computer memory. Organisms are blocks of memory (space). They reproduce by allocating memory for a daughter and giving it access to its own instruction pointer. A reaper kills organisms randomly leaving their dead code in the soup. ‘Cosmic rays’ flip bits of memory so replication errors occur. At the start a hand-designed self-replicating ‘ancestor’ 80 instructions long, is inserted and allowed to replicate.

Evolutionary Dynamics in Tierra. Smaller self-replicating mutants require less CPU time (energy/resource), so replicate faster. Parasites appeared 45 instructions long, able to use the code of their neighbors. Hyperparasites appear that are even smaller and faster at replicating.

I wanted to understand how evolution could bootstrap itself to produce more and more complex phenotypes. Current evolutionary robotics is limited by decisions about the g-p map and phenotypic dynamics. I found that John Maynard-Smith and Eörs Szathmáry had written the book The Major Transitions in Evolution about the details of biological emergence of higher levels of organisation. I wished to find the proper framework to explore how open-ended evolution could work.

None of the things we evolved were alive! Units of LifeUnits of Evolution

What is Life? You land on Mars and find a strange object. You have to decide whether it is alive or not. Briefly state your methods.

Tibor Ganti Absolute Life Criteria: 1.Inherent individual unit. 2.Perform metabolism. 3.Inherently stable. 4.Subsystem carrying information which is useful to the whole system. 5.Processes must be regulated and controlled. Potential Life Criteria: 1.Capable of growth and multiplication. 2.Capacity for hereditary change and evolution. Capacity to produce increasingly complex forms over successive generations. 3.Mortality.

Evolution has acted on Fluid Machines. Living systems are chemical machines, using chemical energy and matter to construct themselves, and producing waste. The production of self-reproducing (autocatalytic) machines in chemical state space is much easier than in mechanical automata, because these systems are free of geometric constraints. Ganti showed how a metabolic cycle, a template replication system, and a compartment (boundary) system can satisfy all life criteria.

The Fundamental Unit of Life. The Chemoton.

The Chemoton consists of 3 coupled self-replicating systems. EACH WITH ITS OWN DYNAMICS.

Autocatalytic Metabolism.

Autocatalytic Non-Enzymatic Template Replication.

Autocatalytic Membrane Replication

The clever part is how they are coupled. The genes do not encode all the dynamical properties of the phenotype. Instead they regulate and control phenotypic dynamics. There is epigenetic inheritance.

The Origin of Long Template Replication. Long template replication can allow unlimited heredity. Can we explain how this is possible without enzymes? We are running simulations of the templates now to see if in chemoton like conditions, long templates could replicate.

The Origin of the Chemoton. But how could the chemoton form? How can its metabolism be stable without enzymes? We are running simulations now to understand the conditions under which large autocatalytic metabolic systems can be both evolvable and stable.

The Origin of Autocatalytic Metabolic Systems. How is it possible to obtain a self-sustaining interesting organisation (autocatalytic system) from an initially random set of chemicals. How probable are such conditions? Experiments so far. –System reached a point attractor of tar. –Experiments did not keep the system out of equilibrium. How can selection act at this chemical level, where there are no well defined spatial units of evolution, but where the unit exists in chemical ‘space’?

Conclusion. How can a complex metabolism arise without enzymes to direct it? How can that metabolism form an informational control system (genes) and a boundary? How did selection act on chemotons?

Acknowledgements Eörs Szathmáry Simon McGregor Andy Ballam Sampsa Sojakka Rob Vickerstaff Phil Husbands Inman Harvey Ezequiel Di Paolo