CIAO Plots George Rush. Motivation Assignment 2c: Bonus 2 ▫“Up to 10% bonus points can be earned by investigating under what circumstances coevolutionary.

Slides:



Advertisements
Similar presentations
KEY CONCEPT Evolution occurs in patterns.
Advertisements

Example Project and Numerical Integration Computational Neuroscience 03 Lecture 11.
Image Data Representations and Standards
Chapter 3 Mathematics of Finance
Introduction to TouchDevelop
The Dominance Tournament Method of Monitoring Progress in Coevolution Speaker: Lin, Wei-Kai (2009/04/30) 1.
Genetic Drift Activity
Types of Data Displays Based on the 2008 AZ State Mathematics Standard.
CS 1 – Introduction to Computer Science Introduction to the wonderful world of Dr. T Daniel Tauritz, Ph.D. Associate Professor of Computer Science.
N-Queens Computer Science 301 Spring 2007 Assignment 1 Bob Presents…
Basic Rendering Techniques V Recognizing basic rendering techniques.
Section 5: Graphs in Science
KEY CONCEPT A population shares a common gene pool.
WELCOME TO THE INTERACTIVE PHYSICS TUTORIAL… This is a presentation that works much like a slide show. To Proceed through the slides all you have to do.
Ocober 10, 2012Introduction to Artificial Intelligence Lecture 9: Machine Evolution 1 The Alpha-Beta Procedure Example: max.
October 8, 2013Computer Vision Lecture 11: The Hough Transform 1 Fitting Curve Models to Edges Most contours can be well described by combining several.
(2.1) Fundamentals  Terms for magnitudes – logarithms and logarithmic graphs  Digital representations – Binary numbers – Text – Analog information 
COMP 175: Computer Graphics March 24, 2015
KEY CONCEPT A population shares a common gene pool.
What to study on test!!! Darwin’s Theory of Evolution Natural Selection, Artificial Selection, Adaptation Evidence for Evolution DNA, Homologues Structure,
Slides are based on Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems.
Chapter 11 Biology Textbook
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.
Probability Distributions. Essential Question: What is a probability distribution and how is it displayed?
Investigation of the Effect of Neutrality on the Evolution of Digital Circuits. Eoin O’Grady Final year Electronic and Computer Engineering Project.
Temporal Analysis using Sci2 Ted Polley and Dr. Katy Börner Cyberinfrastructure for Network Science Center Information Visualization Laboratory School.
Pareto Coevolution Presented by KC Tsui Based on [1]
Introduction to History of Life. Biological evolution consists of change in the hereditary characteristics of groups of organisms over the course of generations.
Motivation As we’ve seen, chaos in nonlinear oscillator systems, such as the driven damped pendulum discussed last time is very complicated! –The nonlinear.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Evolving Reactive NPCs for the Real-Time Simulation Game.
Introduction to Genetic Algorithms. Genetic Algorithms We’ve covered enough material that we can write programs that use genetic algorithms! –More advanced.
Chapter One, Section 5: Graphs in Science
Local Search and Optimization Presented by Collin Kanaley.
4.5 Inverse of a Square Matrix
Graphing Most people at one time or another during their careers will have to interpret data presented in graphical form. This means of presenting.
October 1, 2013Computer Vision Lecture 9: From Edges to Contours 1 Canny Edge Detector However, usually there will still be noise in the array E[i, j],
Local Search. Systematic versus local search u Systematic search  Breadth-first, depth-first, IDDFS, A*, IDA*, etc  Keep one or more paths in memory.
N- Queens Solution with Genetic Algorithm By Mohammad A. Ismael.
General information Theoretic basis of evolutionary computing. The general scheme of evolutionary algorithms General information Theoretic basis of evolutionary.
CSCOPE Unit: 09 Lesson: 01.  Be prepared to share your response to the following: ◦ Biological evolution happens at the __________ level, not the individual.
PowerPoint Tutorial.  Once the data collected portion of an experiment is completed, the work of determining the relationship between the variables begins.
11.1 Genetic Variation Within Population KEY CONCEPT A population shares a common gene pool.
Local Search Algorithms CMPT 463. When: Tuesday, April 5 3:30PM Where: RLC 105 Team based: one, two or three people per team Languages: Python, C++ and.
11.5 Speciation Through Isolation KEY CONCEPT New species can arise when populations are isolated.
Graphics Basic Concepts 1.  A graphic is an image or visual representation of an object.  A visual representation such as a photo, illustration or diagram.
Evolutionary Computing Systems Lab (ECSL), University of Nevada, Reno 1 Authors : Siming Liu, Christopher Ballinger, Sushil Louis
Evolving robot brains using vision Lisa Meeden Computer Science Department Swarthmore College.
Robot Intelligence Technology Lab. 8. Competitive co-evolution From ‘Evolutionary Robotics’ Presented by Jeongki, Yoo `
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
March 1, 2016Introduction to Artificial Intelligence Lecture 11: Machine Evolution 1 Let’s look at… Machine Evolution.
Constraints Satisfaction Edmondo Trentin, DIISM. Constraint Satisfaction Problems: Local Search In many optimization problems, the path to the goal is.
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Section 3: Shaping Evolutionary Theory
Local Search Algorithms
Patterns of Evolution A. Divergent Evolution B. Convergent Evolution
Basic Rendering Techniques
HMD Bio Chapter 11 Section 4 KEY CONCEPT Hardy-Weinberg equilibrium provides a framework for understanding how populations evolve.
Fitting Curve Models to Edges
Biologist now know that natural selection is not the only mechanism of evolution
Example of a line of best fit y
Chapter 11 Biology Textbook
6.2 Grid Search of Chi-Square Space
George Rush Modified by Dr. T
Introduction to Artificial Intelligence Lecture 11: Machine Evolution
George Rush Modified by Dr. T
Searching for solutions: Genetic Algorithms
Nicolas Catz, Peter W. Dicke, Peter Thier  Current Biology 
Local Search Algorithms
Histogram The histogram of an image is a plot of the gray _levels values versus the number of pixels at that value. A histogram appears as a graph with.
Presentation transcript:

CIAO Plots George Rush

Motivation Assignment 2c: Bonus 2 ▫“Up to 10% bonus points can be earned by investigating under what circumstances coevolutionary cycling occurs in Ms. Pac-Man and the Ghosts and adding a section to the document to describe all aspects of your investigation, including CIAO plots [2] to visualize your findings.” (emphasis mine) This also could be on the exam.

What Are CIAO Plots? Current Individual vs. Ancestral Opponents These are used to visually convey the progress of two populations during coevolution. Note that each CIAO plot should have n by n pixels, where n is the number of generations.

Problems in Coevolution Cycling ▫Both populations circle around to previous solutions over and over again (e.g., rock-paper- scissors). Disengagement ▫One population becomes so powerful that the other is overwhelmed and cannot make progress. Mediocre Stability ▫Neither side evolves. This can happen if both opponents are too weak to provide any incentive to evolve (fitness landscape is basically flat).

Cycling Should show striation (stripes), but may not be horizontal. Could be vertical, diagonal, etc. These plots are actually caused by random survival selection, but illustrate the idea.

Cycling (continued)

Disengagement Long periods of inactivity. One side will have consistently high fitness while the other is low.

Mediocre Stability Neither side changes much, and neither seems to be much stronger.

What Do CIAO Plots of Good Evolution Look Like? Relatively smooth gradients showing evolution on both sides.

More CIAO Plots of Good Evolution

How to Generate CIAO Plots Store the best member of each population during each generation. Population A Population B

How to Generate CIAO Plots Choose which population corresponds to the x- axis and y-axis. Each y-axis ancestor must fight the ghosts of their strongest enemies throughout time, so all ancestral opponents (from before that generation). Record fitness each time.

How to Generate CIAO Plots Normalize the fitness data on a [0, 1] scale. Here is pseudocode to do this: find minimum recorded fitness value (minFitness) if minFitness < 0 add |minFitness| to all fitness values else if minFitness > 0 subtract minFitness from all fitness values find maximum from current fitness values (maxFitness) divide all fitness values by maxFitness [ 1, 3, 5, 9 ][ 0, 2, 4, 8 ][ 0, 0.25, 0.5, 1 ]

How to Generate CIAO Plots Create an image pixel by pixel. Darker pixels (lower luminance) are considered to be better for the party on the y-axis. Since CIAO plots are grayscale and the fitness values are normalized on [0, 1], each pixel can be set using luminance. Note that fitness may first need to be subtracted from 1 if higher fitness is considered better. luminance = fitness * maxLuminance OR luminance = (1 – fitness) * maxLuminance

Creating Images For building images pixel by pixel, I recommend using Pillow ( This is a fork of the Python Imaging Library. I have used it here to output PNG images. In C++, you might try creating BMP images manually: ▫ creating-image Alternately, there are C++ libraries for this as well, but I have not tried them. For instance: ▫ ▫ possible-to-create-an-image-with-chttp://stackoverflow.com/questions/ /is-it- possible-to-create-an-image-with-c

References Dave Cliff and Geoffrey F. Miller, Tracking the red Queen: Measurements of Adaptive Progress in CoEvolutionary Simulations. In Advances in Artificial Life, Lecture Notes in Computer Science, Volume 929, Pages , Springer-Verlag, Berlin Heidelberg, 1995, ISBN cs.uu.nl/docs/vakken/ias/stuff/cm95.pdf George Rush, Daniel R. Tauritz, and Alexander D. Kent. Coevolutionary Agent-based Network Defense Lightweight Event System (CANDLES). In Proceedings of the 17th Annual Conference Companion on Genetic and Evolutionary Computation (GECCO Comp '15), ACM, pages 859 – 866, Madrid, Spain, July 11-15, 2015.