Inbreeding Properties of Geometric Crossover and Non- geometric Recombinations Alberto Moraglio & Riccardo Poli ECAI 2006.

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

Shortest Vector In A Lattice is NP-Hard to approximate
22C:19 Discrete Structures Induction and Recursion Spring 2014 Sukumar Ghosh.
6.1 Vector Spaces-Basic Properties. Euclidean n-space Just like we have ordered pairs (n=2), and ordered triples (n=3), we also have ordered n-tuples.
Linkage Learning in Evolutionary Algorithms. Recombination Missouri University of Science and Technology Recombination explores the search space Classic.
Computational Intelligence Winter Term 2011/12 Prof. Dr. Günter Rudolph Lehrstuhl für Algorithm Engineering (LS 11) Fakultät für Informatik TU Dortmund.
Topological Interpretation of Crossover Alberto Moraglio & Riccardo Poli GECCO 2004.
Geometric Landscape of Homologous Crossover for Syntactic Trees Alberto Moraglio & Riccardo Poli CEC 2005.
Geometric Crossover for the Permutation Representation Alberto Moraglio & Riccardo Poli GSICE 2005.
Evolutionary Computational Intelligence
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Geometric Crossover for Biological Sequences Alberto Moraglio, Riccardo Poli & Rolv Seehuus EuroGP 2006.
Population New Population Selection Crossover and Mutation Insert When the new population is full repeat Generational Algorithm.
4. Convergence of random variables  Convergence in probability  Convergence in distribution  Convergence in quadratic mean  Properties  The law of.
Doug Downey, adapted from Bryan Pardo, Machine Learning EECS 349 Machine Learning Genetic Programming.
Rooted Trees. More definitions parent of d child of c sibling of d ancestor of d descendants of g leaf internal vertex subtree root.
Geometric Crossover for Permutations with Repetitions: Application to Graph Partitioning A. Moraglio, Y-H. Kim, Y. Yoon, B-R. Moon & R. Poli PPSN 2006.
Topological Crossover for the Permutation Representation Alberto Moraglio & Riccardo Poli GECCO 2005.
EAs for Combinatorial Optimization Problems BLG 602E.
Geometric Crossovers for Supervised Motif Discovery Rolv Seehuus NTNU.
Geometric Interpretation of Crossover Alberto Moraglio BCTCS 2005.
Product Geometric Crossover for the Sudoku Puzzle Alberto Moraglio, Julian Togelius & Simon Lucas IEEE CEC 2006.
Geometric Crossover for Multiway Graph Partitioning Yong-Hyuk Kim, Yourim Yoon, Alberto Moraglio, and Byung-Ro Moon.
Geometric Unification of Evolutionary Algorithms Alberto Moraglio EvoPhD 2006.
Genetic Programming. Agenda What is Genetic Programming? Background/History. Why Genetic Programming? How Genetic Principles are Applied. Examples of.
0 Course Outline n Introduction and Algorithm Analysis (Ch. 2) n Hash Tables: dictionary data structure (Ch. 5) n Heaps: priority queue data structures.
Differential Evolution Hossein Talebi Hassan Nikoo 1.
Prepared by Barış GÖKÇE 1.  Search Methods  Evolutionary Algorithms (EA)  Characteristics of EAs  Genetic Programming (GP)  Evolutionary Programming.
1 Trees 2 Binary trees Section Binary Trees Definition: A binary tree is a rooted tree in which no vertex has more than two children –Left and.
Tree A connected graph that contains no simple circuits is called a tree. Because a tree cannot have a simple circuit, a tree cannot contain multiple.
What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.
Binary Trees. Binary Tree Finite (possibly empty) collection of elements A nonempty binary tree has a root element The remaining elements (if any) are.
Section 1.3 Segments & Their Measures 1/14. Geometric Vocabulary Postulate : Rules that are accepted without proof. Axiom : Synonym for postulate. Theorem.
Introduction to GAs: Genetic Algorithms How to apply GAs to SNA? Thank you for all pictures and information referred.
Introduction to Evolutionary Algorithms Session 4 Jim Smith University of the West of England, UK May/June 2012.
Dynamical Systems Model of the Simple Genetic Algorithm Introduction to Michael Vose’s Theory Rafal Kicinger Summer Lecture Series 2002.
Logical Reasoning:Proof Prove the theorem using the basic axioms of algebra.
Chapter 12 FUSION OF FUZZY SYSTEM AND GENETIC ALGORITHMS Chi-Yuan Yeh.
CHAPTER Continuity Series Definition: Given a series   n=1 a n = a 1 + a 2 + a 3 + …, let s n denote its nth partial sum: s n =  n i=1 a i = a.
Mining Evolutionary Model MEM Rida E. Moustafa And Edward J. Wegman George Mason University Phone:
Geometric Crossover for Sets, Multisets and Partitions Alberto Moraglio and Riccardo Poli Abstract We extend a geometric framework for interpreting crossover.
Mathematics. Session Vectors -2 Session Objectives  Vector (or Cross) Product  Geometrical Representation  Properties of Vector Product  Vector Product.
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
Product Geometric Crossover Alberto Moraglio and Riccardo Poli Abstract Geometric crossover is a representation-independent definition of crossover based.
MAT 1236 Calculus III Section 11.2 Series Part II
4 4.1 © 2016 Pearson Education, Ltd. Vector Spaces VECTOR SPACES AND SUBSPACES.
MAT 2401 Linear Algebra 4.2 Vector Spaces
COMP 170 L2 Page 1 Review for Midterm 2 Part II: Number Theory and Cryptography L06: RSA Part III: Logic L07, L08, L09 Part IV: Induction and Recurrence.
Series such as arise in applications, but the convergence tests developed so far cannot be applied easily. Fortunately, the Ratio Test can be used for.
Genetic Programming.
Evolutionary Algorithms Jim Whitehead
Postulates Lesson 2.5.
VECTOR SPACES AND SUBSPACES
Cirquent calculus Episode 15 About cirquent calculus in general
VECTOR SPACES AND SUBSPACES
Evolutionist approach
BASIC GEOMETRIC CONCEPTS
2.4 Use Postulates & Diagrams
Exploratory Exercises
The most important idea in logic: Validity of an argument.
Genetic Programming Chapter 6.
Genetic Programming Chapter 6.
Lecture 15: Least Square Regression Metric Embeddings
Genetic Programming Chapter 6.
Prove Statements about Segments and Angles
Population Based Metaheuristics
Chapter 11 Trees © 2011 Pearson Addison-Wesley. All rights reserved.
VECTOR SPACES AND SUBSPACES
Population Methods.
Presentation transcript:

