Announcements

Velit esse cillum dolore sed do eiusmod tempor incididunt consectetur adipisicing elit. Ut enim ad minim veniam, ullamco laboris nisi quis nostrud exercitation. Duis aute irure dolor qui officia deserunt ut labore et dolore magna aliqua.

Classes

EEL 4817 Machine Learning II: Agent-Based Economic Development, Spring 2011.

EEL 4818 (Lectures on Genetic Algorithms)

Fall 2008

by Ivan Garibay, University of Central Florida, November 17, 2008.

Lecture 1, November 18, 2008

  • Topics Covered:
    • Evolutionary Computation
    • Historical Perspective
    • Basic Evolutionary Process
    • Simplest Evolutionary Algorithm: EV
    • Simulation of EV
  • Materials:
  • Deadlines:

Lecture 2, November 20, 2008

  • Topics Covered:
    • Simulation of EV
    • Genetic Algorithms (GAs): What are they?
    • Darwinian Evolution, Mendelian Genetics, Turing's Genetic Search, and Holland's Genetic Algorithms.
    • Stochastic Search and Evolutionary Computation
    • GA components: problem representation, selection function, fitness function, and genetic operators.
    • GA pseudocode
    • GAs: How do they work?
    • GA Optimization: One Max Problem: our class becomes a random number generator for running a single GA loop by hand
    • Tournament Selection
    • One-point Crossover
    • Bit-flip Mutation
    • Analysis of One Max Problem's experimental results.
  • Materials:
  • Deadlines:
    • GA Homework Assignment Due: December 4th, 2008
    • GA section written evaluation: Devember 4th, 2008.

Lecture 3, November 25, 2008

  • Topics Covered
    • GAs: Why do they work? (stochastic search answer)
    • Universal limits of search: No Free Lunch Theorems
    • Search Spaces, Fitness Landscapes
    • Random, Needle-in-a-haystack, and one-max fitness landscapes
    • Search Algorithms and Stochastic Search
    • Why stochastic search works? Key property
    • Schemas

Lecture 4, December 2nd, 2008

  • Topics Covered:
    GAs: Why do they work? (GA schema analysis answer)
    • Building Block Hypothesis
    • Schema Theorem (Holland, 1975)
    • How does GA process schemata?
    • GA implicit parallelism
    • Schema Theorem with only selection
    • Destructive and Constructive Effects of Crossover and Mutation on Schemata
    • Probabilities of Schema Surviving Crossover and Surviving Mutation
    Complete Schema Theorem (selection, crossover and mutation)

Lecture 5, December 4th, 2008

  • Evaluation (mini-test) covering the four previous lectures including all material handed out in class