2 What Genetic Programming ISN'T: What Genetic Programming ISN'T: Engineering a breed of purple carrots. Engineering a breed of purple carrots. Analyzing.

Slides:

Advertisements

Similar presentations

Exact and heuristics algorithms

Advertisements

Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)

1 Review Define the terms genes pool and relative frequency Predict Suppose a dominant allele causes a plant disease that usually kills the plant before.

Why is reproduction important? Is a process that creates new offspring. DNA or genes are passed from one generation to the next. Reproduction helps populations.

Valery Frolov.  The algorithm  Fitness function  Crossover  Mutation  Elite individuals  Reverse mutations  Some statistics  Run examples.

Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.

1 Chapter 13 Artificial Life: Learning through Emergent Behavior.

1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.

A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.

Introduction to Genetic Algorithms Yonatan Shichel.

Early work in intelligent systems Alan Turing (1912 – 1954) Arthur Samuel ( )

Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.

Genetic Art. Network Record Using Network Information Chicago Evanston ParisMoscow.

Research Trends in AI Maze Solving using GA Muhammad Younas Hassan Javaid Danish Hussain

Evolutionary Computation Application Peter Andras peter.andras/lectures.

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.

Genetic Programming. Agenda What is Genetic Programming? Background/History. Why Genetic Programming? How Genetic Principles are Applied. Examples of.

Genetic Programming Dinesh Dharme Prateek Srivastav Pankhil Chheda

Genetic Programming.

Slides are based on Negnevitsky, Pearson Education, Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming n Evolution.

Initial Value Problem: Find y=f(x) if y’ = f(x,y) at y(a)=b (1) Closed-form solution: explicit formula -y’ = y at y(0)=1 (Separable) Ans: y = e^x (2)

Evolutionary Algorithms and Artificial Intelligence Paul Grouchy PhD Candidate University of Toronto Institute for Aerospace Studies

Genetics Notes. Lab There can be many different traits for a human characteristic. 2. Inherited traits are passed from parents to offspring.

Problems Premature Convergence Lack of genetic diversity Selection noise or variance Destructive effects of genetic operators Cloning Introns and Bloat.

B1.7 Evolution Theories of Evolution Classification and evolution

SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.

Evolution Strategies Evolutionary Programming Genetic Programming Michael J. Watts

© Negnevitsky, Pearson Education, Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming Evolution strategies Evolution.

Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.

Sources of Inherited Variation Mutations & Sexual Reproduction.

What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.

An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay

Genetic Algorithms K.Ganesh Reasearch Scholar, Ph.D., Industrial Management Division, Humanities and Social Sciences Department, Indian Institute of Technology.

GENETIC CONTINUITY. A METHOD OF REPRODUCTION IN WHICH ALL THE GENES ARE PASSED ON TO THE OFFSPRING COME FROM A SINGLE PARENT AND ARE GENETICALLY IDENTICAL.

G ENETIC A LGORITHMS Ranga Rodrigo March 5,

1 Genetic Algorithms and Ant Colony Optimisation.

Genetic Algorithms What is a GA Terms and definitions Basic algorithm.

ECE 103 Engineering Programming Chapter 52 Generic Algorithm Herbert G. Mayer, PSU CS Status 6/4/2014 Initial content copied verbatim from ECE 103 material.

Genetic Algorithms. The Basic Genetic Algorithm 1.[Start] Generate random population of n chromosomes (suitable solutions for the problem) 2.[Fitness]

GENETIC PROGRAMMING. THE CHALLENGE "How can computers learn to solve problems without being explicitly programmed? In other words, how can computers be.

