evolutionary computation and co-evolution

37
Evolutionary Computation and Co-evolution Alan Blair October 2005

Upload: xenia

Post on 27-Jan-2016

53 views

Category:

Documents


0 download

DESCRIPTION

Evolutionary Computation and Co-evolution. Alan Blair October 2005. Overview. Evolutionary Computation. population of individuals fitness function repeat cycle of: evaluation, selection, crossover/mutation. Bit-String Operators:. Schema “Theorem”. Implicit Parallelism - PowerPoint PPT Presentation

TRANSCRIPT

Page 1: Evolutionary Computation and Co-evolution

Evolutionary Computationand

Co-evolution

• Alan Blair• October 2005

Page 2: Evolutionary Computation and Co-evolution

Overview

Page 3: Evolutionary Computation and Co-evolution

Evolutionary Computation• population of individuals

• fitness function

• repeat cycle of:– evaluation,

– selection,

– crossover/mutation

Page 4: Evolutionary Computation and Co-evolution

Bit-String Operators:

Page 5: Evolutionary Computation and Co-evolution

Schema “Theorem”

• Implicit Parallelism

• Fitter schemas increase their representation over time

• Schemas combine like “building blocks”

Page 6: Evolutionary Computation and Co-evolution

Evolutionary Issues:

• Representations

• Mutation operators

• Crossover operators

• Fitness functions

Page 7: Evolutionary Computation and Co-evolution

Representations• continuous parameters (Schwefel)

• Bit-strings (Holland)

• genetic programs (Koza)

• machine language (Schmidhuber)

• NN building operators (Gruau)

• genotype = phenotype itself

Page 8: Evolutionary Computation and Co-evolution

Crossover Operators• one-point

• two-point

• uniform

• special-purpose operators

• mutation only (parthenogenesis)

Page 9: Evolutionary Computation and Co-evolution

Fitness Functions

• “deceptive” landscapes– e.g. HIFF (Watson)

– local optima

– premature convergence

• Baldwin effect

• variation over time (robustness)

Page 10: Evolutionary Computation and Co-evolution

“Gaps” in the Fossil Record?

Page 11: Evolutionary Computation and Co-evolution

“Gaps” in the Fossil Record?

Page 12: Evolutionary Computation and Co-evolution

Partial Geographic Isolation

Page 13: Evolutionary Computation and Co-evolution

Punctuated Equilibria

Page 14: Evolutionary Computation and Co-evolution

“Gaps” in the Fossil Record?• Eldridge & Gould

– partial geographic isolation

– punctuated equilibria

• ideas for Evolutionary Computation?– “island” models

– co-evolution / artificial ecology ?

Page 15: Evolutionary Computation and Co-evolution

Co-Evolution• competitive (leapard vs. gazelle)

• co-operative (insects/flowers)

• mixed co-operative/competitive (Maynard-Smith)

• different genes within same genome?

• “diffuse” co-evolution

Page 16: Evolutionary Computation and Co-evolution

Sorting Networks

Page 17: Evolutionary Computation and Co-evolution

Sorting Networks #1 (Hillis)

• Evolving population of networks

• converged to local optimum

• final network not quite as good as hand-crafted human solution

Page 18: Evolutionary Computation and Co-evolution

Sorting Networks #2 (Hillis)

• two co-evolving populations (networks and strings)

• can escape from local optima

• punctuated equilibria observed

• better than hand-crafted solution (Tufts, Juillé & Pollack)

Page 19: Evolutionary Computation and Co-evolution

Co-evolutionary Paradigms

• machine vs. machine (Sims)

• human vs. machine (Tron)

• mixed co-operative/competitive (IPD)

• language games (Tonkes, Ficici)

• single individual ? (Backgammon)

• brain / body (Sims, Hornby, Lipson)

Page 20: Evolutionary Computation and Co-evolution

Virtual Creatures (Sims)

• Evolution– running / skipping / jumping

• Co-evolution– fighting for control of a cube

Page 21: Evolutionary Computation and Co-evolution

Tournament Structures

• single species

• multi-species

• all vs. all

• round robin

• all vs. best

Page 22: Evolutionary Computation and Co-evolution

Tron

Page 23: Evolutionary Computation and Co-evolution

Tron

• population of GP players co-evolve with population of humans over the Internet (Funes, Sklar, Juillé, Pollack)

Page 24: Evolutionary Computation and Co-evolution

Tron Results

Page 25: Evolutionary Computation and Co-evolution

Tron Results

Page 26: Evolutionary Computation and Co-evolution

Iterated Prisoner’s Dilemma

CC D

D3, 3

0, 55, 0 1,

1• TFT ALL-C ALL-D TFT

Page 27: Evolutionary Computation and Co-evolution

Collusion

Page 28: Evolutionary Computation and Co-evolution

Meta-Game of Learning

• Co-evolution tends to provide an opponent of appropriate ability

• generally helps to escape local optima

• however, can create new “mediocre stable states” (collusion)

Page 29: Evolutionary Computation and Co-evolution

Language Games

Page 30: Evolutionary Computation and Co-evolution
Page 31: Evolutionary Computation and Co-evolution

Simulated Hockey

Page 32: Evolutionary Computation and Co-evolution

Shock Results (single player)

Page 33: Evolutionary Computation and Co-evolution

Shock Results (one-on-one)

Page 34: Evolutionary Computation and Co-evolution

Evolutionary Robotics• too many generations - robot may get worn

out

• start in simulation, refine on real robot

Page 35: Evolutionary Computation and Co-evolution

Brain/Body Co-evolution

Page 36: Evolutionary Computation and Co-evolution

Biped Walking

• dynamically stable gait

• evolved parameters

• start on fast approximate simulator

• refine on slow accurate simulator

Page 37: Evolutionary Computation and Co-evolution

Future Directions

• massive parallelism

• modularity and evolution

• credit-assignment problem

• society / economic models