Something about Building Block Hypothesis Ying-Shiuan You Taiwan Evolutionary Intelligence LAB 2009/10/31.

Slides:



Advertisements
Similar presentations
Genetic Algorithms Genetic Programming Ata Kaban School of Computer Science University of Birmingham 2003.
Advertisements

A First Course in Genetic Algorithms
Using Parallel Genetic Algorithm in a Predictive Job Scheduling
Linkage Problem, Distribution Estimation, and Bayesian Networks Evolutionary Computation 8(3) Martin Pelikan, David E. Goldberg, and Erick Cantu-Paz.
Genetic Algorithm with Limited Convergence 1 Simple Selectorecombinative GAs Scale poorely on hard problems (multimodal, deceptive, high degree of subsolution.
Institute of Intelligent Power Electronics – IPE Page1 Introduction to Basics of Genetic Algorithms Docent Xiao-Zhi Gao Department of Electrical Engineering.
Introduction to AI (part two) Tim Watson G6.71
1 Wendy Williams Metaheuristic Algorithms Genetic Algorithms: A Tutorial “Genetic Algorithms are good at taking large, potentially huge search spaces and.
1 Structure of search space, complexity of stochastic combinatorial optimization algorithms and application to biological motifs discovery Robin Gras INRIA.
Genetic Algorithms1 COMP305. Part II. Genetic Algorithms.
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
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.
Hierarchical Allelic Pairwise Independent Function by DAVID ICLĂNZAN Present by Tsung-Yu Ho At Teilab,
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.
Evolutionary Computational Intelligence Lecture 8: Memetic Algorithms Ferrante Neri University of Jyväskylä.
Mathematical Models of GAs Notes from * Chapter 4 of Mitchell’s An Intro. to GAs * Neal’s Research CS 536 – Spring 2006.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Genetic Algorithms: A Tutorial
1 Just what are “building blocks”? How do (should) Evolutionary Algorithms “work”? Just what are “building blocks”? How do (should) Evolutionary Algorithms.
EURO / INFORMS İstanbul 2003 July A GENETIC ALGORITHM FOR PARALLEL MACHINE TOTAL TARDINESS PROBLEM M. Furkan Kıraç Ümit Bilge Müjde Kurtulan Department.
Genetic algorithms. Genetic Algorithms in a slide  Premise Evolution worked once (it produced us!), it might work again  Basics Pool of solutions Mate.
© Negnevitsky, Pearson Education, Lecture 11 Evolutionary Computation: Genetic algorithms Why genetic algorithm work? Why genetic algorithm work?
Genetic Algorithms Beasley, Bull and Martin,
Theory A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Chapter 11 1.
Computing & Information Sciences Kansas State University Friday, 21 Nov 2008CIS 530 / 730: Artificial Intelligence Lecture 35 of 42 Friday, 21 November.
林偉楷 Taiwan Evolutionary Intelligence Laboratory.
Introduction to Genetic Algorithms and Evolutionary Computation
A Brief Introduction to GA Theory. Principles of adaptation in complex systems John Holland proposed a general principle for adaptation in complex systems:
Schemata Theory Chapter 11. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Theory Why Bother with Theory? Might provide performance.
10/12/20151 V. Evolutionary Computing A. Genetic Algorithms.
CS 484 – Artificial Intelligence1 Announcements Lab 3 due Tuesday, November 6 Homework 6 due Tuesday, November 6 Lab 4 due Thursday, November 8 Current.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Genetic Algorithms Michael J. Watts
ART – Artificial Reasoning Toolkit Evolving a complex system Marco Lamieri Spss training day
Theory Chapter 11. A.E. Eiben and J.E. Smith, EC Theory, modified by Ch. Eick Overview Motivations and problems Holland’s Schema Theorem – Derivation,
Soft Computing A Gentle introduction Richard P. Simpson.
Genetic Algorithms Siddhartha K. Shakya School of Computing. The Robert Gordon University Aberdeen, UK
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.
GAs: why do they sometimes not work? n The coding moves the GA to operate on a different search space --- bad coding might deceive the GA or might slow.
15/06/2003NORPIE 2004, Trondheim1 Genetic Optimization of Electric Machines, a State of the Art Study S. E. Skaar, R. Nilssen.
Artificial Intelligence Chapter 4. Machine Evolution.
Niching Genetic Algorithms Motivation The Idea Ecological Meaning Niching Techniques.
Introduction to Evolutionary Computation Prabhas Chongstitvatana Chulalongkorn University WUNCA, Mahidol, 25 January 2011.
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*
Chapter 9 Genetic Algorithms.  Based upon biological evolution  Generate successor hypothesis based upon repeated mutations  Acts as a randomized parallel.
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.
1. Genetic Algorithms: An Overview 4 학습목표 GA 의 기본원리를 파악하고, Prisoner’s dilemma 와 sorting network 에의 응용 및 이론적 배경을 이해한 다.
In the name of ALLAH Presented By : Mohsen Shahriari, the student of communication in Sajad institute for higher education.
Discovering Interesting Patterns for Investment Decision Making with GLOWER-A Genetic Learner Overlaid With Entropy Reduction Advisor : Dr. Hsu Graduate.
Sporadic model building for efficiency enhancement of the hierarchical BOA Genetic Programming and Evolvable Machines (2008) 9: Martin Pelikan, Kumara.
GENETIC ALGORITHMS Tanmay, Abhijit, Ameya, Saurabh.
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
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.
Presenter : Tsung-Yu Ho Review Mixing Problem Categories Crossover as a Mixer (√) Crossover as a Innovator (√) Crossover as a Disrupter All.
Genetic Algorithms An Evolutionary Approach to Problem Solving.
Advanced AI – Session 7 Genetic Algorithm By: H.Nematzadeh.
Dr. Kenneth Stanley September 13, 2006
C.-S. Shieh, EC, KUAS, Taiwan
A Gentle introduction Richard P. Simpson
Traveling Salesman Problem by Genetic Algorithm
Genetic Algorithm Soft Computing: use of inexact t solution to compute hard task problems. Soft computing tolerant of imprecision, uncertainty, partial.
Presentation transcript:

Something about Building Block Hypothesis Ying-Shiuan You Taiwan Evolutionary Intelligence LAB 2009/10/31

Adaptive Capacity Some population based search algorithm called “adaptive.” – The avg. fitness of the populations “grows” as generation. This feature of GA is called “adaptive capacity.” – Building Block Hypothesis is currently dominant explanation. 2

The Schema Theorem If m(H,t+1) > m(H,t), the schema H grows. Lower-bound estimation of schema growth. Consider only destructive forces. Minimal, sequential, superior (ms 2 ) schemata grow. Identifies building blocks of a good solution. Holland (1975), Adaptation in Natural and Artificial Systems, The MIT Press

Building Block Hypothesis Goldberg’s words, “… we construct better and better strings from the best partial solutions of past samplings”(Goldberg, 1989, p. 41) “…a genetic algorithm seek near optimal performance through the juxtaposition of short, low- order, high-performance schemas”(Goldberg, 1989) 4 Goldberg, David E (1989), Genetic Algorithms in Search, Optimization and Machine Learning, Kluwer Academic Publishers, Boston, MA.

Two Landscape Features of BBH The presence of short, low-order, highly fit schemas, i.e. building block. The presence of “stepping stone” solutions which combine BBs to create even higher fitness schemas. 5 Stephanie Forrest & Melanie Mitchell (1993), Relative building-block fitness and building-block hypothesis.

Nearly Decomposable Problems We do not want to solve every problem. OneMax NIAH Too simple: simple heuristic, hill climbing Too difficult: enumeration Nearly decomposable problems Tain-Li Yu’s slide on 2006 GA course

Fully Deception Low-order estimates mislead GA. x* = 111: f 111 > f i, i ≠ 111. Require complementary schemata better than competitors. Tain-Li Yu’s slide on 2006 GA course

Trap Function Ackley, Local searcher would go to the wrong optima. In general: to be deceptive. Goldberg & Deb (1993). Analyzing Deception in Trap Functions. Tain-Li Yu’s slide on 2006 GA course

Theories Develop on m-k decomposable Convergence Time (Thierens & Goldberg, 1994) Population size – BB supply (Goldberg et al. 2001) – Decision making (Goldberg et al. 1992) – Decision making + supply (Harik et al. 1997) – Model building (Yu et al. 2007) 9 Reference: Thierens & Goldberg (1994), Convergence models of genetic algorithm selection schemes. Goldberg et al (2001), On the supply of building blocks. Goldberg et al (1992), Genetic algorithms, noise, and the sizing of populations. Harik et al (1997), The gambler's ruin problem, genetic algorithms, and the sizing of populations. Yu et al (2007), Population Sizing for entropy-based model building in genetic algorithms.

GA Design Theory Goldberg, – Know what GA processes: Building blocks (BBs). – Ensure BB growth. – Know BB challengers. – Ensure BB supply. – Ensure BB speed. – Ensure good BB decisions. – Ensure good BB mixing (exchange). Goldberg (2002), Design of Innovation.

Skepticism of the BBH Not realistic BB exist? – In real problem, it’s more likely existing BBs. No overlap BB? – It ‘s more likely exist! But too hard to analysis and design at this time. How about real-value? – Too hard to develop theories on real number. 11

Skepticism of the BBH (cont’d) Weak theoretical foundations. (Wright et al. 2003) “The various claims about Gas that are traditionally made under the name of the building block hypothesis have, to date, no basis in theory, in some cases, are simply incoherent.” 12 Reference: Wright et al. (2003), Implicit Parallelism.

Skepticism of the BBH (cont’d) Experiments side. (Forrest and Mitchell, 1993) “While the disruptive effects that we observed (hitchhiking, premature convergence, etc.) …, there is as yet no theorem associating them with the building-block structure of a given problem.” 13 Reference: Forrest & Mitchell (1993), Relative building-block fitness and building-block hypothesis.

Hitchhiking Once an instance of a high-fitness schema is discovered, the “unfit” material, especially that just next to the fit parts, spread along with the fit material. Slows discovery of good schemas in those positions. Sampling of the different regions is not independent. 14

Hitchhiking (cont’d) 15

Skepticism of the BBH (cont’d) Strong Assumption. (Burjorjee, 2009) Two strong assumption: – Abundant Basic Building Blocks – Heirarchical Synergism Too strong to accept this hypothesis. 16 Reference: Burjorjee (2009), The Fundamental Problem with the Building Block Hypothesis.