EC Awards Lecture ~ Spring 2008 Advances in Parameterless Evolutionary Algorithms Lisa Guntly André Nwamba Research Advisor: Dr. Daniel Tauritz Natural.

Slides:



Advertisements
Similar presentations
Computational Intelligence Winter Term 2009/10 Prof. Dr. Günter Rudolph Lehrstuhl für Algorithm Engineering (LS 11) Fakultät für Informatik TU Dortmund.
Advertisements

A First Course in Genetic Algorithms
Biologically Inspired Computing: Operators for Evolutionary Algorithms
CS6800 Advanced Theory of Computation
Parameter control Chapter 8. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Parameter Control in EAs 2 Motivation 1 An EA has many.
1 Evolutionary Computational Inteliigence Lecture 6b: Towards Parameter Control Ferrante Neri University of Jyväskylä.
Parameter Control A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Chapter 8.
GP Applications Two main areas of research Testing genetic programming in areas other techniques have been applied to. Applying genetic programming to.
Genetic Algorithms Representation of Candidate Solutions GAs on primarily two types of representations: –Binary-Coded –Real-Coded Binary-Coded GAs must.
Self-Adaptive Semi-Autonomous Parent Selection (SASAPAS) Each individual has an evolving mate selection function Two ways to pair individuals: –Democratic.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
Estimation of Distribution Algorithms Ata Kaban School of Computer Science The University of Birmingham.
Futility-Based Offspring Sizing André Nwamba June 13, 2015.
The Adaptive Hierarchical Fair Competition (HFC) Model for EA’s Jianjun Hu, Erik D. Goodman Kisung Seo, Min Pei Genetic Algorithm Research &Applications.
Population Sizing as an Emergent Behavior Jason Cook.
Age-Based Population Dynamics in Evolutionary Algorithms Lisa Guntly.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Introduction to Genetic Algorithms Yonatan Shichel.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Design of Curves and Surfaces by Multi Objective Optimization Rony Goldenthal Michel Bercovier School of Computer Science and Engineering The Hebrew University.
Symposium “New Directions in Evolutionary Computation” Dr. Daniel Tauritz Director, Natural Computation Laboratory Associate Professor, Department of Computer.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
CS 447 Advanced Topics in Artificial Intelligence Fall 2002.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
Tutorial 4 (Lecture 12) Remainder from lecture 10: The implicit fitness sharing method Exercises – any solutions? Questions?
Christoph F. Eick: Applying EC to TSP(n) Example: Applying EC to the TSP Problem  Given: n cities including the cost of getting from on city to the other.
Genetic Algorithm.
Introduction to Genetic Algorithms and Evolutionary Computation
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
Genetic algorithms Prof Kang Li
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.
Genetic algorithms Charles Darwin "A man who dares to waste an hour of life has not discovered the value of life"
The Generational Control Model This is the control model that is traditionally used by GP systems. There are a distinct number of generations performed.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Evolving Virtual Creatures & Evolving 3D Morphology and Behavior by Competition Papers by Karl Sims Presented by Sarah Waziruddin.
Evolutionary Computation Dean F. Hougen w/ contributions from Pedro Diaz-Gomez & Brent Eskridge Robotics, Evolution, Adaptation, and Learning Laboratory.
Artificial Intelligence Chapter 4. Machine Evolution.
2005MEE Software Engineering Lecture 11 – Optimisation Techniques.
Algorithms and their Applications CS2004 ( ) 13.1 Further Evolutionary Computation.
/ 26 Evolutionary Computing Chapter 8. / 26 Chapter 8: Parameter Control Motivation Parameter setting –Tuning –Control Examples Where to apply parameter.
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
MAE 552 Heuristic Optimization Instructor: John Eddy Lecture #12 2/20/02 Evolutionary Algorithms.
Chapter 12 FUSION OF FUZZY SYSTEM AND GENETIC ALGORITHMS Chi-Yuan Yeh.
GENETIC ALGORITHM Basic Algorithm begin set time t = 0;
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Benjamin Doerr 1, Michael Gnewuch 2, Nils Hebbinghaus 1, Frank Neumann 1 1 Max-Planck-Institut für Informatik Saarbrücken A Rigorous View on Neutrality.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Selection and Recombination Temi avanzati di Intelligenza Artificiale - Lecture 4 Prof. Vincenzo Cutello Department of Mathematics and Computer Science.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
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 Algorithms And other approaches for similar applications Optimization Techniques.
 Presented By: Abdul Aziz Ghazi  Roll No:  Presented to: Sir Harris.
Genetic Algorithms.
Bulgarian Academy of Sciences
Who cares about implementation and precision?
Example: Applying EC to the TSP Problem
Example: Applying EC to the TSP Problem
Artificial Intelligence Chapter 4. Machine Evolution
Example: Applying EC to the TSP Problem
Parameter control Chapter 8.
Artificial Intelligence Chapter 4. Machine Evolution
Parameter control Chapter 8.
Self-Configuring Crossover
Beyond Classical Search
Parameter control Chapter 8.
Coevolutionary Automated Software Correction
Presentation transcript:

EC Awards Lecture ~ Spring 2008 Advances in Parameterless Evolutionary Algorithms Lisa Guntly André Nwamba Research Advisor: Dr. Daniel Tauritz Natural Computation Laboratory

Evolutionary Algorithms (EAs) Evolutionary Algorithm (EA) Solution User ParametersProblem

Evolutionary Algorithms Create Initial Population Evaluate Fitness Termination Select Parents Create Offspring Evaluate FitnessSelect Survivors No Yes Solution

Motivation Parameter specification complicates EAs –Expert knowledge required –Time-consuming –Sub-optimal - optimal parameter values can change during a run

The Effects of Parameter Values ParameterOptimalTraditional Population Size50050 Offspring Size50 Crossover2-point1-point Mutation Rate.1% Parent SelectionRandom2-1 Tournament Survivor SelectionTruncation

Parameterless EAs: Our Approach Completely Parameterless EAs Biological metaphors may be useful Typical parameters: –Population size –Parent selection operators –Offspring size –Survival selection –Mutation operators –Crossover operators

Futility-Based Offspring Sizing (FuBOS) André Nwamba

FuBOS: Futility-Based Offspring Sizing Minimize wasted computation effort

Approach Look at change in average fitness of the offspring Average fitness of all n offspring Average fitness of n -1 previously created offspring Threshold value

Experimental Setup Compared FuBOS-EA and manually tuned EA (OOS-EA) FuBOS-EA uses ε =.001 Test problems: DTRAP, SAT, and ONEMAX Used population sizes of 100, 500, 1000 All tests used same parameters Performance compared using One-Way ANOVA with significance level of.05

Results

Conclusions Competitive performance Extra parameter

FuBOS Future Work The “epsilon problem” Genetic Diversity Parent Selection Combine with dynamic population sizing

Age-Based Population Sizing (ABPS) Lisa Guntly

The Importance of Age Age significantly impacts survival in natural populations

Methods Survival chance ( S i ) of an individual is based on age and fitness Main Equation S i  F i F B S AGE Fitness of i Best Fitness

Survival Chance from Age Age is tracked by individual, and is incremented every generation Two equations explored for S AGE Equation 1 (ABPS-EA1): linear decrease S AGE  1  R A ( ) Rate of decrease from age

Survival Chance from Age (cont’d) Equation 2 (ABPS-EA2): more dynamic S AGE  1  N AG 2P  AGE 2G Number of individuals in the same age group Population size Number of generations the EA will run

Survival Chance from Age (cont’d) Effects of –More individuals of the same age will decrease their survival chance –Age will decrease survival chance relative to the maximum age ( G ) N AG SiSi  S AGE  1  N AG 2P  AGE 2G

Experimental Setup Testing done on TSP (size 20/40/80) Offspring size is constant Compared to a manually tuned EA Examine effects of –Initial population size –Offspring size Tracked population statistics –Size –Average age –Global best fitness (GBF)

Performance Results - TSP size 20 Average over 30 runs ABPS-EA1 - ABPS-EA2 - Global best fitness

Performance Results - TSP size 40 Average over 30 runs ABPS-EA1 - ABPS-EA2 - Global best fitness

Initial Population Size Effect 3 different runs

Tracking Population Size and Average Age Same single run

Equation with Fitness Scaling Attempt to fix the lack of selection pressure from fitness New Main Equation S i   F i F B  F W F W S AGE S i  F i F B S Fitness of i Best Fitness Worst Fitness Fitness Scaling

Initial Performance Analysis from Fitness Scaling Equation Average over 30 runs using Global best fitness

Initial Performance Analysis from Fitness Scaling Equation (cont’d) Independence from initial population size was maintained Dynamic adjustment of population size during the run was improved Additional selection pressure from elitism improved performance slightly

ABPS Conclusions Independence from initial population value was achieved Autonomous adjustment of population size during a single EA run was successful Fitness scaling is needed for ABPS to work on more difficult problems

ABPS Future Work Further exploration of fitness scaling methods Test on other difficult problems Compare to other dynamic population sizing schemes Implement age-based offspring sizing

Impact

Impact Increases industry usability Higher performance EAs Progress towards completely parameterless EA

Questions?

FuBOS Experimental Setup ParameterValue InitializationEach bit is initialized to either a 0 or 1 with a uniform probability Parent SelectionRandom Survivor SelectionTruncation RecombinationUniform Crossover for SAT and ONEMAX and 2-point crossover for DTRAP Mutation Rate1/l (l being the length of the bitstring) Termination Condition fitness evaluations for SAT and DTRAP, Optimal solution found for ONEMAX

Experimental Setup DTRAP SAT ONEMAX