What is Neutral? Neutral Changes and Resiliency Terence Soule Department of Computer Science University of Idaho.

Slides:



Advertisements
Similar presentations
Population Genetics 1 Chapter 23 in Purves 7 th edition, or more detail in Chapter 15 of Genetics by Hartl & Jones (in library) Evolution is a change in.
Advertisements

Representing Hypothesis Operators Fitness Function Genetic Programming
BIOINFORMATICS GENE DISCOVERY BIOINFORMATICS AND GENE DISCOVERY Iosif Vaisman 1998 UNIVERSITY OF NORTH CAROLINA AT CHAPEL HILL Bioinformatics Tutorials.
1 Lesson 25 – Evolutionary Processes Life Science.
Hardy-Weinberg Equilibrium
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
Mechanics of Genetic Programming
1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.
Data Mining CS 341, Spring 2007 Genetic Algorithm.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Introduction to Genetic Algorithms Yonatan Shichel.
A simple EA and Common Search Operators Temi avanzati di Intelligenza Artificiale - Lecture 2 Prof. Vincenzo Cutello Department of Mathematics and Computer.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Evolutionary Computation Application Peter Andras peter.andras/lectures.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
16 November, 2005 Statistics in HEP, Manchester 1.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
Even More Random Number Generators Using Genetic Programming Joe Barker.
Image Registration of Very Large Images via Genetic Programming Sarit Chicotay Omid E. David Nathan S. Netanyahu CVPR ‘14 Workshop on Registration of Very.
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 on Program Traces as an Inference Engine for Probabilistic Languages Vita Batishcheva, Alexey Potapov
Neural and Evolutionary Computing - Lecture 7 1 Evolutionary Programming The origins: L. Fogel (1960) – development of methods which generate automatically.
Evolutionary Intelligence
Improved Gene Expression Programming to Solve the Inverse Problem for Ordinary Differential Equations Kangshun Li Professor, Ph.D Professor, Ph.D College.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Introduction to Evolutionary Computation Temi avanzati di Intelligenza Artificiale - Lecture 1 Prof. Vincenzo Cutello Department of Mathematics and Computer.
What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.
Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
1 Computing in High Energy and Nuclear Physics, February 2006, Mumbai, India.
1 Chapter 14 Genetic Algorithms. 2 Chapter 14 Contents (1) l Representation l The Algorithm l Fitness l Crossover l Mutation l Termination Criteria l.
How to apply Genetic Algorithms Successfully Prabhas Chongstitvatana Chulalongkorn University 4 February 2013.
Evolutionary Computation Dean F. Hougen w/ contributions from Pedro Diaz-Gomez & Brent Eskridge Robotics, Evolution, Adaptation, and Learning Laboratory.
Effect of Modified Permutation Encoding Mutation in Genetic Algorithm Sandeep Bhowmik Archana Jha Sukriti Sinha Department of Computer Science & Engineering,
Introduction to History of Life. Biological evolution consists of change in the hereditary characteristics of groups of organisms over the course of generations.
Genetic Algorithms CSCI-2300 Introduction to Algorithms
Edge Assembly Crossover
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
Genetic Algorithms. The Basic Genetic Algorithm 1.[Start] Generate random population of n chromosomes (suitable solutions for the problem) 2.[Fitness]
Construction of Substitution matrices
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.
The plant of the day Pinus longaevaPinus aristata.
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
Neural Networks And Its Applications By Dr. Surya Chitra.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Did Mendel fake is data? Do a quick internet search and can you find opinions that support or reject this point of view. Does it matter? Should it matter?
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Genetic Programming Using Simulated Natural Selection to Automatically Write Programs.
Genetics: Part II Predicting Offspring. 2 Key Male Female Affected male Affected female Mating Offspring 1st generation 2nd generation 3rd generation.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
1 Comparative Study of two Genetic Algorithms Based Task Allocation Models in Distributed Computing System Oğuzhan TAŞ 2005.
Estimation of Distribution Algorithm and Genetic Programming Structure Complexity Lab,Seoul National University KIM KANGIL.
Genetic Algorithm(GA)
Evolutionary Design of the Closed Loop Control on the Basis of NN-ANARX Model Using Genetic Algoritm.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Presented By: Farid, Alidoust Vahid, Akbari 18 th May IAUT University – Faculty.
July 6, 2016Knowledge-Based System, Lecturer # 09 1 Knowledge Based System Lecture #09 Dr. Md. Hasanuzzaman Assistant Professor Department of Computer.
Topics How to track evolution – allele frequencies
Using GA’s to Solve Problems
Convergence in Genetic Programming
EVOLUTION.
Chapter 17: Evolution of Populations
A Probabilistic Functional Crossover Operator
A Gentle introduction Richard P. Simpson
The Evolution of Populations
Evolution of Biodiversity
Presentation transcript:

What is Neutral? Neutral Changes and Resiliency Terence Soule Department of Computer Science University of Idaho

The experiments Gene/exon selection Introns and exon selection Effects of operators

Experiment 1 Tree based, generational GP Functions {+} Terminals/Genes {0.5, 1.0} Fitness: difference from 10 Both terminals are exons. Is one selected?

Gene/Exon Choice

Average Fitness Average fitness improves – after crossover.

Resiliency A measure of expected fitness change as a function of genotype change. Resilient individuals are less likely to change fitness or have a smaller average fitness change in response to genotype changes (crossover and mutation). Similar to the idea of effective fitness, but more general.

Experiment 2 Tree based, generational GP Functions {+} Terminals/Genes {0, 1, 4} Fitness: difference from 40 Now there are two exons and an intron. What is selected?

Number of Genes Number of Generation 0s 1s 4s

Resiliency Fitness Change Crossover Mutation

Ratio of 1s to 4s

Results – Experiment 2 Changes don’t affect current fitness – Are they Neutral? Changes affect expected fitness of the next generation – increase (average) resiliency

Experiment 3 Variable length, linear encoding, generational Genes {0, 1, 4} Sample individual: Fitness: difference of sum of genes from 54

Experiment 3 - Crossover Proportional crossover – select two random points per parent. Constant crossover – length of crossed region is: 2 50% of the time 4 25% of the time % of the time …

Genes – Constant Crossover

Genes – Proportional Crossover

Mutation – Constant Crossover Probability P of changing a gene to another value: 1 to 0, etc. More genes (including 0s) greater chance of mutations.

Growth – constant crossover

Conclusions Many ‘neutral’ changes can be explained in terms of resiliency 1.0  two 0.5s (selecting exons) 4s  four 1s and four 1s  one 4s Increasing 0s (increasing introns) Operator choice significantly affects these changes Proportional versus constant crossover Mutations Per node versus per individual rates are significant.

Discussion Types of changes 1 st order – affect fitness 2 nd order – affect expected fitness of offspring (resiliency) 3 rd order? - affect expected fitness of Nth generation? Affect ability to respond to ‘environmental’ changes? Any consistent pattern of change has an evolutionary explanation(?) It’s possible to predict some changes by using the idea of resiliency. Do these changes affect search?

Thank You Questions?

Bibliography “Exons and Code Growth in GP” Genetic Programming 5 th European Conference, EuroGP-2002, Springer LNCS2278, “Solution Stability in Evolutionary Computation” Proceedings of the 17 th International Symposium on Computer and Information Sciences, CRC Press, “Operator Choice and the Evolution of Robust Solutions” Genetic Programming Theory and Practice, Kluwer, 2003.