Classifier Classifier Systems Systems - - PowerPoint PPT Presentation
Classifier Classifier Systems Systems - - PowerPoint PPT Presentation
Classifier Classifier Systems Systems Christian Jacob Christian Jacob jacob@cpsc.ucalgary.ca Department of Computer Science University of Calgary
Cellular Automata Random Boolean Networks Classifier Systems Swarm Systems
2
Classifier Classifier Systems Systems
- J. Holland (1975)
- J. Holland (1975)
Learning syntactically Learning syntactically simple simple string rules string rules ( (classifiers classifiers) to ) to guide guide performance performance in an in an arbitrary arbitrary environment environment
Objective: A Formal Framework for an Objective: A Formal Framework for an Operon Operon-Operator Gene Regulation Model
- Operator Gene Regulation Model
( (Britten Britten-Davidson)
- Davidson)
- J. Holland: Adaptation in Natural and Artificial Systems
4
First a Simple Example ... First a Simple Example ...
F F A classifier system to emulate a frog.
A classifier system to emulate a frog. The frog reacts to objects it sees. The frog reacts to objects it sees.
Moving On the Ground Large Far Striped Flee! Pursue!
Input: Output:
1 _ _ _ _ 1 1 _ 1 1 1
Classifier System in Action Classifier System in Action
Environ- mental Signal Action
Detectors 1 _ 1 Message List Classifiers 1 0 _ : 1 1 1 0 0 _ : 0 0 0 1 x_ 1 : 0 0 x Effectors 1 1 _
101
Classifier System in Action Classifier System in Action
Environ- mental Signal Action
Detectors 1 _ 1 Message List 1 0 1 Classifiers 1 0 _ : 1 1 1 0 0 _ : 0 0 0 1 x_ 1 : 0 0 x Effectors 1 1 _
Classifier System in Action Classifier System in Action
Environ- mental Signal Action
Message List 1 1 1 0 0 0 Classifiers 1 0 _ : 1 1 1 0 0 _ : 0 0 0 1 x_ 1 : 0 0 x Detectors 1 _ 1 Effectors 1 1 _
111
Classifier System in Action Classifier System in Action
Environ- mental Signal Action
Message List 0 0 0 0 0 1 Classifiers 1 0 _ : 1 1 1 0 0 _ : 0 0 0 1 x_ 1 : 0 0 x Detectors 1 _ 1 Effectors 1 1 _
Classifier System in Action Classifier System in Action
Environ- mental Signal Action
Message List 0 0 0 Classifiers 1 0 _ : 1 1 1 0 0 _ : 0 0 0 1 x_ 1 : 0 0 x Detectors 1 _ 1 Effectors 1 1 _
Classifier System in Action Classifier System in Action
Environ- mental Signal Action
Message List 0 0 0 Classifiers 1 0 _ : 1 1 1 0 0 _ : 0 0 0 1 x_ 1 : 0 0 x Detectors 1 _ 1 Effectors 1 1 _
How can we adapt this rule set?
Learning CS Architecture Learning CS Architecture
Environ- mental Signal Action
Detectors 1 _ 1 Effectors 1 1 _ Message List 1 0 1 0 0 0 1 1 1 Classifiers 1 0 _ : 1 1 1 0 0 _ : 0 0 0 1 x_ 1 : 0 0 x
Genetic Algorithm 101
Genetic Algorithms Genetic Algorithms
- J. Holland (1975)
- J. Holland (1975)
- D. Goldberg (1989)
- D. Goldberg (1989)
Simulated Genome Simulated Genome-
- based
based Evolution Evolution
{1,0,1,1,0,1,0,0,1,0,1,1} {0,1,1,1,1,0,0,1,0,0,0,1} {0,0,1,1,0,101,1,0,1,0,0} ... {1,1,0,0,0,1,0,1,0,1,0,0} ... {1,0,1,0,0,1,1,1,0,1,1,1} {0,0,1,1,0,1,1,1,0,1,0,0} {1,0,0,1,0,1,1,1,0,0,0,1}
Binary vector Binary vector decoding interpretation
Genetic Algorithms Genetic Algorithms
Representation of individuals Representation of individuals
{1,0,1,1,0,1,0,0,1,0,1,1} {0,1,1,1,1,0,0,1,0,0,0,1} {1,1,0,0,0,1,0,1,0,1,0,0} ... {1,0,1,0,0,1,1,1,0,1,1,1} {0,0,1,1,0,1,1,1,0,1,0,0} {1,0,0,1,0,1,1,1,0,0,0,1}
{1,1,0,0,0,1,0,1,0,1,0,0} {0,0,1,1,0,1,1,1,0,1,0,0} {1,1,1,1,0,1,0,1,0,0,0,0} {0,1,1,1,0,0,1,1,0,1,1,0}
selection selection mutation mutation
{0,1,1,1,0,1,0,1,0,0,0,0} {1,1,1,1,0,0,1,1,0,1,1,0}
crossover crossover
{1,0,1,1,0,1,0,0,1,0,1,1} {0,1,1,1,1,0,0,1,0,0,0,1} {1,1,0,0,0,1,0,1,0,1,0,0} ... {1,0,1,0,0,1,1,1,0,1,1,1} {0,0,1,1,0,1,1,1,0,1,0,0} {1,0,0,1,0,1,1,1,0,0,0,1}
interpretation evaluation
- Ind. 40
- Ind. 38
- Ind. 7
- Ind. 5
- Ind. 3
- Ind. 1
2 4 6
- Ind. 40
- Ind. 38
- Ind. 7
- Ind. 5
- Ind. 3
- Ind. 1
Learning CS Architecture Learning CS Architecture
Environ- mental Signal Action
Detectors 1 _ 1 Effectors 1 1 _ Message List 1 0 1 0 0 0 1 1 1 Classifiers 1 0 _ : 1 1 1 0 0 _ : 0 0 0 1 x_ 1 : 0 0 x
Genetic Algorithm 101
How do Classifiers Receive How do Classifiers Receive their Fitnesses their Fitnesses? ?
Apportionment of Credit Apportionment of Credit through through Bucket Brigades Bucket Brigades
Bucket Brigade Algorithm Bucket Brigade Algorithm
Index Rule Fitness Triggering Bid Message Rule _______________________________________________________ 1 0 1 _ _ : 0000 200 20 0000 2 0 0 _ 0 : 1100 200 3 1 1 _ _ : 1000 200 4 _ _ 0 0 : 0001 200 ––––––––––––––––––––––––––––––––––––––––––––––––––––––– 1 0 1 _ _ : 0000 180 2 0 0 _ 0 : 1100 200 1 20 1100 3 1 1 _ _ : 1000 200 4 _ _ 0 0 : 0001 200 1 20 0001 –––––––––––––––––––––––––––––––––––––––––––––––––––––––
1 2
Bucket Brigade Algorithm Bucket Brigade Algorithm
Index Rule Fitness Triggering Bid Message Rule _______________________________________________________ 1 0 1 _ _ : 0000 180 2 0 0 _ 0 : 1100 200 1 20 1100 3 1 1 _ _ : 1000 200 4 _ _ 0 0 : 0001 200 1 20 0001 ––––––––––––––––––––––––––––––––––––––––––––––––––––––– 1 0 1 _ _ : 0000 220 2 0 0 _ 0 : 1100 180 3 1 1 _ _ : 1000 200 2 20 1000 4 _ _ 0 0 : 0001 180 2 18 0001 –––––––––––––––––––––––––––––––––––––––––––––––––––––––
2 3
Bucket Brigade Algorithm Bucket Brigade Algorithm
Index Rule Fitness Triggering Bid Message Rule _______________________________________________________ 1 0 1 _ _ : 0000 220 2 0 0 _ 0 : 1100 180 3 1 1 _ _ : 1000 200 2 20 1000 4 _ _ 0 0 : 0001 180 2 18 0001 ––––––––––––––––––––––––––––––––––––––––––––––––––––––– 1 0 1 _ _ : 0000 220 2 0 0 _ 0 : 1100 218 3 1 1 _ _ : 1000 180 4 _ _ 0 0 : 0001 162 3 16 0001 –––––––––––––––––––––––––––––––––––––––––––––––––––––––
3 4
Bucket Brigade Algorithm Bucket Brigade Algorithm
Index Rule Fitness Triggering Bid Message Rule _______________________________________________________ 1 0 1 _ _ : 0000 220 2 0 0 _ 0 : 1100 218 3 1 1 _ _ : 1000 180 4 _ _ 0 0 : 0001 162 3 16 0001 ––––––––––––––––––––––––––––––––––––––––––––––––––––––– 1 0 1 _ _ : 0000 220 2 0 0 _ 0 : 1100 218 3 1 1 _ _ : 1000 196 4 _ _ 0 0 : 0001 146 –––––––––––––––––––––––––––––––––––––––––––––––––––––––
4 5
Bucket Brigade Algorithm Bucket Brigade Algorithm
Index Rule Fitness Triggering Bid Message Rule _______________________________________________________ 1 0 1 _ _ : 0000 220 2 0 0 _ 0 : 1100 218 3 1 1 _ _ : 1000 180 4 _ _ 0 0 : 0001 162 3 16 0001 ––––––––––––––––––––––––––––––––––––––––––––––––––––––– 1 0 1 _ _ : 0000 220 2 0 0 _ 0 : 1100 218 3 1 1 _ _ : 1000 196 4 _ _ 0 0 : 0001 146 –––––––––––––––––––––––––––––––––––––––––––––––––––––––
4 5 Here are the fitnesses
The Broadcast Language The Broadcast Language
- J. Holland (1975)
- J. Holland (1975)
A Formal A Formal Framework for Modeling Framework for Modeling Evolvable Evolvable Gene Regulation Gene Regulation Networks Networks
Backing up again: A Formal Framework for an Backing up again: A Formal Framework for an Operon Operon-Operator Gene Regulation Model
- Operator Gene Regulation Model
( (Britten Britten-Davidson)
- Davidson)
- J. Holland: Adaptation in Natural and Artificial Systems
48
Broadcast Units Broadcast Units
F F BC[
BC[ S S1
1,
, S S2
2,
, S S3
3,
, S S4
4]
] If If at time at time t t a signal of type a signal of type S S1
1 is present
is present and and no signal of type no signal of type S S2
2 is present,
is present, then then at time at time t t+1 +1 the signal the signal S S3
3 is broadcast
is broadcast and and the signal the signal S S4
4 is deleted at time
is deleted at time t t. .
Gene Regulation with BC Units Gene Regulation with BC Units
F F Sensor-integrator gene complex
Sensor-integrator gene complex SI SI1
1I
I2
2I
I3
3:
: BC[ BC[ S S, _, { , _, {I I1
1,
, I I2
2,
, I I3
3}, _]
}, _]
F F Receptor-producer complex
Receptor-producer complex R R1
1R
R2
2P
P: : BC[{ BC[{R R1
1,
, R R2
2}, _,