The Defined Cliffs Variant in Dynamic Environments Abir Alharbi William Rand Rick Riolo

Slides:



Advertisements
Similar presentations
Reinforcement Learning
Advertisements

Programming exercises: Angel – lms.wsu.edu – Submit via zip or tar – Write-up, Results, Code Doodle: class presentations Student Responses First visit.
1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.
Tetris – Genetic Algorithm Presented by, Jeethan & Jun.
Student : Mateja Saković 3015/2011.  Genetic algorithms are based on evolution and natural selection  Evolution is any change across successive generations.
Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm
Genetic Algorithms for Real Parameter Optimization Written by Alden H. Wright Department of Computer Science University of Montana Presented by Tony Morelli.
On the Genetic Evolution of a Perfect Tic-Tac-Toe Strategy
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
Video Shot Boundary Detection at RMIT University Timo Volkmer, Saied Tahaghoghi, and Hugh E. Williams School of Computer Science & IT, RMIT University.
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.
CHAPTER 11 © 2006 Prentice Hall Business Publishing Macroeconomics, 4/e Olivier Blanchard Saving, Capital Accumulation, and Output Prepared by: Fernando.
Understanding the Semantics of the Genetic Algorithm in Dynamic Environments Abir Alharbi William Rand Rick Riolo
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Chapter 14 Genetic Algorithms.
Chapter 11: Saving, Capital Accumulation, and Output Copyright © 2009 Pearson Education, Inc. Publishing as Prentice Hall Macroeconomics, 5/e Olivier Blanchard.
Evolutionary Computational Intelligence Lecture 8: Memetic Algorithms Ferrante Neri University of Jyväskylä.
Controlled Observations of the Genetic Algorithm in a Changing Environment William Rand Computer Science and Engineering Center for the Study of Complex.
On the Evolution of the World Income by Charles I. Jones.
Carmine Cerrone, Raffaele Cerulli, Bruce Golden GO IX Sirmione, Italy July
Computer Science Genetic Algorithms10/13/10 1 An Investigation of Niching and Species Formation in Genetic Function Optimization Kalyanmoy Deb David E.
1 Time Scales Virtual Clocks and Algorithms Ricardo José de Carvalho National Observatory Time Service Division February 06, 2008.
Genetic Algorithms: A Tutorial
1 Reasons for parallelization Can we make GA faster? One of the most promising choices is to use parallel implementations. The reasons for parallelization.
Genetic Algorithm.
Revolutionizing the Field of Grey-box Attack Surface Testing with Evolutionary Fuzzing Department of Computer Science & Engineering College of Engineering.
Adaptive Kernel Density in Demographic Analysis Richard Lycan Institute on Aging Portland State University.
Choking Pressure Ratio Guidelines for Small Critical Flow Venturis
Economic Growth I CHAPTER 7.
Integrating Neural Network and Genetic Algorithm to Solve Function Approximation Combined with Optimization Problem Term presentation for CSC7333 Machine.
1 Evolvability Analysis for Evolutionary Robotics Sung-Bae Cho Yonsei University, Korea.
Schemata Theory Chapter 11. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Theory Why Bother with Theory? Might provide performance.
CS Machine Learning Genetic Algorithms (II).
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
Optimization Problems - Optimization: In the real world, there are many problems (e.g. Traveling Salesman Problem, Playing Chess ) that have numerous possible.
Chapter 3 Growth and Accumulation Item Etc. McGraw-Hill/Irwin Macroeconomics, 10e © 2008 The McGraw-Hill Companies, Inc., All Rights Reserved.
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.
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.
What is a QUASI-SPECIES By Ye Dan U062281A USC3002 Picturing the World through Mathematics.
Chapter 7 Sampling Distributions Statistics for Business (Env) 1.
Learning by Simulating Evolution Artificial Intelligence CSMC February 21, 2002.
Genetic Algorithms ML 9 Kristie Simpson CS536: Advanced Artificial Intelligence Montana State University.
MODELING THE RECPTIVE FIELD ORGANIZATION OF OPTIC FLOW SELECTIVE MST NEURONS Chen-Ping Yu +, William K. Page*, Roger Gaborski +, and Charles J. Duffy Dept.
Compositional Assemblies Behave Similarly to Quasispecies Model
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.
Multiple Regression I 1 Copyright © 2005 Brooks/Cole, a division of Thomson Learning, Inc. Chapter 4 Multiple Regression Analysis (Part 1) Terry Dielman.
Alice E. Smith and Mehmet Gulsen Department of Industrial Engineering
5. Implementing a GA 4 학습목표 GA 를 사용해 실제 문제를 해결할 때 고려해야 하는 사항에 대해 이해한다 Huge number of choices with little theoretical guidance Implementation issues + sophisticated.
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.
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*
Selection Methods Choosing the individuals in the population that will create offspring for the next generation. Richard P. Simpson.
CAP6938 Neuroevolution and Artificial Embryogeny Evolutionary Computation Theory Dr. Kenneth Stanley January 25, 2006.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
CAP6938 Neuroevolution and Artificial Embryogeny Evolutionary Comptation Dr. Kenneth Stanley January 23, 2006.
Chapter 15 Forecasting. Forecasting Methods n Forecasting methods can be classified as qualitative or quantitative. n Such methods are appropriate when.
Data Mining Techniques Applied in Advanced Manufacturing PRESENT BY WEI SUN.
Breeding Swarms: A GA/PSO Hybrid 簡明昌 Author and Source Author: Matthew Settles and Terence Soule Source: GECCO 2005, p How to get: (\\nclab.csie.nctu.edu.tw\Repository\Journals-
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Chapter 14 Genetic Algorithms.
Optimization Of Robot Motion Planning Using Genetic Algorithm
Bulgarian Academy of Sciences
○ Hisashi Shimosaka (Doshisha University)
Aiman H. El-Maleh Sadiq M. Sait Syed Z. Shazli
Presentation transcript:

The Defined Cliffs Variant in Dynamic Environments Abir Alharbi William Rand Rick Riolo King Saud University Northwestern University University of Michigan Mathematics Dept.Northwestern Institute on Center for the Study of Complex Systems A Case Study Using the Shaky Ladder Hyperplane-Defined Functions

Overview Shaky Ladder Hyperplane-Defined Functions and the Variants. The Defined Cliffs Variant. Experiment and Results. Performance, Satisficability, Robustness, Diversity. Conclusion and Future Work

Previous results of the sl-hdfs Two observations of the GA’s behavior on previous sl- hdfs variants (Cliffs, Smooth,Weight) are: (1) The sl-hdfs’ short elementary schemata lead to rapid performance increase early on relative to sl-hdfs built from longer schemata. (2)The unrestricted construction method with shaking by form allows for an increase in performance because it prevents premature convergence. These two observations have lead us to construct a new sl-hdf variant, “Defined Cliffs.”

The Defined Cliffs Variant In the Defined Cliffs variant the term “Defined” comes from the fact that the elementary schemata length is set to a defined length, and the term “Cliffs” comes from the fact that all other parameters are set similar to those in the Cliffs variant. In the “Defined Cliffs,” Variant we combine short elementary building blocks with the unrestricted construction method and shaking by form method.

The Experiment ParameterCliffsSmoothWeightDefined Cliffs Population size 1000 Mutation Rate0.001 Crossover Rate0.7 Generations1800 String length500 Selection TypeTournament, size 3 Number Elementary schemata50 Elementary Schemata Order8 Elementary Schemata lengthundefined 50 Mean, Variance of Int. schemata 3, 0 3, 13, 0 Intermediate Construction Method unrestricted random restricted random Restricted neighbor unrestricted random tδtδ 100, 1801 Number of Runs30

Performance Performance is the standard measure of how well the system performs. Figure 1 illustrates both the fitness of the best individual in the population (Best Performance) and the average fitness of the whole population (Average Performance) for t  = 100 and t  = 1801 averaged across 30 runs. The GA on the Defined Cliffs landscape performs very well and eventually discovers the optimal string. The GA is able to make rapid progress early on because the shorter elementary building blocks are easy to discover.

Figure 1

Comparing performance in all variants Figure 2 displays the Best fitness averaged over 30 runs of all four variants: Defined Cliffs, Cliffs, Weight, and Smooth in a regularly changing environment with t  = 100. The GA obtains the best results throughout the runs when operating in the Defined Cliffs landscape since :  The early rapid rise in fitness happens because it is discovering the short building blocks early on and thus is able to increase its fitness quickly (similar to Weight variant).  The rough changes in the landscape prevent the population from prematurely converging and allow the population to continue to increase in fitness ( similar to the Cliffs variant).

Figure 2

Satisficability Satisficability is the ability of the system to maintain a certain level of fitness and to avoid egregious errors. Figure 3 illustrates Threshold Satisficability for t  = 100 in all four variants. The GA operating in the Defined Cliffs environment is able to outperform the other environments early on. In fact, a large number of individuals quickly have a fitness exceeding half the optimal value. This is because the Defined Cliffs discovers the short building blocks early on and achieves a high level of threshold satisficability.

Figure 3

Robustness Robustness is a measure of how the system responds to change in the environment. We present the Loss Robustness of the best individual in the population (Best Robustness) for t  = 100 across the entire run (averaged across 30 runs). Loss Robustness is the current generation’s fitness divided by the previous generation’s fitness. If this value exceeds 1.0 then Loss Robustness is 1.0. Figure 4 displays these results in all four variants. The Defined Cliffs variant shows the largest drops in the early generations but it is also the first variant to stop being affected by the shakes, which indicates that the GA is able to find the optimal string faster in this variant.

Figure 4

Diversity Diversity is a measure of how different the members of the population are. To measure Bitwise Diversity, we use the scaled hamming distance of the population averaged across all pairwise combinations of individuals (Average Diversity). Diversity increases when selection pressure decreases. Since there is little change in the selection pressure in the Weight variant, the diversity, after its initial increase, gradually levels off. In the Cliffs, Smooth and Defined Cliffs environments there is more change in the selection pressure when the ladder is shaken causing the diversity decreases immediately after the change.

Figure 5

Conclusions This paper describes a method for constructing a new variant of the sl-hdfs, the Defined Cliffs. The Defined Cliffs variant uses short elementary schemata with sharp transitions in the environment. The results presented here show that GA behavior is superior on this new variant, compared to all previously explored variants. The GA operating in the Defined Cliffs environment exhibits interesting behavior on the non-performance metrics that we examined. These experiments show that the construction of intermediate schemata, the method of changing those intermediate schemata and the length of initial building blocks can dramatically affect the behavior of the GA.

Future Work The sl-hdfs are currently a model of problems where there are basic constant building blocks, changing sub-problems, and a constant global optimum. For future work other models will be examined. In future research we hope to develop a model that shows how changes in various parameters affect diversity and other measures. By accumulating regular observations in this environment we can observe how these interactions might occur and then hypothesize models to explain them.

Acknowledgements U of M’s Center for the Study of Complex Systems and Carl Simon for financial support for Rick Riolo and computational resources Northwestern Institute on Complex Systems for support of William Rand

Any Questions?

Defined Cliffs Short length Elementary Schema Pothole Elementary Schema Elementary Schema Elementary Schema Intermediate Schema Highest Level Schema Delete Intermediate Schemata Generate New Intermediate Schemata Intermediate Schema Intermediate Schema Intermediate Schema Shaking the ladder

Cliffs Undefined length Elementary Schema Pothole Elementary Schema Elementary Schema Elementary Schema Intermediate Schema Highest Level Schema Delete Intermediate Schemata Generate New Intermediate Schemata Intermediate Schema Intermediate Schema Intermediate Schema Shaking the ladder

Weight Short length Pothole Elementary Schema Elementary Schema Elementary Schema Elementary Schema Elementary Schema Intermediate Schema Intermediate Schema Highest Level Schema Delete Intermediate Weights Generate New Intermediate Weights Shaking the ladder

Smooth undefined length Pothole Elementary Schema Elementary Schema Elementary Schema Elementary Schema Elementary Schema Intermediate Schema Intermediate Schema Highest Level Schema Delete Intermediate Schemata Generate New Intermediate Schemata Shaking the ladder

Unrestricted Construction Elementary Schema Elementary Schema Pothole Elementary Schema Elementary Schema Intermediate Schema Highest Level Schema Intermediate Schema Intermediate Schema Intermediate Schema Pothole

Restricted Construction Pothole Elementary Schema Elementary Schema Elementary Schema Intermediate Schema Intermediate Schema Highest Level Schema Elementary Schema Elementary Schema

Random Construction Elementary Schema 10****** Elementary Schema **00**** Elementary Schema ****11** Elementary Schema ******10 Intermediate Schema 10**11** Intermediate Schema **00**10

Neighbor Construction Elementary Schema 10****** Elementary Schema **00**** Elementary Schema ****11** Elementary Schema ******10 Intermediate Schema 1000**** Intermediate Schema ****1110

Shaking by Form Elementary Schema Elementary Schema Elementary Schema Elementary Schema Intermediate Schema (w = 3) Intermediate Schema (w = 3) Elementary Schema Elementary Schema Elementary Schema Elementary Schema Intermediate Schema (w = 3) Intermediate Schema (w = 3)

Shaking by Weight Elementary Schema Elementary Schema Elementary Schema Elementary Schema Intermediate Schema (w = 3.12) Intermediate Schema (w = 2.77) Elementary Schema Elementary Schema Elementary Schema Elementary Schema Intermediate Schema (w = 2.12) Intermediate Schema (w = 2.5)

Cliffs Variant Performance Results

Smooth Variant Performance Results

Weight Variant Performance Results