7. Genetic Programming and Emergent Order GP-Seminar 98.9.19 신수용.

Slides:



Advertisements
Similar presentations
Population-based metaheuristics Nature-inspired Initialize a population A new population of solutions is generated Integrate the new population into the.
Advertisements

Biologically Inspired Computing: Operators for Evolutionary Algorithms
1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Evolutionary Computation Introduction Peter Andras s.
Genetic Algorithms GAs are one of the most powerful and applicable search methods available GA originally developed by John Holland (1975) Inspired by.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Doug Downey, adapted from Bryan Pardo, Machine Learning EECS 349 Machine Learning Genetic Programming.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Chapter 14 Genetic Algorithms.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
CS 447 Advanced Topics in Artificial Intelligence Fall 2002.
What is Neutral? Neutral Changes and Resiliency Terence Soule Department of Computer Science University of Idaho.
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 Programming.
1 Analysis - Improving GP with Statistics Chap. 8 발표자 : 김정집.
Genetic Algorithm.
1 An Overview of Evolutionary Computation 조 성 배 연세대학교 컴퓨터과학과.
Problems Premature Convergence Lack of genetic diversity Selection noise or variance Destructive effects of genetic operators Cloning Introns and Bloat.
Evolution Strategies Evolutionary Programming Genetic Programming Michael J. Watts
© Negnevitsky, Pearson Education, Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming Evolution strategies Evolution.
CS 484 – Artificial Intelligence1 Announcements Lab 3 due Tuesday, November 6 Homework 6 due Tuesday, November 6 Lab 4 due Thursday, November 8 Current.
By Prafulla S. Kota Raghavan Vangipuram
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
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.
Design of an Evolutionary Algorithm M&F, ch. 7 why I like this textbook and what I don’t like about it!
Introduction to GAs: Genetic Algorithms How to apply GAs to SNA? Thank you for all pictures and information referred.
ART – Artificial Reasoning Toolkit Evolving a complex system Marco Lamieri
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
1/27 Discrete and Genetic Algorithms in Bioinformatics 許聞廉 中央研究院資訊所.
1 “Genetic Algorithms are good at taking large, potentially huge search spaces and navigating them, looking for optimal combinations of things, solutions.
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.
GENETIC ALGORITHMS.  Genetic algorithms are a form of local search that use methods based on evolution to make small changes to a popula- tion of chromosomes.
Genetic Algorithms CSCI-2300 Introduction to Algorithms
Edge Assembly Crossover
Genetic Algorithms. 2 Overview Introduction To Genetic Algorithms (GAs) GA Operators and Parameters Genetic Algorithms To Solve The Traveling Salesman.
MAE 552 Heuristic Optimization Instructor: John Eddy Lecture #12 2/20/02 Evolutionary Algorithms.
1. Genetic Algorithms: An Overview  Objectives - Studying basic principle of GA - Understanding applications in prisoner’s dilemma & sorting network.
EE749 I ntroduction to Artificial I ntelligence Genetic Algorithms The Simple GA.
Genetic Algorithms. The Basic Genetic Algorithm 1.[Start] Generate random population of n chromosomes (suitable solutions for the problem) 2.[Fitness]
CITS7212: Computational Intelligence An Overview of Core CI Technologies Lyndon While.
Contribution of second order evolution to evolutionary algorithms Virginie LEFORT July 11 th.
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
Genetic Programming COSC Ch. F. Eick, Introduction to Genetic Programming GP quick overview Developed: USA in the 1990’s Early names: J. Koza Typically.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Genetic Programming Using Simulated Natural Selection to Automatically Write Programs.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Genetic Algorithms. Solution Search in Problem Space.
Genetic Algorithms An Evolutionary Approach to Problem Solving.
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
March 1, 2016Introduction to Artificial Intelligence Lecture 11: Machine Evolution 1 Let’s look at… Machine Evolution.
2. Genetic Programming and Biology 신수용. 2.1 Minimal requirements for Evolution to Occur u Four essential preconditions for the occurrence of evolution.
Chapter 14 Genetic Algorithms.
Genetic Algorithm in TDR System
Evolution Strategies Evolutionary Programming
Genetic Algorithms GAs are one of the most powerful and applicable search methods available GA originally developed by John Holland (1975) Inspired by.
Introduction to Genetic Algorithm (GA)
CSC 380: Design and Analysis of Algorithms
Genetic Algorithms GAs are one of the most powerful and applicable search methods available GA originally developed by John Holland (1975) Inspired by.
GENETIC ALGORITHMS & MACHINE LEARNING
Dr. Kenneth Stanley February 6, 2006
Basics of Genetic Algorithms
Biologically Inspired Computing: Operators for Evolutionary Algorithms
Beyond Classical Search
Population Based Metaheuristics
CSC 380: Design and Analysis of Algorithms
Coevolutionary Automated Software Correction
Presentation transcript:

7. Genetic Programming and Emergent Order GP-Seminar 신수용

2 Contents u Introduction u Evolution of Structure and Variable Length Genomes u Iteration, Selection, and Variable Length Program Structures u Evolvable Representations u The Emergence of Introns, Junk DNA, and Bloat u Introns in GP defined u Why GP Introns Emerge u Effective Fitness and Operator u Why Introns Grow Exponentially u The Effects of Introns u What to Do about Introns