Inbreeding Properties of Geometric Crossover and Non- geometric Recombinations Alberto Moraglio & Riccardo Poli ECAI 2006

Contents I.Geometric Crossover II.Inbreeding Properties of Geometric Crossover III.Notable Non-geometric Recombinations IV.Conclusions

I. Geometric Crossover

Geometric Crossover Line segment A binary operator GX is a geometric crossover if all offspring are in a segment between its parents. Geometric crossover is dependent on the metric x y

Geometric Crossover The traditional n-point crossover is geometric under the Hamming distance A B A B X X H(A,X) + H(X,B) = H(A,B)

Many Recombinations are Geometric Traditional Crossover extended to multary strings Recombinations for real vectors PMX, Cycle Crossovers for permutations Homologous Crossover for GP trees Ask me for more examples over a coffee!

Being geometric crossover is important because…. We know how the search space is searched by geometric crossover for any representation: convex search We know a rule-of-thumb on what type of landscapes geometric crossover will perform well: “smooth” landscape This is just a beginning of general theory, in the future we will know more!

Non-geometricity questions Existence of non-geometric crossovers: is any recombination a geometric crossover given a suitable distance? Proving non-geometricity: given a recombination, how can we prove that it is non-geometric crossover? Geometricity: to prove that an operator is geometric we need to find a metric for which offspring are in the metric segment between parents under this metric. Non-geometricity: to prove that a recombination is non- geometric requires to show that it is not geometric under any distance. This is difficult because there are infinitely many distances to rule out!!

II. Inbreeding Properties

Inbreeding Properties Properties of geometric crossover arising only from its axiomatic definition (metric axioms) Valid for any distance, probability distribution and solution representation. So all geometric crossovers have them. Based on inbreeding: breeding between close relatives

Purity Theorem: When both parents are the same P1, their child must be P1.

Convergence Theorem: C is the child of P1 and P2 and C is not P1. Then the recombination of C and P2 cannot produce P1.

Partition Theorem: C is the child of P1 and P2. Then the recombination of P1 and C and the recombination of C and P2 cannot produce the same offspring unless the offspring is C.

III. Non-geometric Recombinations

Non-geometricity and Inbreeding properties It is possible to prove non-geometricity of a recombination operator under any distance, any probability distribution and any represenation producing a single counter- example to any inbreeding property because they must hold for all geometric crossovers. Then if they do not hold, the operator is non- geometric.

Extended line crossover P1 P2 C Theorem: Extended line crossover is non-geometric. Proof: the converge property does not hold.

Koza’s subtree swap crossover P1P2=P1 C1C2 Theorem: Koza’s crossover is non-geometric. Proof: the property of purity does not hold.

Davis’s order crossover Theorem: Davis’s order crossover is non-geometric. Proof: the converge property does not hold.

Summary Geometric crossover: offspring are in the segment between parents under a suitable distance Proving non-geometricity is difficult: need to prove non- geometricity under all distances! Inbreeding properties of crossover (purity, convergence, partition): hold for all geometric crossovers, follow logically from axiomatic definition of crossover only Imbreeding properties allows to prove non-geometricity in a very simple way: producing a simple counter-example Non-geometric recombinations: Extended-line recombination, Koza’s subtree swap crossover, Davis’s order crossover These are notable exceptions: many other well-known recombination operators are geometric

Thank you for your attention! Questions?