A Probabilistic Functional Crossover Operator

Slides:



Advertisements
Similar presentations
Representing Hypothesis Operators Fitness Function Genetic Programming
Advertisements

Genetic Statistics Lectures (5) Multiple testing correction and population structure correction.
Intelligent Control Methods Lecture 12: Genetic Algorithms Slovak University of Technology Faculty of Material Science and Technology in Trnava.
K.U. Leuven Leuven Morphological Normalization and Collocation Extraction Jan Šnajder, Bojana Dalbelo Bašić, Marko Tadić University of Zagreb.
Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)
Evolving Driving Controllers using Genetic Programming Marc Ebner and Thorsten Tiede.
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.
Last day… started covering basics of heredity & Mendelian genetics Mendel’s experiments showed that heredity is particulate, not blending Started to talk.
Mechanics of Genetic Programming
Estimation of Distribution Algorithms Ata Kaban School of Computer Science The University of Birmingham.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Doug Downey, adapted from Bryan Pardo, Machine Learning EECS 349 Machine Learning Genetic Programming.
Learning to Advertise. Introduction Advertising on the Internet = $$$ –Especially search advertising and web page advertising Problem: –Selecting ads.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
2 What Genetic Programming ISN'T: What Genetic Programming ISN'T: Engineering a breed of purple carrots. Engineering a breed of purple carrots. Analyzing.
Crossover Operation with Different Parents Crossover Operation with Identical Parents.
Local Search and Stochastic Algorithms
What is Neutral? Neutral Changes and Resiliency Terence Soule Department of Computer Science University of Idaho.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Khaled Rasheed Computer Science Dept. University of Georgia
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 Algorithm.
1 An Overview of Evolutionary Computation 조 성 배 연세대학교 컴퓨터과학과.
Computational Biology, Part D Phylogenetic Trees Ramamoorthi Ravi/Robert F. Murphy Copyright  2000, All rights reserved.
Derivative Free Optimization G.Anuradha. Contents Genetic Algorithm Simulated Annealing Random search method Downhill simplex method.
Automated discovery in math Machine learning techniques (GP, ILP, etc.) have been successfully applied in science Machine learning techniques (GP, ILP,
Sampling Theory and Some Important Sampling Distributions.
Genetic Algorithms. Overview “A genetic algorithm (or GA) is a variant of stochastic beam search in which successor states are generated by combining.
Guarding Against Premature Convergence while Accelerating Evolutionary Search July 9, 2010 Josh C. Bongard Morphology, Evolutionary and Cognition Laboratory.
MEER 111 – Global Research Solving Real-World Problems with Evolutionary Algorithms Daniel Tauritz, Ph.D. Associate Professor of Computer Science.
Genetic Algorithms. Solution Search in Problem Space.
Genetic Algorithm(GA)
George Yauneridge.  Machine learning basics  Types of learning algorithms  Genetic algorithm basics  Applications and the future of genetic algorithms.
Computing & Information Sciences Kansas State University Lecture 42 of 42 CIS 732 Machine Learning & Pattern Recognition Lecture 42 of 42 Genetic Programming.
1 Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations.
Genetic Algorithm (Knapsack Problem)
Genetic Programming.
Introduction to genetic algorithm
Introduction to Genetic Algorithms and Evolutionary Computing
Genetic Algorithm in TDR System
W.B. Langdon Computer Science University College, London
Automated Reverse Engineering of Nonlinear Dynamical Systems
A Comparison of Simulated Annealing and Genetic Algorithm Approaches for Cultivation Model Identification Olympia Roeva.
Introduction to Genetic Algorithm (GA)
Results – 100 Independent Trials Results – Single Trial
Genetic Algorithms overview
AP Biology – Lecture #4 Big Idea #1 – Evolution Change in the genetic makeup of a population over time IS evolution. Adapted from Rebecca Rehder Wingerden.
Evolution & Natural Selection
Artificial Intelligence Chapter 4. Machine Evolution
Evolution Notes.
Evidence. Evidence Embryonic Development.
Chapter 5: Probabilistic Analysis and Randomized Algorithms
Introduction to Artificial Intelligence Lecture 11: Machine Evolution
Modern Evolutionary Biology I. Population Genetics
Artificial Intelligence Chapter 4. Machine Evolution
EE368 Soft Computing Genetic Algorithms.
Boltzmann Machine (BM) (§6.4)
6 Crossover -The Center of the Storm
Genetic Programming Chapter 6.
Genetic Programming.
Genetic Programming Chapter 6.
Evidence for Evolution
Genetic Programming Chapter 6.
Chapter 5: Probabilistic Analysis and Randomized Algorithms
Modern Evolutionary Theory
Phylogeny and the Tree of Life
Steady state Selection
Biology & Nature of Science
GA.
Presentation transcript:

A Probabilistic Functional Crossover Operator for Genetic Programming Josh Bongard Morphology, Evolution and Cognition Laboratory Department of Computer Science University of Vermont

Crossover operators Headless chicken crossover (Jones, 1995) Cross an existing tree with a new, randomly-created one Size fair crossover (Langdon, 1999) Cross subtrees with probability proportional to their size similarity Deterministic homologous crossover (D’haeseleer, 1994) Cross subtrees based on the similarity of their relative position within their tree Probabilistic homologous crossover (Langdon, 1999) Cross subtrees with prob. prop. to their relative positions within their trees

Crossover operators Semantically Driven Crossover (Beadle and Johnson, 2008) Cross trees, and only retain children if they differ semantically from parents Enzyme genetic programming (Lones and Tyrrell, 2001) Constructive linear GP: elements attach to one another; Crossover: if donated elements attach to parent, keep them; otherwise, discard.

of Natural Selection (1930): “Probability of a mutation Snipping * + sin 0.8 x / y (dx/dt=) (dy/dt=) (dx/dt=) * (dy/dt=) / [-24.0,48.3] + sin x y [-0.03,0.05] 0.8 x x [0.8,0.8] [0.3,0.35] [0.3,0.35] Bongard, J and Lipson, H (2007). Proceedings of the National Academy of Sciences, 104(24): 9943-9948. Ronald Fisher: population biology, modern statistics: The Genetical Theory of Natural Selection (1930): “Probability of a mutation being favorable is inversely proportional to its magnitude.” (dx/dt=) * (dy/dt=) / + 0.04 x y 0.8 x

+ Deterministic Functional Crossover (GPTP 2009) [] [0.1, 0.9] y [-0.3, 0.6] [0.0, 0.9] x + [-0.3, 0.6] [0.3, 0.3] x 0.3

Probabilistic Functional Crossover (GECCO 2010) x y [-0.3, 0.6] [0.1, 0.9] [-0.83, 2.72] x y 0.424 0.1 2.0003

Probabilistic Functional Crossover (GECCO 2010) x y [-0.3, 0.6] [0.1, 0.9] [-0.83, 2.72] x y 0.424 0.1 2.0003 x y 0.424/ 2.5243 0.1 /2.5243 2.0003/ (2.0003+0.424+0.1)

Probabilistic Functional Crossover (GECCO 2010) x y [-0.3, 0.6] [0.1, 0.9] [-0.83, 2.72] x y 0.424 0.1 2.0003 x y 0.424/ 2.5243 0.1 /2.5243 2.0003/ (2.0003+0.424+0.1) 1-0.792 x 1-0.167 y 1-0.039

Probabilistic Functional Crossover (GECCO 2010) x y [-0.3, 0.6] [0.1, 0.9] [-0.83, 2.72] x y 0.424 0.1 2.0003 0.208 x 0.833 y 0.961 x y 0.424/ 2.5243 0.1 /2.5243 2.0003/ (2.0003+0.424+0.1) 1-0.792 x 1-0.167 y 1-0.039

Results

Results

Results

Results

Results

Results

Results ~9.2% ~4.5% ~11.2%

Results Random crossover D-FXO P-FXO

Results Random crossover D-FXO P-FXO