3 7.1 Introduction u This chapter focuses on emergent properties arising from GP’s freedom of representation of the problem space u Two important properties of GP  GP’s ability to search the space of the problem representation  The problem of introns or bloat u emergence -> variable length genotype 때문

4 7.2 Evolution of Structure and Variable Length Genomes u The capability to evolve a representation of the problem depends on the ability of a learning algorithm to modify the structure of its own solutions u By evolving structure, a variable length genotype may be able to learn not only the parameters of the solution, but also how many parameters there should be, what they mean, and how they interrelate u The variable length genotype is perhaps GP’s most radical practical innovation compared to its EA roots

5 7.3 Iteration, Selection, and Variable Length Program Structures u The essence of evolution  iterative insofar as generation after generation of populations are assigned reproduction opportunities  selective, insofar as the better performing variants get a better chance to use these opportunities u Dawkins called this aspect cumulative selection  the effects of selection acting on one generation are inherited by the next

6 7.4 Evolvable Representations u Problem representation  most ML paradigm: a fairly constrained problem representation (Boolean, threshold, decision trees, etc) u Constraints  advantage: making the traversal of the solution space more tractable as long as the solution space is well tailored to the problem domain u GP search space  the problem space + the space of the representation of the problem

7 7.4 Evolvable Representation (2) u Ignoring Operators or Terminals  system should magnify the exploration of sections of the representation space that produce better results u Finding Solutions of the Correct length  GP can find a short or a long solution where a fixed length representation cannot u Modularization and Meta-Learning  표현방법 탐색 공간에 대한 연구  Modularization (chap 10)  Meta-Learning l information about the problem representation from one GP run is used to bias the search in later GP runs

8 7.5 The Emergence of Introns, Junk DNA, and Bloat u Angeline  the first GP researcher to associate this emergent “extra code” in GP with the concept of biological introns  “occasional occurrence” u Tackett  GP bloat was caused by blocks of code in GP individuals u A body of research has established that GP bloat is, in reality, caused by GP introns  introns are a persistent and problematic part of the GP process

What Can We Learn from Biological Introns u 생물학적 개념의 introns 과 GP 의 introns 은 거의 동일한 개념  phenotype 에 아무런 직접적 영향을 주지 않음  play some role in protecting good building blocks against destructive crossover  have indirect effect on survivability, the nature of the effect is different

Introns in GP Defined u Introns in GP  A feature of the genotype that emerges from the process of the evolution of variable length structures  does not directly affect the survivability of the GP individual u properties  introns are emergent and they do not directly affect the fitness of the individual u artificially inserted introns: artificial intron equivalents u Global  introns for every valid input to the program u local  only for the current fitness cases and not necessarily for other valid inputs

Why GP Introns Emerge u While introns do not affect the fitness of the individual, they do affect the likelihood that the individual’s descendents will survive u effective fitness  survivability of an individual’s offspring  The fitness of the parent. The fitter the parent, the more likely it is to be chosen for reproduction  the likelihood that genetic operators will affect the fitness of the parent’s children u introns emerge principally in response to the frequently destructive effects of genetic operators

Effective Fitness and Crossover u Complexity of the program  length or size of the program measured with a method that is natural for a particular representation u absolute complexity  total size of the program or block u effective complexity  the length of the active parts of the code within the program

(2) u Using fitness-proportion selection, block exchange crossover C j e : the effective complexity of program j C j a : the absolute complexity of program j p c : probability of crossover p j d : probability of destructive crossover f j : the fitness of the individual bar f t : average fitness of the population  the proportion of copies of a program in the next generation is the proportion produced by the selection operator minus the proportion of program destroyed by crossover

(3) u Rewrite u effective fitness  increase its effective fitness by lowering its effective complexity

Effective Fitness and Other Operator u Generalization to include the effects of other operator

Why Introns Grow Exponentially u Introns can provide very effective global protection against destructive crossover u 최적해에 근접한 개체는 fitness 를 증가시키는 것은 매우 힘들어지고, 최소한 현상태를 유지시키기 위해서 Effective fitness 를 증가시키는 방향을 선택한다.  Introns 증가 한계가 주어지지 않는다.

The Effects of Introns u introns may benefit evolution vs. introns almost always result in poor evolution and extended computation u issues about introns  Introns may have differing effects before and after exponential growth of introns begins  Different systems may generate different types of introns with different porbabilities  The extent to which genetic operators are destructive in their effect is likely to be a very important initial condition in intron growth  mutation and crossover may affect different types of introns differently

Problems Caused by Introns u Run stagnation, poor results, and a heavy drain on memory and CPU time  run stagnation: mutation 으로 해결 l intron 을 의미있는 코드로 변화시킴  poor results: introns 의 확장을 제한함

Possible Beneficial Effects of Introns u To promote parsimony in the real code  a high probability of destructive crossover  some introns in the population  a system that makes it relatively easier to reduce the amount of effective code than to add more introns u Structural protection against crossover

What to Do about Introns u Reduction of destructive effects  problem of bloat may be viewed in a more general way as the absence of homology in GP u Parsimony  the effect of parsimony pressure is to attach a penalty to the length of programs  see next slide u Changing the fitness function  the fitness function become variable -> GP individuals might find ways to improve their fitness

(2) u The effect of parsimony