A Schema-Based Evolutionary Alg’m. for Black-Box Optimization David A. Cape CS 448, Spring 2008 Missouri S & T.

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

A First Course in Genetic Algorithms
Biologically Inspired Computing: Operators for Evolutionary Algorithms
Lecture XXIII.  In general there are two kinds of hypotheses: one concerns the form of the probability distribution (i.e. is the random variable normally.
Stratification (Blocking) Grouping similar experimental units together and assigning different treatments within such groups of experimental units A technique.
Genetic Algorithms for Real Parameter Optimization Written by Alden H. Wright Department of Computer Science University of Montana Presented by Tony Morelli.
The Use of Linkage Learning in Genetic Algorithms By David Newman.
Linkage Learning in Evolutionary Algorithms. Recombination Missouri University of Science and Technology Recombination explores the search space Classic.
Genetic Algorithms Representation of Candidate Solutions GAs on primarily two types of representations: –Binary-Coded –Real-Coded Binary-Coded GAs must.
Genetic Algorithms as a Tool for General Optimization Angel Kuri 2001.
Introduction to AI (part two) Tim Watson G6.71
ISSPIT Ajman University of Science & Technology, UAE
Estimation of Distribution Algorithms Ata Kaban School of Computer Science The University of Birmingham.
Estimation of Distribution Algorithms Let’s review what have done in EC so far: We have studied EP and found that each individual searched via Gaussian.
Theory Chapter 11. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Theory Overview (reduced w.r.t. book) Motivations and problems Holland’s.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
1 Genetic Algorithms. CS The Traditional Approach Ask an expert Adapt existing designs Trial and error.
Hierarchical Allelic Pairwise Independent Function by DAVID ICLĂNZAN Present by Tsung-Yu Ho At Teilab,
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Chapter 14 Genetic Algorithms.
Theory Chapter 11. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Theory Overview Motivations and problems Holland’s Schema Theorem.
Chapter 2 Simple Comparative Experiments
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Regression Analysis Regression analysis is a statistical technique that is very useful for exploring the relationships between two or more variables (one.
1 An Overview of Evolutionary Computation 조 성 배 연세대학교 컴퓨터과학과.
Theory A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Chapter 11 1.
Institute for Statistics and Econometrics Economics Department Humboldt University of Berlin Spandauer Straße Berlin Germany CONNECTED TEACHING.
Intro. ANN & Fuzzy Systems Lecture 36 GENETIC ALGORITHM (1)
Schemata Theory Chapter 11. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Theory Why Bother with Theory? Might provide performance.
Estimation of Distribution Algorithms (EDA)
CS 484 – Artificial Intelligence1 Announcements Lab 3 due Tuesday, November 6 Homework 6 due Tuesday, November 6 Lab 4 due Thursday, November 8 Current.
Genetic Algorithms Michael J. Watts
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Computational Complexity Jang, HaYoung BioIntelligence Lab.
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.
Kansas State University Department of Computing and Information Sciences CIS 732: Machine Learning and Pattern Recognition Friday, 16 February 2007 William.
How to apply Genetic Algorithms Successfully Prabhas Chongstitvatana Chulalongkorn University 4 February 2013.
Lecture 2 Basics of probability in statistical simulation and stochastic programming Leonidas Sakalauskas Institute of Mathematics and Informatics Vilnius,
Why do GAs work? Symbol alphabet : {0, 1, * } * is a wild card symbol that matches both 0 and 1 A schema is a string with fixed and variable symbols 01*1*
Edge Assembly Crossover
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.
Contribution of second order evolution to evolutionary algorithms Virginie LEFORT July 11 th.
Sporadic model building for efficiency enhancement of the hierarchical BOA Genetic Programming and Evolvable Machines (2008) 9: Martin Pelikan, Kumara.
1 Chapter 3 GAs: Why Do They Work?. 2 Schema Theorem SGA’s features: binary encoding proportional selection one-point crossover strong mutation Schema.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Why do GAs work? Symbol alphabet : {0, 1, * } * is a wild card symbol that matches both 0 and 1 A schema is a string with fixed and variable symbols 01*1*
CAP6938 Neuroevolution and Artificial Embryogeny Evolutionary Computation Theory Dr. Kenneth Stanley January 25, 2006.
1 Statistical Analysis Professor Lynne Stokes Department of Statistical Science Lecture #10 Testing the Statistical Significance of Factor Effects.
By Ping-Chu Hung Advisor: Ying-Ping Chen.  Introduction: background and objectives  Review of ECGA  ECGA for integer variables ◦ Experiments and performances.
Genetic Algorithm(GA)
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Intelligent Exploration for Genetic Algorithms Using Self-Organizing.
Chapter 14 Genetic Algorithms.
Dr. Kenneth Stanley September 13, 2006
Introduction to Genetic Algorithm (GA)
Chapter 2 Simple Comparative Experiments
Modified Crossover Operator Approach for Evolutionary Optimization
Probability & Statistics Probability Theory Mathematical Probability Models Event Relationships Distributions of Random Variables Continuous Random.
Basic Concepts PhD Course.
Searching for solutions: Genetic Algorithms
Diseño de Experimentos
Machine Learning: UNIT-4 CHAPTER-2
Theory Chapter 11.
Genetic algorithms: case study
CS639: Data Management for Data Science
Traveling Salesman Problem by Genetic Algorithm
Self-Configuring Crossover
Population Based Metaheuristics
Presentation transcript:

A Schema-Based Evolutionary Alg’m. for Black-Box Optimization David A. Cape CS 448, Spring 2008 Missouri S & T

Motivation Arbitrary Additively Decomposable Functions Example: multivariate polynomial (sum of two 4-bit D-Traps) F(u, v, w, x, y, z) = F 0 (u, v, x, z) + F 1 (u, w, y, z) = { 3[(1-u)(1-v)(1-x)(1-z)] + 2[u(1-v)(1-x)(1-z) + …] + 1[uv(1-x)(1-z) + …] + 0[uvx(1-z) + …] + 4uvxz } + { 3[(1-u)(1-w)(1-y)(1-z)] + 2[u(1-w)(1-y)(1-z) + …] + 1[uw(1-y)(1-z) + …] + 0[uwy(1-z) + …] + 4uwyz } = {5uvxz - u - v - x - z + 3} + {5uwyz - u - w - y - z + 3} Building Block Hypothesis? F(1, 1, 1, 1, 1, 1) = 4+4 = 8F(1, 1, 0, 1, 0, 1) = 4+1 = 5 F(1, 0, 1, 0, 1, 1) = 1+4 = 5F(1, 0, 0, 0, 0, 1) = 1+1 = 2 F(1, 1, 0, 0, 0, 1) = 0+1 = 1F(1, 1, 1, 1, 0, 1) = 4+0 = 4 F avg (1, #, #, #, #, 1) = [ (1)+4(4)] / 16 =2.5 F avg (1, 1, #, #, #, 1) = [ (4)+2(0)] / 8 = 3.25 F avg (1, 1, #, 1, #, 1) = [8+5+2(4)] / 4 = 5.25 F avg (1, 1, 1, 1, #, 1) = [8+4)] / 2 = 6

Related Work Model-Building EAs use Estimation of Distribution (EDA) techniques hBOA Non-Model-Building EAs LLGA mGA TGA

Methodology Goals: Simplicity, generality, efficiency “Don’t Care” symbols (#) as alleles Mutation from zero or one to # Mutation from # to zero or one Uniform crossover Nondeterministic Representation Sampling of phenotypes for evaluation Small penalty for each # allele

“Agnostic EA” (AgEA) Allows ambiguity for each gene Derived from schema theory Uses traditional GA (TGA) operators Duality between monomials and schemata

Experimental Design “Arbitrary additively decomposable” Random multivariate polynomials Sums of trap subfunctions Not necessarily concatenated Not necessarily adjacent mGA with default parameters AgEA with equal number of evaluations

AgEA vs. TGA on polynomials (Problem difficulty was assessed subjectively)

Conclusion Novel EA concept based on # alleles Performs well on some simple problems Better than competent EAs? hBOA?

Future Work Comparison to messy GA, LLGA, hBOA Careful analysis of data Rigorous statistical tests Meta-schema theory?

Questions?