Automated discovery in math Machine learning techniques (GP, ILP, etc.) have been successfully applied in science Machine learning techniques (GP, ILP,

Your tables are your teams. Place each question under the correct learning target. Work together to get the most points. This is a fun way to study for.

Introduction Genetic programming falls into the category of evolutionary algorithms. Genetic algorithms vs. genetic programming. Concept developed by John.

Members: Goh Zhi Hwee See Yong Chun Ryan Lau Meng Fanbo Survival of the fittest Evolution Vs. R-Evolution It is not the strongest of the species that survives,

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.

John R. Koza [Edited by J. Wiebe] 1. GENETIC PROGRAMMING 2.

John R. Koza [Edited by J. Wiebe] 1. GENETIC PROGRAMMING 2.

Genetic Algorithms An Evolutionary Approach to Problem Solving.

Genetic Algorithm(GA)

Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.

July 6, 2016Knowledge-Based System, Lecturer # 09 1 Knowledge Based System Lecture #09 Dr. Md. Hasanuzzaman Assistant Professor Department of Computer.

Introduction to Genetic Algorithms

Using GA’s to Solve Problems

Objective: Understand the Key Events in Darwin’s Life

Evolution Strategies Evolutionary Programming

GENETIC PROGRAMMING BBB4003.

B1.7 Evolution Theories of Evolution Classification and evolution

In several species of birds, the males show off their bright colors and long feathers. The dull colored females usually pick the brightest colored males.

Basics of Genetic Algorithms (MidTerm – only in RED material)

B1.7 Evolution Theories of Evolution Classification and evolution

Natural Selection & Evolution

Chapter 13 Review.

Basics of Genetic Algorithms

GENETIC PROGRAMMING BBB4003.

B6 content – Inheritance, Variation and Evolution (Paper 2)

Presentation transcript:

2 What Genetic Programming ISN'T: What Genetic Programming ISN'T: Engineering a breed of purple carrots. Engineering a breed of purple carrots. Analyzing the human genome Analyzing the human genome A way to create smarter humans. A way to create smarter humans. What Genetic Programming IS: What Genetic Programming IS: A way to create smarter computers. A way to create smarter computers. Fun. Fun.

3 A big Q in A.I. "How can computers learn to solve problems without being explicitly programmed?"  Arthur Samuel (1959)  Arthur Samuel (1959)

4 The GP Guide to Evolution Charles Darwin

5 Charles Darwin

6 Gregor Mendel “The Father of Genetics”

7 “The Code is Alive”

8 Basic Steps of GP 1. Populate Generation 0 with random computer programs. 1. Evaluate how “fit” each program is. 2. Is the “best-so-far” program “fit enough”? 3. Use the “fitness” values to determine which programs will produce offspring, to create the Next Generation. 2. Output the “best-so-far” program.

9 Preparation Program Ingredients Program Ingredients (math? “rt 90”? “ifelse”? “fd 1.0”?) (math? “rt 90”? “ifelse”? “fd 1.0”?) Fitness Measure Fitness Measure How good (attractive) is a program (creature)? How good (attractive) is a program (creature)? Parameters Parameters (e.g. pop. size, mutation probability, etc.) (e.g. pop. size, mutation probability, etc.)

10 Example: Symbolic Regression Given: Some points Find: f(x) = x 2 + x + 1 Ingredients {x, random constants between -5.0 and 5.0} {+, -, *, (protected division) } A “program” is a math function.

11 Into the DNA Forest… Generation 0 A program is just a tree. Pop. Size = 4 (x + 1) – 01 + (x * x)2 + 0x * (-1 – (-2))

12 Fitness Measure

13 The Birds and the Bytes… 3 Fundamental Genetic Operations 3 Fundamental Genetic Operations Cloning (Asexual Reproduction) Cloning (Asexual Reproduction) Mutation Mutation Crossover (Recombination) Crossover (Recombination)

14 Cloning Fitness =.67 Generation 0 Generation 1 COPY Fitness =.67

15 Mutation Fitness = 1.70 Generation 0 Generation 1 Mutate Fitness = ?

16 Crossover Crossover Generation 0Generation 1

17 Gen 0  Gen 1 Copy Mutate Crossover

18 On to the turtles... Genetic Programming in NetLogo...