Research Associate Computing, Engineering & Physical Sciences University of Central Lancashire, UK Dr John Cartlidge 5th.

Slides:



Advertisements
Similar presentations
Willing to spend the time! Self motivated! Self responsibility! (If you need something Ask For IT!!!!!) Ability to communicate! (Vocabulary) Write,
Advertisements

Logical and Artificial Intelligence in Games Lecture 14
An Exemplar-Based Fitness Function with Dynamic Value Based on Sub-Problem Difficulty Steve Rowe June 2006 Srowe -at- cybernet -dot- com Please put "genetic"
Reinforcement Learning
24-26 July 2006EE2006 Conference, Liverpool, UK1 Dr T. Laoui 1, John ODonoghue 2 University of Wolverhampton 1 School of Engineering and Built Environment.
© Copyright 2010 Lead Paint Safety Association
What the Search Engines are up to Now: same ingredients different recipes Karen Blakeman RBA Information Services, UK 02 June 20141Karen Blakeman
Reinforcement Learning
© 2001 empolis UK1 Topic Maps, NewsML and XML: Possible Integration and Implementations. By Soelwin Oo.
Genetic Algorithms Genetic Programming Ata Kaban School of Computer Science University of Birmingham 2003.
Debates in HE ASS 3. Aims To describe development of HE post- war To analyse the “widening participation” debate.
Pitching for finance Social Enterprise North West February 2014.
Good Salespeople johnpc ltd: John Cunningham.
‘Lean’ methodologies in facilities Approaches, effects, problems and compliance. Dave Gaster December
Gr 12 Fitness.
EC Control of Ozone Depleting Substances Update on the Draft EC Regulation Presented by Pacific Scientific at the International Halon Replacement Working.
PIA Load Balancing, JVMs and Garbage Collection David Kurtz Go-Faster Consultancy Ltd.
Constraint Optimization We are interested in the general non-linear programming problem like the following Find x which optimizes f(x) subject to gi(x)
Tetris and Genetic Algorithms Math Club 5/30/2011.
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.
Misconceptions of Natural Selection. 2 Charles Darwin Charles Darwin was a scientist who was very interested in the study of nature. He introduced the.
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
The Dominance Tournament Method of Monitoring Progress in Coevolution Speaker: Lin, Wei-Kai (2009/04/30) 1.
Genetic Algorithms1 COMP305. Part II. Genetic Algorithms.
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
The Adaptive Hierarchical Fair Competition (HFC) Model for EA’s Jianjun Hu, Erik D. Goodman Kisung Seo, Min Pei Genetic Algorithm Research &Applications.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Co-evolution Co-evolution is frequently seen in pairs of species that interact frequently or closely. A change in the traits of one species acts as a selection.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Genetic Programming.
© Negnevitsky, Pearson Education, Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming Evolution strategies Evolution.
Hybrid Behavior Co-evolution and Structure Learning in Behavior-based Systems Amir massoud Farahmand (a,b,c) (
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Coevolutionary Models A/Prof. Xiaodong Li School of Computer Science and IT, RMIT University Melbourne, Australia April.
17.1 Genes and Variation 17.2 Evolution as Genetic Change in Populations Page 483.
15-1 Notes: Adaptations and Natural Selection
Genetic Algorithms Michael J. Watts
Chapter 16 evolution of sex. Adaptive significance of sex Many risks and costs associated with sexual reproduction. Searching for and courting a mate.
Supporting Conceptual Design Innovation through Interactive Evolutionary Systems I.C. Parmee Advanced Computation in Design and Decision-making CEMS, University.
Pareto Coevolution Presented by KC Tsui Based on [1]
Machine Learning in Computer Games Marc Ponsen 11/29/04.
Genetic Algorithms Siddhartha K. Shakya School of Computing. The Robert Gordon University Aberdeen, UK
GENETIC ALGORITHM A biologically inspired model of intelligence and the principles of biological evolution are applied to find solutions to difficult problems.
17.2 Evolution as Genetic Change in Populations
1 Danny Hillis and Co-evolution Between Hosts and Parasites I 590 4/11/2005 Pu-Wen(Bruce) Chang.
CITS7212: Computational Intelligence An Overview of Core CI Technologies Lyndon While.
CAP6938 Neuroevolution and Artificial Embryogeny Competitive Coevolution Dr. Kenneth Stanley February 20, 2006.
Alternating-offers Bargaining problems A Co-evolutionary Approach Nanlin Jin, Professor Edward Tsang, Professor Abhinay Muthoo, Tim Gosling, Dr Maria Fasli,
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Comparing Artificial, Natural, and Sexual Selection.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Lesson Overview 17.2 Evolution as Genetic Change in Populations Insect populations often contain a few individuals that are resistant to a particular pesticide.
Lesson # 5: Evolution (Natural Selection vs. Artificial Selection)
Copyright © 2003 Pearson Education, Inc. publishing as Benjamin Cummings Darwin observed that –organisms produce more offspring than the environment can.
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-
Evolving CPPNs to Grow Three- Dimensional Physical Structures Joshua E. Auerbach Josh C. Bongard GECCO 2010 – Portland, Oregon Evolving CPPNs to Grow Three-Dimensional.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Intelligent Exploration for Genetic Algorithms Using Self-Organizing.
USING MICROBIAL GENETIC ALGORITHM TO SOLVE CARD SPLITTING PROBLEM.
Evolving the goal priorities of autonomous agents
Advanced Artificial Intelligence Evolutionary Search Algorithm
organisms produce more offspring than the environment can support
An Overview of Evolutionary Cellular Automata Computation
George Rush Modified by Dr. T
George Rush Modified by Dr. T
Parameter control Chapter 8.
Parameter control Chapter 8.
Parameter control Chapter 8.
Coevolutionary Automated Software Correction
Presentation transcript:

Research Associate Computing, Engineering & Physical Sciences University of Central Lancashire, UK Dr John Cartlidge 5th August 2008John Cartlidge: ALife XI, Winchester, UK 1 Dynamically adapting parasite virulence to combat coevolutionary disengagement

John Cartlidge: ALife XI, Winchester, UK2 5th August 2008 Synopsis Disengagement in coevolutionary systems Review Reduced Virulence (RV) Analysis of RV in Counting Ones domain Present Dynamic Virulence (DV), a novel method for adapting Virulence online Summary/Conclusions

John Cartlidge: ALife XI, Winchester, UK3 5th August 2008 Disengagement Competitive Coevolutionary Systems  Relative fitness assessment through self-play  Fitness varies as opponents vary in ability Relativity leads to Disengagement  Occurs when one population gets the “upper hand”  Can’t discriminate individuals  no selection pressure Occurs when competitors are badly matched  Suits of armour and nuclear weapons  There must be no outright winner

John Cartlidge: ALife XI, Winchester, UK4 5th August 2008 Reduced Virulence (RV) Cartlidge, J. & Bullock, S. (2002, 2004) Reward competitors that sometimes lose RV Fitness Transform f(x,v) = 2x ∕ v – x 2 ∕ v 2 virulence: 0.5 ≤ v ≤ 1.0 relative score: x

John Cartlidge: ALife XI, Winchester, UK5 5th August 2008 RV: An illustrative Example Selection only. No mutation. Linear fitness ranking Population B has an innovation (20) not found in A Trade-off between engagement and innovation loss V = 1 (standard)V = 0.75V = 0.5 Selection drives pop B to 20 causing disengagement Pop B drops genotype 20 and remains engaged at 19 Lots of innovation loss as populations move to 12

John Cartlidge: ALife XI, Winchester, UK6 5th August 2008 Symmetry Mutation introduces genetic novelty Symmetric system with unbiased mutation profile  Populations have equal chance of +/– mutation  Neither population has an advantage

John Cartlidge: ALife XI, Winchester, UK7 5th August 2008 Asymmetry Here population B has a favourable mutation bias  A finds it harder to discover +ve/beneficial genetic innovations Disengagement is exacerbated by asymmetry  In genetic representations, genotype-phenotype mappings, genetic operators, interaction rules, location in genotype space, etc.

John Cartlidge: ALife XI, Winchester, UK8 5th August 2008 Couting Ones Watson & Pollack, GECCO 2001 Two populations of binary strings Goal: evolve as many 1s as possible Asymmetrical bias controlled by varying mutation bias of one population (parasites) When is it best to reduce virulence?

John Cartlidge: ALife XI, Winchester, UK9 5th August 2008 Virulence ‘Sweet-Spot’ Low bias requires high virulence for both populations As bias increases, want progressively lower parasite V Parasite virulence Host virulence Parasite Bias / Asymmetry Maximums Engagement ‘Sweet-Spot’

John Cartlidge: ALife XI, Winchester, UK10 5th August 2008 Choosing RV Value Problem:  How do we know a priori what the asymmetry is likely to be?  Is asymmetry is likely to remain fixed? Solution:  Adapt virulence dynamically during runtime

John Cartlidge: ALife XI, Winchester, UK11 5th August 2008 Dynamic Virulence (DV) Reinforcement learning approach:  Value(t+1)  Value(t) + LearningRate [Target(t) – Value(t)] Each generation, t, update virulence, V t  ∆V t = ρ(1 − X t ∕φ)(1) X t : Mean relative score of population at time t φ: Target mean relative score of population ρ: Acceleration (rate of change of virulence)  Μ t = μΜ t-1 + (1−μ)∆V t (2) μ: Momentum, Μ 0 = V 0  if μ = 0, then  t, Μ t = ∆ V t  no momentum  if μ = 1, then  t, Μ t = V 0  fixed virulence  V t+1 = V t +Μ t (3) 0 ≤ φ, ρ, μ ≤ 1

John Cartlidge: ALife XI, Winchester, UK12 5th August 2008 Evolving φ, ρ, μ 30 runs. Mean value of parameter in population each generation. Bias fixed for each evaluation 15 runs. Mean value of parameter in population each generation. Bias varying during each evaluation

John Cartlidge: ALife XI, Winchester, UK13 5th August 2008 DV Performance Performance of DV in the Counting Ones domain DV Parameters: φ = 0.56; ρ = ; μ = 0.3  180/180 successful runs. 31/135,000 disengaged generations Compare with maximum virulence  79/180 successful runs. 68,900 disengaged generations Successful runs using fixed virulence (total 180 runs) Parasite Bias / Asymmetry Parasite Bias / Asymmetry Fixed Virulence Dynamic Virulence

John Cartlidge: ALife XI, Winchester, UK14 5th August 2008 DV in Action

John Cartlidge: ALife XI, Winchester, UK15 5th August 2008 Lessons for epidemiology? Can we use DV for modelling virulence in natural systems? Can we translate ideas of RV to the natural world for control of infectious diseases?  Rather than attack parasites and encourage an arms-race, creating ‘super-bugs’, can we take a reduced virulence approach?  E.g.: ‘Scientists create GM mosquitoes to fight malaria and save thousands of lives’ (Guardian 2005) ‘Plan to breed and sterilize millions of male insects’ Project ‘almost ready for testing in wild’

John Cartlidge: ALife XI, Winchester, UK16 5th August 2008 Summary / Conclusions Disengagement is problematic and is exacerbated by asymmetry Reducing virulence helps to promote engagement As asymmetry increases, virulence should fall Its hard to know a priori what virulence level to set DV is able to adapt virulence during evolution to find the best value DV has been shown to vastly outperform fixed virulence (and standard virulence) in the Counting Ones domain

John Cartlidge: ALife XI, Winchester, UK17 5th August 2008 Further Reading Cartlidge & Bullock (2002) CEC, p.1420, IEEE Press Cartlidge & Bullock (2003) ECAL, p.299, Springer Verlag Cartlidge & Bullock (2004) Evolutionary Comp., 12, p.193 Cartlidge (2004) PhD Thesis, University of Leeds Dr John Cartlidge, Research Associate University of Central Lancashire