CAP6938 Neuroevolution and Artificial Embryogeny Evolutionary Comptation Dr. Kenneth Stanley January 23, 2006.

Slides:



Advertisements
Similar presentations
Genetic Algorithms Chapter 3. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Genetic Algorithms GA Quick Overview Developed: USA in.
Advertisements

Population-based metaheuristics Nature-inspired Initialize a population A new population of solutions is generated Integrate the new population into the.
Genetic Algorithms Representation of Candidate Solutions GAs on primarily two types of representations: –Binary-Coded –Real-Coded Binary-Coded GAs must.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
Genetic Algorithms1 COMP305. Part II. Genetic Algorithms.
1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.
Estimation of Distribution Algorithms Let’s review what have done in EC so far: We have studied EP and found that each individual searched via Gaussian.
Evolutionary Computational Inteliigence Lecture 6a: Multimodality.
Introduction to Genetic Algorithms Yonatan Shichel.
Multimodal Problems and Spatial Distribution Chapter 9.
Genetic Algorithm for Variable Selection
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Tutorial 1 Temi avanzati di Intelligenza Artificiale - Lecture 3 Prof. Vincenzo Cutello Department of Mathematics and Computer Science University of Catania.
CS 447 Advanced Topics in Artificial Intelligence Fall 2002.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
The Standard Genetic Algorithm Dr. Chrisantha Fernando Systems Biology Centre University of Birmingham Dr. Chrisantha Fernando Systems Biology Centre University.
Genetic Algorithm.
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
Evolution Strategies Evolutionary Programming Genetic Programming Michael J. Watts
Intro. ANN & Fuzzy Systems Lecture 36 GENETIC ALGORITHM (1)
Genetic Algorithms Michael J. Watts
What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.
Outline Introduction Evolution Strategies Genetic Algorithm
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Genetic Algorithms Genetic Algorithms – What are they? And how they are inspired from evolution. Operators and Definitions in Genetic Algorithms paradigm.
1 Machine Learning: Lecture 12 Genetic Algorithms (Based on Chapter 9 of Mitchell, T., Machine Learning, 1997)
Chapter 4.1 Beyond “Classic” Search. What were the pieces necessary for “classic” search.
Genetic Algorithms Siddhartha K. Shakya School of Computing. The Robert Gordon University Aberdeen, UK
EE459 I ntroduction to Artificial I ntelligence Genetic Algorithms Kasin Prakobwaitayakit Department of Electrical Engineering Chiangmai University.
Genetic Algorithms. Evolutionary Methods Methods inspired by the process of biological evolution. Main ideas: Population of solutions Assign a score or.
15/06/2003NORPIE 2004, Trondheim1 Genetic Optimization of Electric Machines, a State of the Art Study S. E. Skaar, R. Nilssen.
1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
Genetic Algorithms An Example Genetic Algorithm Procedure GA{ t = 0; Initialize P(t); Evaluate P(t); While (Not Done) { Parents(t) = Select_Parents(P(t));
Chapter 12 FUSION OF FUZZY SYSTEM AND GENETIC ALGORITHMS Chi-Yuan Yeh.
1. Genetic Algorithms: An Overview  Objectives - Studying basic principle of GA - Understanding applications in prisoner’s dilemma & sorting network.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 5: Power of Heuristic; non- conventional search.
5. Implementing a GA 4 학습목표 GA 를 사용해 실제 문제를 해결할 때 고려해야 하는 사항에 대해 이해한다 Huge number of choices with little theoretical guidance Implementation issues + sophisticated.
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
Contribution of second order evolution to evolutionary algorithms Virginie LEFORT July 11 th.
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Genetic Algorithms. Underlying Concept  Charles Darwin outlined the principle of natural selection.  Natural Selection is the process by which evolution.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Selection and Recombination Temi avanzati di Intelligenza Artificiale - Lecture 4 Prof. Vincenzo Cutello Department of Mathematics and Computer Science.
CAP6938 Neuroevolution and Artificial Embryogeny Evolutionary Computation Theory Dr. Kenneth Stanley January 25, 2006.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Overview Last two weeks we looked at evolutionary algorithms.
Multimodal Problems and Spatial Distribution A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Chapter 9.
CAP6938 Neuroevolution and Artificial Embryogeny Real-time NEAT Dr. Kenneth Stanley February 22, 2006.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
Introduction to Genetic Algorithms
Using GA’s to Solve Problems
Genetic Algorithms.
Dr. Kenneth Stanley September 11, 2006
Evolutionary Algorithms Jim Whitehead
Dr. Kenneth Stanley September 13, 2006
Introduction to Genetic Algorithm (GA)
CS621: Artificial Intelligence
Basics of Genetic Algorithms (MidTerm – only in RED material)
رایانش تکاملی evolutionary computing
GENETIC ALGORITHMS & MACHINE LEARNING
Dr. Kenneth Stanley February 6, 2006
Basics of Genetic Algorithms
Searching for solutions: Genetic Algorithms
A Gentle introduction Richard P. Simpson
Machine Learning: UNIT-4 CHAPTER-2
A population shares a common gene pool.
Presentation transcript:

CAP6938 Neuroevolution and Artificial Embryogeny Evolutionary Comptation Dr. Kenneth Stanley January 23, 2006

Main Idea Natural selection can work on computers –Selection: Picking the best parents –Variation: Mutation and Mating Start with some really bad individuals Some are always better than others Survival of the fittest leads to improvement Progress occurs over generations

Survival of the Roundest Gen 1 Select as parents Gen 2 Gen 3 Select as parents Champ!

Several Versions of EC Genetic Algorithms (Holland 1960s) Evolution Strategies (Rechenberg 1965) Evolution Programming (Fogel 1966) Genetic Programming? (Smith 1980,Koza 1982) The process is more important than the name

Major Concepts Genotype and Phenotype Representation / mapping Evaluation and fitness Generations Steady state Selection Mutation Mating/Crossover/Recombination Premature Convergence Speciation

Genotype and Phenotype Genotype means the code (e.g. DNA) used to the describe an organism, i.e. the “blueprint” Phenotype is the organism’s actual realization

Representation and Mapping The genotype is a representation of the phenotype; how to represent information is a profound and deep issue The process of creating the phenotype from the genotype is called the genotype to phenotype mapping Mapping can happen in many ways

Mappings

Evaluation and Fitness The phenotype is evaluated, not the genotype The performance of the phenotype during evaluation is its fitness Fitness tells us which genotypes are better than others

Generations Most GAs proceed generationally: –A whole population is evaluated one at a time –That is the current generation –They then are replaced en masse by their offspring –The replacements form the next generation –And so on…

Steady State Evolution Not all EC is generational It is possible to replace only one individual at a time, i.e. steady state evolution Common in Evolution Strategies (ES) Also called real-time or online evolution Another twist: Phenotypes can be evaluated simultaneously and asynchronously

Selection Selection means deciding who should be a parent and who should not Selection is usually based on fitness Methods of selection (see Mitchell p.166) –Roulette Wheel (probability based on fitness) –Truncation (random among top n%) –Rank selection (use rank instead of fitness) –Elitism (champs get to have clones)

Mutation Mutation means changing the genotype randomly Can vary from strong (every gene mutates) to weak (only one gene mutates) May mean adding a new gene entirely Mutation prevents fixation Mutation is a source of diversity and discovery

Mating Combining one or more genomes Many ways to implement crossover: –Singlepoint –Multipoint (Uniform) –Multipoint average (Linear) How important is crossover? What is it for?

Premature Convergence When a single genotype dominates the population, it is converged Convergence is premature if a suitable solution has not yet been found Premature convergence is a significant concern in EC Hence the need to maintain diversity

Speciation A population can be divided into species Can prevents incompatibles from mating Can protects innovative concepts in niches Maintains diversity Many methods –Islands –Fitness sharing –Crowding

Natural Evolution is not Just Optimization What is the optimum? What is the space being searched? What are the dimensions? Herb Simon (1958): “Satisficing” Is evolution even just a satisficer? Evolution satisfices and complexifies

Next Class: Theoretical Issues in EC The Schema Theorem No Free Lunch Homework: Mitchell pp , and ch.5 (pp ) No Free Lunch Theorems for Optimization by Wolpert and Macready (1996)