March 23, 2003 AAAI symposium, Stanford. Jianjun Hu, Erik D. Goodman, Kisung Seo Zhun Fan, Ronald C. Rosenberg Genetic Algorithm Research & Applications.

Slides:



Advertisements
Similar presentations
Department of Electronic Engineering NUIG Direct Evolution of Patterns using Genetic Algorithms By: John Brennan Supervisor: John Maher.
Advertisements

Genetic Algorithms Genetic Programming Ata Kaban School of Computer Science University of Birmingham 2003.
24th may Use of genetic algorithm for designing redundant sensor network Carine Gerkens Systèmes chimiques et conception de procédés Département.
Using Parallel Genetic Algorithm in a Predictive Job Scheduling
Genetic Algorithms By: Anna Scheuler and Aaron Smittle.
Environmental Robustness in Multi-agent Teams Terence Soule Robert B Heckendorn Presented at GECCO 09 (The Genetic and Evolutionary Computation Conference)
Producing Artificial Neural Networks using a Simple Embryogeny Chris Bowers School of Computer Science, University of Birmingham White.
The Adaptive Hierarchical Fair Competition (HFC) Model for EA’s Jianjun Hu, Erik D. Goodman Kisung Seo, Min Pei Genetic Algorithm Research &Applications.
Evolutionary Computational Inteliigence Lecture 6a: Multimodality.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Introduction to Genetic Algorithms Yonatan Shichel.
Evolutionary Algorithms Simon M. Lucas. The basic idea Initialise a random population of individuals repeat { evaluate select vary (e.g. mutate or crossover)
Genetic Algorithms Learning Machines for knowledge discovery.
Natural Computation: computational models inspired by nature Dr. Daniel Tauritz Department of Computer Science University of Missouri-Rolla CS347 Lecture.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Evolutionary Computational Intelligence Lecture 9: Noisy Fitness Ferrante Neri University of Jyväskylä.
Evolutionary Computational Intelligence Lecture 8: Memetic Algorithms Ferrante Neri University of Jyväskylä.
Evolutionary Computation Application Peter Andras peter.andras/lectures.
Symposium “New Directions in Evolutionary Computation” Dr. Daniel Tauritz Director, Natural Computation Laboratory Associate Professor, Department of Computer.
CS 447 Advanced Topics in Artificial Intelligence Fall 2002.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Genetic Programming. Agenda What is Genetic Programming? Background/History. Why Genetic Programming? How Genetic Principles are Applied. Examples of.
Image Registration of Very Large Images via Genetic Programming Sarit Chicotay Omid E. David Nathan S. Netanyahu CVPR ‘14 Workshop on Registration of Very.
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
Island Based GA for Optimization University of Guelph School of Engineering Hooman Homayounfar March 2003.
1 Reasons for parallelization Can we make GA faster? One of the most promising choices is to use parallel implementations. The reasons for parallelization.
A Genetic Algorithms Approach to Feature Subset Selection Problem by Hasan Doğu TAŞKIRAN CS 550 – Machine Learning Workshop Department of Computer Engineering.
Evolutionary Algorithms BIOL/CMSC 361: Emergence Lecture 4/03/08.
Neural and Evolutionary Computing - Lecture 10 1 Parallel and Distributed Models in Evolutionary Computing  Motivation  Parallelization models  Distributed.
1 Paper Review for ENGG6140 Memetic Algorithms By: Jin Zeng Shaun Wang School of Engineering University of Guelph Mar. 18, 2002.
A Comparison of Nature Inspired Intelligent Optimization Methods in Aerial Spray Deposition Management Lei Wu Master’s Thesis Artificial Intelligence Center.
Evolution Strategies Evolutionary Programming Genetic Programming Michael J. Watts
Constrained Evolutionary Optimization Yong Wang Associate Professor, PhD School of Information Science and Engineering, Central South University
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Investigation of the Effect of Neutrality on the Evolution of Digital Circuits. Eoin O’Grady Final year Electronic and Computer Engineering Project.
What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.
Optimization Problems - Optimization: In the real world, there are many problems (e.g. Traveling Salesman Problem, Playing Chess ) that have numerous possible.
Omni-Optimizer A Procedure for Single and Multi-objective Optimization Prof. Kalyanmoy Deb and Santosh Tiwari.
1 Formal Verification of Candidate Solutions for Evolutionary Circuit Design (Entry 04) Zdeněk Vašíček and Lukáš Sekanina Faculty of Information Technology.
Genetic Algorithms Genetic Algorithms – What are they? And how they are inspired from evolution. Operators and Definitions in Genetic Algorithms paradigm.
Fuzzy Genetic Algorithm
Evolving Virtual Creatures & Evolving 3D Morphology and Behavior by Competition Papers by Karl Sims Presented by Sarah Waziruddin.
1 Machine Learning: Lecture 12 Genetic Algorithms (Based on Chapter 9 of Mitchell, T., Machine Learning, 1997)
1 “Genetic Algorithms are good at taking large, potentially huge search spaces and navigating them, looking for optimal combinations of things, solutions.
Neural and Evolutionary Computing - Lecture 9 1 Evolutionary Neural Networks Design  Motivation  Evolutionary training  Evolutionary design of the architecture.
How to apply Genetic Algorithms Successfully Prabhas Chongstitvatana Chulalongkorn University 4 February 2013.
1 5. Application Examples 5.1. Programmable compensation for analog circuits (Optimal tuning) 5.2. Programmable delays in high-speed digital circuits (Clock.
Parent Selection Strategies for Evolutionary Algorithms A Comparison of Parent Selection Strategies Modeled After Human Social Interaction By Michael Ames.
1. Genetic Algorithms: An Overview  Objectives - Studying basic principle of GA - Understanding applications in prisoner’s dilemma & sorting network.
Evolutionary Design (2) Boris Burdiliak. Topics Representation Representation Multiple objectives Multiple objectives.
CITS7212: Computational Intelligence An Overview of Core CI Technologies Lyndon While.
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
Genetic algorithms: A Stochastic Approach for Improving the Current Cadastre Accuracies Anna Shnaidman Uri Shoshani Yerach Doytsher Mapping and Geo-Information.
Chapter 15: Co-Evolutionary Systems
Genetic Programming Using Simulated Natural Selection to Automatically Write Programs.
Multi-cellular paradigm The molecular level can support self- replication (and self- repair). But we also need cells that can be designed to fit the specific.
Genetic Algorithms. Solution Search in Problem Space.
An Evolutionary Algorithm for Neural Network Learning using Direct Encoding Paul Batchis Department of Computer Science Rutgers University.
March 1, 2016Introduction to Artificial Intelligence Lecture 11: Machine Evolution 1 Let’s look at… Machine Evolution.
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
Evolutionary Computation Evolving Neural Network Topologies.
CEng 713, Evolutionary Computation, Lecture Notes parallel Evolutionary Computation.
-A introduction with an example
Artificial Intelligence Methods (AIM)
School of Computer Science & Engineering
C.-S. Shieh, EC, KUAS, Taiwan
Zdeněk Vašíček and Lukáš Sekanina
Evolutionary Computation,
Coevolutionary Automated Software Correction
Presentation transcript:

March 23, 2003 AAAI symposium, Stanford. Jianjun Hu, Erik D. Goodman, Kisung Seo Zhun Fan, Ronald C. Rosenberg Genetic Algorithm Research & Applications Group (GARAGe) Michigan State University HFC: a Continuing EA Framework for Scalable Evolutionary Synthesis

March 23, 2003 AAAI symposium, Stanford. Evolutionary Synthesis: the problem Topology innovation: How many and what types of building blocks, How to connect them? Parameter innovation: How to size the elements? R S CI R1 Input: >Building blocks >Function Specification (Evaluation function) >EA settings (operators, parameters…) Output: Design solutions Evolution

March 23, 2003 AAAI symposium, Stanford. Sustainable & scalable evolutionary synthesis: Definition and Reality Definition: the capability to obtain better results or solve larger scale problems when given more computing resources Reality: not sustainable and not scalable Bloating and aging problem (e.g.:Innovation in 50 generations in GP) Demand for huge population size (GP) Premature convergence and local optima (all EA) But biological evolution is sustainable and scalable!

March 23, 2003 AAAI symposium, Stanford. Sustainable & scalable evolutionary synthesis: two types of obstacles Two types of obstacles: 1. Convergent nature of current EA framework one of major factors leading to : GP aging phenomenon premature convergence dependence on huge population size 2. Non-scalable compositional mechanisms for topological and parametric evolution possible solutions: modularity, hierarchical organization, biological developmental principles… This paper: addresses the EA convergence problem

March 23, 2003 AAAI symposium, Stanford. Comparison with biological evolution: how to achieve sustainable evolution Biological evolution Almost infinite population size Simultaneous evolution of all levels of organisms: bacteria coexist with humans Fair competition: different levels of organism coexist in different niches Sustainable innovation possible Artificial evolution (EA) Limited population size Focusing on current high- fitness individuals Unfair competition: highly- evolved individuals compete with new offspring of low fitness Innovation capability rapidly depleted

March 23, 2003 AAAI symposium, Stanford. Sustainable evolution: example & comparison Sustainable education system: how generations of talents are educated? Unsustainable EA: how generations of solutions are evolved?

March 23, 2003 AAAI symposium, Stanford. Assembly-line structured continuing EAs

March 23, 2003 AAAI symposium, Stanford. HFC-EA framework

March 23, 2003 AAAI symposium, Stanford. System synthesis problem: eigenvalue placement Max distance error Average distance error hours Sf 1Se1 1 0 C R I 1 R C I 0 R C C 0 RLRL

March 23, 2003 AAAI symposium, Stanford. Experiment result: sustainability& robustness Dynamic system synthesis problem with simultaneous topology and parameter search

March 23, 2003 AAAI symposium, Stanford. Experiment result: handling GP aging problem 10 eigenvalue dynamic system synthesis problem

March 23, 2003 AAAI symposium, Stanford. Experiment result: small population size works equally well 10-parity problem with function set {and, xor, or, not)

March 23, 2003 AAAI symposium, Stanford. Why HFC works: the explanation

March 23, 2003 AAAI symposium, Stanford. Conclusion: Hierarchical Fair Competition Principle for EA HFC is very effective in evolutionary synthesis Simultaneous evolution at all (fitness) levels, from the random population to best individuals Avoid premature convergence by allowing emergence of new optima rather than trying to jump out of local optima Allow use of strong selection pressure without risk of premature convergence Small population size also works

March 23, 2003 AAAI symposium, Stanford. Ongoing & future work Developing single population HFC (CHFC) (with continuous level segmentations) algorithm to achieve sustainable evolution Developed HFC-enhanced multi-objective EAs (GECCO2003) To develop hybrid parallel-HFC GA/GP system where each deme is implemented as a CHFC population To develop multi-level system synthesis: from framework evolution to complete solutions

March 23, 2003 AAAI symposium, Stanford. Generalization of HFC-EA Framework A generic framework for continuing sustainable evolutionary computation (GA, GP, ES, …) Especially good for Evolutionary Synthesis for Sustainable topological innovation which has extremely rugged fitness landscape. Especially effective for problems with: High multi-modality Strong tendency of premature convergence Requirement on robustness Requirement on adaptation in dynamic environment Also applicable for artificial life evolution

March 23, 2003 AAAI symposium, Stanford. Scaling Mechanism of HFC A natural parallel evolutionary computation model. Better than island parallel model Hybridizing with single-population HFC EAs (Each deme is a sustainable HFC subpop) Natural hybridizing with explicit hierarchical building block discovery mechanisms Allow using small population size and longer time to achieve good results No restart to waste computing effort