Machine Learning 1 Machine Learning 1 Genetic Algorithms.

Slides:



Advertisements
Similar presentations
Genetic Algorithms Chapter 3. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Genetic Algorithms GA Quick Overview Developed: USA in.
Advertisements

Genetic Algorithm.
Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm
Genetic Algorithms By: Jacob Noyes 4/16/2013. Traveling Salesman Problem Given:  A list of cities  Distances between each city Find:  Shortest path.
Tuesday, May 14 Genetic Algorithms Handouts: Lecture Notes Question: when should there be an additional review session?
1 IOE/MFG 543 Chapter 14: General purpose procedures for scheduling in practice Section 14.5: Local search – Genetic Algorithms.
1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Introduction to Genetic Algorithms Yonatan Shichel.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
Brandon Andrews.  What are genetic algorithms?  3 steps  Applications to Bioinformatics.
Genetic Algorithm.
Big IdeasDarwinOver TimeTermsExamples 100.
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
Intro. ANN & Fuzzy Systems Lecture 36 GENETIC ALGORITHM (1)
Genetic algorithms Prof Kang Li
Genetic Algorithms Michael J. Watts
ART – Artificial Reasoning Toolkit Evolving a complex system Marco Lamieri Spss training day
Genetic algorithms Charles Darwin "A man who dares to waste an hour of life has not discovered the value of life"
Dr.Abeer Mahmoud ARTIFICIAL INTELLIGENCE (CS 461D) Dr. Abeer Mahmoud Computer science Department Princess Nora University Faculty of Computer & Information.
Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Genetic Algorithms Introduction Advanced. Simple Genetic Algorithms: Introduction What is it? In a Nutshell References The Pseudo Code Illustrations Applications.
Genetic Algorithms Siddhartha K. Shakya School of Computing. The Robert Gordon University Aberdeen, UK
Derivative Free Optimization G.Anuradha. Contents Genetic Algorithm Simulated Annealing Random search method Downhill simplex method.
Artificial Intelligence Chapter 4. Machine Evolution.
Introduction to Genetic Algorithms. Genetic Algorithms We’ve covered enough material that we can write programs that use genetic algorithms! –More advanced.
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
ECE 103 Engineering Programming Chapter 52 Generic Algorithm Herbert G. Mayer, PSU CS Status 6/4/2014 Initial content copied verbatim from ECE 103 material.
Genetic Algorithms. 2 Overview Introduction To Genetic Algorithms (GAs) GA Operators and Parameters Genetic Algorithms To Solve The Traveling Salesman.
Genetic Algorithms Abhishek Sharma Piyush Gupta Department of Instrumentation & Control.
Chapter 12 FUSION OF FUZZY SYSTEM AND GENETIC ALGORITHMS Chi-Yuan Yeh.
EE749 I ntroduction to Artificial I ntelligence Genetic Algorithms The Simple GA.
Waqas Haider Bangyal 1. Evolutionary computing algorithms are very common and used by many researchers in their research to solve the optimization problems.
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.
WARM-UP Use your NOTES from yesterday to answer the 7 questions on your warm- up. Glue to p. 82 in your notebook (leave some space below) –Glue sticks.
1 Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations Genetic Algorithm (GA)
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Genetic Algorithms. Underlying Concept  Charles Darwin outlined the principle of natural selection.  Natural Selection is the process by which evolution.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
►Search and optimization method that mimics the natural selection ►Terms to define ٭ Chromosome – a set of numbers representing one possible solution ٭
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
 Presented By: Abdul Aziz Ghazi  Roll No:  Presented to: Sir Harris.
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
1 Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations.
The Genetic Algorithm (With apologies to Darwin & Mendel
The Genetic Algorithm.
Introduction to Genetic Algorithms
Genetic Algorithm in TDR System
Genetic Algorithms.
Objective: Understand the Key Events in Darwin’s Life
CSC 380: Design and Analysis of Algorithms
An evolutionary approach to solving complex problems
Artificial Intelligence (CS 370D)
Modified Crossover Operator Approach for Evolutionary Optimization
Basics of Genetic Algorithms (MidTerm – only in RED material)
Artificial Intelligence Chapter 4. Machine Evolution
GENETIC ALGORITHMS & MACHINE LEARNING
Basics of Genetic Algorithms
Artificial Intelligence Chapter 4. Machine Evolution
A Gentle introduction Richard P. Simpson
Beyond Classical Search
Population Based Metaheuristics
CSC 380: Design and Analysis of Algorithms
GA.
Population Methods.
Presentation transcript:

Machine Learning 1 Machine Learning 1 Genetic Algorithms

Who’s This?

Charles Darwin ( )

What’s This?

HMS Beagle The Voyage of the Beagle (1839) ( )

Darwin’s Finches

Charles Darwin from The Voyage of the Beagle “ The most curious fact is the perfect gradation in the size of the beaks in the different species of Geospiza…. Seeing this gradation and diversity of structure in one small, intimately related group of birds, one might really fancy that from an original paucity of birds in this archipelago, one species had been taken and modified for different ends”

Differential Reproduction The Tragic Tale of Green Beetles

The Genetic Algorithm Developed ◦John Holland, University of Michigan (~1975) Widely Applied ◦Daniel Goldberg (1989) Metaphor of natural selection applied to optimization problems

Truss Bridge

Truss Optimization: 64 Bars

Optimize? Minimize the Volume of the Truss ◦sum(X-Sectional Area of Member X Length) ◦NP-Complete* * Overbay, S., Ganzerli, S., De Palma, P, Brown, A., Stackle, P. (2006). Trusses, NP- Completeness, and Genetic Algorithms. Proceedings of the 17th Analysis and Computation Specialty Conference. St. Louis, MO.

A Simpler Problem: Word Guess User thinks of a word Passes the word to the GA Keeper GA guesses the word

Elements of GA Idea: Representation selects key items of object for computation Chromosome ◦Representation of a candidate solution ◦Specs for an individual truss ◦A word Gene ◦An element of a chromosome ◦Specs for a member ◦A letter Population ◦Set of chromosomes ◦Specs for a set of trusses ◦Set of letter strings representing candidate solutions

Initialize the Population Idea: Starting point for speciation Randomly generate a set of chromosomes Randomly generate specifications for trusses Randomly generate letter strings of the given size

How Large? Large Enough to Incorporate Genetic Diversity Divisible by 2 64 seems to work

Rank Fitness Idea: Members of the population have characteristics that better suit them for reproduction ◦Function over the population used to rank the population ◦Truss: The smaller the cross-sectional area, the higher the fitness ◦Word Guess: Proximity to correct word

Pair match.com for trusses or words (or whatever)

Zero Population Growth Idea: Food supply (and memory) cannot tolerate unlimited population growth Suppose current population is max: m Current population produces n offspring Reduce m + n candidate solutions to m Example: m = 64 ◦Select 32 population members to survive ◦Group them into 16 breeding pairs ◦Allow each to produce 2 children

Selecting Mating Population Idea: Differential Reproduction Random: Any PP (potential parent) could reproduce Truncation Selection ◦Top half: survive and reproduce ◦Bottom half: die Stochastic: ◦Spin a roulette wheel  Each element has a slot  Size of slot is proportional to 1) fitness 2) probability of being chosen to reproduce

Pairing Idea: Maximize the fitness of offspring Top-Down Tournament While ( < 16 mating pairs) { Do twice:  Randomly select subset of the population  Select 1 parent at random from subset Add parents to set of mating pairs } Many Others

Mate Idea: Children preserve parents’ genetic information Genetic Recombination Target: Chipolte Many Algorithms ◦Illustrated: single point crossover PA: CHIP OTLEPB: CHIX LOTL CA: CHIP LOTLCB: CHIX OTLE

Mutation (and genetic drift) Idea: Population can get stuck in a local minimum Simulates: ◦chemical mutagens ◦radiation ◦copying errors ◦random loss of population members Randomly perturb a fraction of the population

Convergence Idea: No further improvement is possible (within acceptable cost) Stop after a fixed number of iterations Stop when a known solution is found Stop when m% of the population is within n standard deviations of the mean fitness

Putting It Together: The GA Loop GA(population) { Initialize(population) //generate population ComputeCost(population) //compute fitness Sort(population) //rank while (population not converged on a good-enough solution) { SelectBreeders(population) //who reproduces? Pair(breeders) //love and marriage Mate(population) //genetic recombination Mutate(population) //jar from local minima Sort(population) //rank TestConvergence(population) //stop? }