HIDDEN ORDER Chapter 1: Basic Elements. Complex Adaptive Systems (cas) Aggregates of independent agents Agents behavior governed by a collection of rules.

Slides:



Advertisements
Similar presentations
Slides from: Doug Gray, David Poole
Advertisements

Tetris and Genetic Algorithms Math Club 5/30/2011.
Forecasting the Future using Computer Simulation Models Presentation by Jon Roland April 18, 2006
Chapter 4 DECISION SUPPORT AND ARTIFICIAL INTELLIGENCE
EC: Lecture 17: Classifier Systems Ata Kaban University of Birmingham.
Genetic Algorithms and Their Applications John Paxton Montana State University August 14, 2003.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Simulation.
Lecture of Norm Margolus. Physical Worlds Some regular spatial systems: –1. Programmable gate arrays at the atomic scale –2. Fundamental finite-state.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Chapter Seven The Network Approach: Mind as a Web.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
6/4/03Genetic Algorithm The Genetic Algorithm The Research of Robert Axelrod The Algorithm of John Holland Reviewed by Eyal Allweil and Ami Blonder.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Neural Networks Slides by Megan Vasta. Neural Networks Biological approach to AI Developed in 1943 Comprised of one or more layers of neurons Several.
Neural Networks. Background - Neural Networks can be : Biological - Biological models Artificial - Artificial models - Desire to produce artificial systems.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
BIOLOGY – EXPLORING LIFE
MAKING COMPLEX DEClSlONS
MSE 2400 EaLiCaRA Spring 2015 Dr. Tom Way
Population GENETICS.
Learning in Multiagent systems
Copyright © 2002, Bryan Coffman, James Smethurst, Michael Kaufman, Langdon Morris a brief introduction complex adaptive systems to.
Week 3a Mechanisms for Adaptation. POLS-GEOG-SOC 495 Spring Lecture Overview Review –CAS –Principles of chaos How do systems “learn”? –“Credit.
Discrete Mathematical Structures (Counting Principles)
Schemata Theory Chapter 11. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Theory Why Bother with Theory? Might provide performance.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
A Graph-based Friend Recommendation System Using Genetic Algorithm
Lesson 2.2 Finding the nth term
ART – Artificial Reasoning Toolkit Evolving a complex system Marco Lamieri
Soft Computing A Gentle introduction Richard P. Simpson.
GENETIC ALGORITHMS.  Genetic algorithms are a form of local search that use methods based on evolution to make small changes to a popula- tion of chromosomes.
Evolution of Populations Chapter Genes and Variation Darwin’s handicap while developing theory of evolution Darwin’s handicap while developing.
Algorithms and their Applications CS2004 ( ) 13.1 Further Evolutionary Computation.
Mechanisms of Population Evolution
1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.
Neural Networks and Machine Learning Applications CSC 563 Prof. Mohamed Batouche Computer Science Department CCIS – King Saud University Riyadh, Saudi.
Neural Networks Chapter 7
Evolution and Population GENETICS
Chapter 21 The Mechanics of Evolution Biology 101 Tri-County Technical College Pendleton, SC.
Tetris Agent Optimization Using Harmony Search Algorithm
Edge Assembly Crossover
MAE 552 Heuristic Optimization Instructor: John Eddy Lecture #12 2/20/02 Evolutionary Algorithms.
CS 478 – Tools for Machine Learning and Data Mining Perceptron.
1. Genetic Algorithms: An Overview  Objectives - Studying basic principle of GA - Understanding applications in prisoner’s dilemma & sorting network.
Evolution of Populations. The Smallest Unit of Evolution Natural selection acts on individuals, but only populations evolve – Genetic variations contribute.
1. Genetic Algorithms: An Overview 4 학습목표 GA 의 기본원리를 파악하고, Prisoner’s dilemma 와 sorting network 에의 응용 및 이론적 배경을 이해한 다.
Artificial Intelligence: Research and Collaborative Possibilities a presentation by: Dr. Ernest L. McDuffie, Assistant Professor Department of Computer.
Agent-Based Modeling PSC 120 Jeff Schank. Introduction What are Models? Models are Scaffolds for Understanding Models are always false, but very useful.
Chapter 20 Mechanisms for Evolution Biology 3201.
Artificial Neural Networks (ANN). Artificial Neural Networks First proposed in 1940s as an attempt to simulate the human brain’s cognitive learning processes.
Organic Evolution and Problem Solving Je-Gun Joung.
Neural Networks. Background - Neural Networks can be : Biological - Biological models Artificial - Artificial models - Desire to produce artificial systems.
Evolution of Cooperation in Mobile Ad Hoc Networks Jeff Hudack (working with some Italian guy)
The Theory of Evolution.  Darwin developed the first theory on evolution, which is the basis for modern evolutionary theory ◦ Darwin spent 5 years sailing.
The Theory of Evolution
Deep Learning Amin Sobhani.
Fall 2004 Perceptron CS478 - Machine Learning.
Study of Life Chapter 1 Themes
Sistemi per la Gestione Aziendale.
Themes of Biology Chapter 1
The Evolution of Populations
Biology: Exploring Life
Biology: Exploring Life
Biology: Exploring Life
R. W. Eberth Sanderling Research, Inc. 01 May 2007
Warm Up Describe natural selection and how this leads to evolution.
Boltzmann Machine (BM) (§6.4)
A Gentle introduction Richard P. Simpson
The Network Approach: Mind as a Web
Presentation transcript:

HIDDEN ORDER Chapter 1: Basic Elements

Complex Adaptive Systems (cas) Aggregates of independent agents Agents behavior governed by a collection of rules Persistence and coherence in the face of change –Dependent on extensive interaction, aggregation of diverse elements, and adaptation and learning i.e. economy, ecosystem, CNS

Objectives Purpose of the book is to formulate a solid theory about complex adaptive systems –Separate fundamental characteristics from idiosyncrasies –Difficult to do because of nonlinearities –Compensate with cross-disciplinary comparisons

Seven Basics Four properties and three mechanisms shared by all cas Not the only shared characteristics. The rest can be built from a combination of these seven

Aggregation (Property) 2 senses 1 st Sense: Constructing Models 2 nd Sense: What cas do –Emergence of complexity from a network of simpler agents. –Aggregates can act as agents in higher-level structures (meta-agents) –i.e. Cells  Tissues  Organs  Organ Systems  Organism

Tagging (Mechanism) A mechanism that facilitates aggregation by bringing like things together –i.e. a flag used to rally a group of people, pheromones and visual patterns that lead to selective mating Allow observation of properties hidden by symmetry. –i.e. painting a stripe on a cue ball to see changes in the axis of rotation

Nonlinearity (Property) A function is linear its value can be calculated by adding the values of its parts. –i.e. A=B+C Nonlinearlity of Pool Ball Example –(B+W)(t+1)=(B+W)+c(B)(W) –(G+W)(t+1)=(G+W)+c’(G)(W) –Can we simplify the model by aggregating B and G into a single category S? (S=B+G) –No. There is no coefficient that works for all combinations of B and G. –If the function was linear, then we could take the average of c and c’

Flow (Property) [node, connector, resource] [phones, phone lines, conversations] Multiplier Effect –Occurs after additional resource is added at a node –Initial effect is multiplied as the resource is passed through the network Recycling Effect –Result of cycles in a network –Recycling with the same input produces a greater output at each node

Diversity (Property) Not random. System will adapt to fill holes. –New agent typically occupies same niche as previous agent and provides most of the missing connections –Leads to convergence in biology i.e. squid vs. mammalian eye –Founder Effect

Diversity (Property) Pattern of diversity in cas is dynamic. Diversity is a product of adaptation. Each new adaptation creates possibilities of new interactions and new niches

Internal Models (mechanism) Allows for anticipation Two types –Tactit: prescribes an action under an implicit prediction of a desired future state i.e. a bacteria swimming up a nutrient gradient –Overt: used as a basis for explicit explorations of alternatives (lookahead) i.e. exploring possible scenarios before moving a chess piece

Building Blocks How are internal models built from constantly changing environments? –Situations are distilled into useful and relevant building blocks –A flat tire while driving a red Saab on the expressway? –Decompose into rules about cars, tires, and expressways

Hidden Order Chapter 2 Adaptive Agents By John Holland

Requirements of Adaptive Agents 1.Performance System - a universal way to represent the capabilities of different agents using messages and conditional rules 2.Rule Discovery - making changes to an agent’s capabilities by means of a credit score

Making Use of Binary A detector receives a message when conditions are met, the result of which triggers an action and completes the rule Messages - strings of 1’s and 0’s of length (L) Conditions - strings 1’s, 0’s and #’s (signifying no specificity), also of length L

Messages from Two Sources 1)Detector Originated - derived from and given meaning by the environment 2)Rule Originated - produced by other rules, given meaning only when they activate effectors

Credit Scores Rules have strength that is like having cash on hand, and can be viewed as being producers, middlemen, or consumers that buy, sell, and trade messages The ultimate consumer is the rule that is active when the agent receives a reward from the environment All rules down the line are credited and automatically strengthened

Building Blocks Rules can be divided into building blocks called schemata. Successful rules have schemata that in general serve as better building blocks than random binary strings Successful schemata are singled out by replacing other parts of the sequence with the * symbol

Crossing Over Binary sequences are crossed over using the genetic algorithm Short schemata are conserved through probability Longer schemata are preserved because they are composed of shorter successful schemata that appear in a large portion of the gene pool

Mutation Successful rules can become fixed in a population before other more successful rules can be discovered Random mutations disrupt fixation during crossing over, restoring adaptation

The Prisoner’s Dilemma A game where two players simultaneously decide to defect (D), or cooperate (C) Tit-for-tat is a favorable strategy that produces a relatively large number of points Agents that begin with schemata for tit-for-tat discover better strategies by deciding on whether an opponent is bluffing or not