204
Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion Sufficient Conditions for Coarse-Graining Evolutionary Dynamics Keki Burjorjee DEMO Lab Computer Science Department Brandeis University Waltham, MA, USA FOGA IX (2007) Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Embed Size (px)

Citation preview

Page 1: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Sufficient Conditions for Coarse-GrainingEvolutionary Dynamics

Keki Burjorjee

DEMO LabComputer Science Department

Brandeis UniversityWaltham, MA, USA

FOGA IX (2007)

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 2: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Genetic Algorithms and the Building Block Hypothesis

I In 1975 Holland published his seminal work on GAsI Description of the Genetic AlgorithmI A theory of adaptation for GAs

I which later came to be known as BBH

I GAs useful for adapting solutions to difficult real worldproblems

I However BBH has drawn considerable skepticism amongstmany researchers (e.g. Vose, Wright, Rowe)

I Despite criticism of BBH, no alternate full-fledged theories ofadaptation have been proposed

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 3: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Genetic Algorithms and the Building Block Hypothesis

I In 1975 Holland published his seminal work on GAsI Description of the Genetic AlgorithmI A theory of adaptation for GAs

I which later came to be known as BBH

I GAs useful for adapting solutions to difficult real worldproblems

I However BBH has drawn considerable skepticism amongstmany researchers (e.g. Vose, Wright, Rowe)

I Despite criticism of BBH, no alternate full-fledged theories ofadaptation have been proposed

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 4: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Genetic Algorithms and the Building Block Hypothesis

I In 1975 Holland published his seminal work on GAsI Description of the Genetic AlgorithmI A theory of adaptation for GAs

I which later came to be known as BBH

I GAs useful for adapting solutions to difficult real worldproblems

I However BBH has drawn considerable skepticism amongstmany researchers (e.g. Vose, Wright, Rowe)

I Despite criticism of BBH, no alternate full-fledged theories ofadaptation have been proposed

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 5: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Genetic Algorithms and the Building Block Hypothesis

I In 1975 Holland published his seminal work on GAsI Description of the Genetic AlgorithmI A theory of adaptation for GAs

I which later came to be known as BBH

I GAs useful for adapting solutions to difficult real worldproblems

I However BBH has drawn considerable skepticism amongstmany researchers (e.g. Vose, Wright, Rowe)

I Despite criticism of BBH, no alternate full-fledged theories ofadaptation have been proposed

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 6: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Genetic Algorithms and the Building Block Hypothesis

I In 1975 Holland published his seminal work on GAsI Description of the Genetic AlgorithmI A theory of adaptation for GAs

I which later came to be known as BBH

I GAs useful for adapting solutions to difficult real worldproblems

I However BBH has drawn considerable skepticism amongstmany researchers (e.g. Vose, Wright, Rowe)

I Despite criticism of BBH, no alternate full-fledged theories ofadaptation have been proposed

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 7: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Genetic Algorithms and the Building Block Hypothesis

I In 1975 Holland published his seminal work on GAsI Description of the Genetic AlgorithmI A theory of adaptation for GAs

I which later came to be known as BBH

I GAs useful for adapting solutions to difficult real worldproblems

I However BBH has drawn considerable skepticism amongstmany researchers (e.g. Vose, Wright, Rowe)

I Despite criticism of BBH, no alternate full-fledged theories ofadaptation have been proposed

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 8: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

No Alternate Theories of Adaptation for GAs — Why?

I For genomes of non-trivial length, current theoretical results donot permit the formulation of principled theories of adaptation

I Schema theories only permit a tractable analysis ofevolutionary dynamics over a single generation

I Markov Chain approaches only yield a qualitative description ofevolutionary dynamics in the asymptote of time

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 9: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

No Alternate Theories of Adaptation for GAs — Why?

I For genomes of non-trivial length, current theoretical results donot permit the formulation of principled theories of adaptation

I Schema theories only permit a tractable analysis ofevolutionary dynamics over a single generation

I Markov Chain approaches only yield a qualitative description ofevolutionary dynamics in the asymptote of time

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 10: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

No Alternate Theories of Adaptation for GAs — Why?

I For genomes of non-trivial length, current theoretical results donot permit the formulation of principled theories of adaptation

I Schema theories only permit a tractable analysis ofevolutionary dynamics over a single generation

I Markov Chain approaches only yield a qualitative description ofevolutionary dynamics in the asymptote of time

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 11: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

No Alternate Theories of Adaptation for GAs — Why?

I For genomes of non-trivial length, current theoretical results donot permit the formulation of principled theories of adaptation

I Schema theories only permit a tractable analysis ofevolutionary dynamics over a single generation

I Markov Chain approaches only yield a qualitative description ofevolutionary dynamics in the asymptote of time

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 12: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

No Alternate Theories of Adaptation for GAs — Why?

I The infinite population assumption is often used to makemathematical models of GA dynamics tractable

I Even with this assumption there are currently no theoreticalresults which permit a principled analysis of any aspect of GAbehavior over the “short-term”

I “short-term” = small number of generations

No theoretical results that Accurate theories ofpermit principled short-term ⇒ adaptation for GAs willanalyses of evolutionary evade discoverydynamics

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 13: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

No Alternate Theories of Adaptation for GAs — Why?

I The infinite population assumption is often used to makemathematical models of GA dynamics tractable

I Even with this assumption there are currently no theoreticalresults which permit a principled analysis of any aspect of GAbehavior over the “short-term”

I “short-term” = small number of generations

No theoretical results that Accurate theories ofpermit principled short-term ⇒ adaptation for GAs willanalyses of evolutionary evade discoverydynamics

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 14: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

No Alternate Theories of Adaptation for GAs — Why?

I The infinite population assumption is often used to makemathematical models of GA dynamics tractable

I Even with this assumption there are currently no theoreticalresults which permit a principled analysis of any aspect of GAbehavior over the “short-term”

I “short-term” = small number of generations

No theoretical results that Accurate theories ofpermit principled short-term ⇒ adaptation for GAs willanalyses of evolutionary evade discoverydynamics

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 15: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

No Alternate Theories of Adaptation for GAs — Why?

I The infinite population assumption is often used to makemathematical models of GA dynamics tractable

I Even with this assumption there are currently no theoreticalresults which permit a principled analysis of any aspect of GAbehavior over the “short-term”

I “short-term” = small number of generations

No theoretical results that Accurate theories ofpermit principled short-term ⇒ adaptation for GAs willanalyses of evolutionary evade discoverydynamics

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 16: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

The Promise of Coarse-Graining

I Coarse-graining a very useful technique from theoreticalPhysics

I If successfully applied to an IPGA it permits a principledanalysis of certain aspects of the IPGA’s dynamics overmultiple generations

I Therefore coarse-graining is a promising approach to theformulation of principled theories of evolutionary adaptation

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 17: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

The Promise of Coarse-Graining

I Coarse-graining a very useful technique from theoreticalPhysics

I If successfully applied to an IPGA it permits a principledanalysis of certain aspects of the IPGA’s dynamics overmultiple generations

I Therefore coarse-graining is a promising approach to theformulation of principled theories of evolutionary adaptation

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 18: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

The Promise of Coarse-Graining

I Coarse-graining a very useful technique from theoreticalPhysics

I If successfully applied to an IPGA it permits a principledanalysis of certain aspects of the IPGA’s dynamics overmultiple generations

I Therefore coarse-graining is a promising approach to theformulation of principled theories of evolutionary adaptation

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 19: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

The Promise of Coarse-Graining

I Coarse-graining a very useful technique from theoreticalPhysics

I If successfully applied to an IPGA it permits a principledanalysis of certain aspects of the IPGA’s dynamics overmultiple generations

I Therefore coarse-graining is a promising approach to theformulation of principled theories of evolutionary adaptation

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 20: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Coarse-Graining by Depiction

.

.

.

xt+11 = . . .

xt+11,000,000,000,000 = . . .

xt+12 = . . .

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 21: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Coarse-Graining by Depiction

.

.

.

xt+11 = . . .

xt+11,000,000,000,000 = . . .

xt+12 = . . .

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 22: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Coarse-Graining by Depiction

Partition Function

...

xt+11 = . . .

xt+11,000,000,000,000 = . . .

xt+12 = . . .

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 23: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Coarse-Graining by Depiction

Coarse-graining

...

xt+11 = . . .

xt+11,000,000,000,000 = . . .

yt+11 = . . .

yt+12 = . . .

...y

t+110 = . . .

Partition Function

xt+12 = . . .

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 24: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Coarse-Graining by Depiction

Coarse-graining

...

xt+11 = . . .

xt+11,000,000,000,000 = . . .

yt+11 = . . .

yt+12 = . . .

...y

t+110 = . . .

Partition Function

xt+12 = . . .

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 25: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Coarse-Graining by Depiction

Coarse-graining

...

xt+11 = . . .

xt+11,000,000,000,000 = . . .

yt+11 = . . .

yt+12 = . . .

...y

t+110 = . . .

Partition Function

xt+12 = . . .

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 26: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Coarse-Graining by Depiction

yt+110 = . . .

yt+11 = . . .

yt+12 = . . .

.

.

.

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 27: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Coarse-Graining by Depiction

yt+110 = . . .

yt+11 = . . .

yt+12 = . . .

.

.

.

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 28: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Coarse-Graining by Depiction

Partition Function

yt+11 = . . .

yt+12 = . . .

...

yt+110 = . . .

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 29: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Previous Coarse-Graining Results

I Wright, Vose, and Rowe (Wright et al. 2003) show that anymask based recombination operation of an IPGA can becoarse-grained.

I However they argue that the selecto-recombinative dynamicsof an IPGA with an arbitrary initial population cannot becoarse-grained unless the fitness function satisfies a verystrong constraint

I I call this constraint schematic fitness invarianceI for some schema partition, and for any schema in the partition,

all the genomes in the schema have exactly the same fitness

I Wright et al. argue that schematic fitness invariance is sostrong that it renders a coarse-graining ofselecto-recombinative dynamics useless

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 30: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Previous Coarse-Graining Results

I Wright, Vose, and Rowe (Wright et al. 2003) show that anymask based recombination operation of an IPGA can becoarse-grained.

I However they argue that the selecto-recombinative dynamicsof an IPGA with an arbitrary initial population cannot becoarse-grained unless the fitness function satisfies a verystrong constraint

I I call this constraint schematic fitness invarianceI for some schema partition, and for any schema in the partition,

all the genomes in the schema have exactly the same fitness

I Wright et al. argue that schematic fitness invariance is sostrong that it renders a coarse-graining ofselecto-recombinative dynamics useless

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 31: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Previous Coarse-Graining Results

I Wright, Vose, and Rowe (Wright et al. 2003) show that anymask based recombination operation of an IPGA can becoarse-grained.

I However they argue that the selecto-recombinative dynamicsof an IPGA with an arbitrary initial population cannot becoarse-grained unless the fitness function satisfies a verystrong constraint

I I call this constraint schematic fitness invarianceI for some schema partition, and for any schema in the partition,

all the genomes in the schema have exactly the same fitness

I Wright et al. argue that schematic fitness invariance is sostrong that it renders a coarse-graining ofselecto-recombinative dynamics useless

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 32: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Previous Coarse-Graining Results

I Wright, Vose, and Rowe (Wright et al. 2003) show that anymask based recombination operation of an IPGA can becoarse-grained.

I However they argue that the selecto-recombinative dynamicsof an IPGA with an arbitrary initial population cannot becoarse-grained unless the fitness function satisfies a verystrong constraint

I I call this constraint schematic fitness invarianceI for some schema partition, and for any schema in the partition,

all the genomes in the schema have exactly the same fitness

I Wright et al. argue that schematic fitness invariance is sostrong that it renders a coarse-graining ofselecto-recombinative dynamics useless

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 33: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Previous Coarse-Graining Results

I Wright, Vose, and Rowe (Wright et al. 2003) show that anymask based recombination operation of an IPGA can becoarse-grained.

I However they argue that the selecto-recombinative dynamicsof an IPGA with an arbitrary initial population cannot becoarse-grained unless the fitness function satisfies a verystrong constraint

I I call this constraint schematic fitness invarianceI for some schema partition, and for any schema in the partition,

all the genomes in the schema have exactly the same fitness

I Wright et al. argue that schematic fitness invariance is sostrong that it renders a coarse-graining ofselecto-recombinative dynamics useless

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 34: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Comparison between Coarse-Graining Results

I I show that if the class of initial populations is appropriatelyconstrained then it is possible to coarse-grain theselecto-recombinative dynamics of an IPGA for a much weakerconstraint on the fitness function

I The constraint on the class of initial populations is notonerous

I A uniformly distributed population satisfies this constraint

I The constraint on the fitness function is weak enough that itmakes the coarse-graining result potentially useful in a theoryof adaptation

Constraint on Constraint onInitial Population Fitness Function

Wright et al. 2003 None Severe

Burjorjee 2007 Non-onerous Weak

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 35: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Comparison between Coarse-Graining Results

I I show that if the class of initial populations is appropriatelyconstrained then it is possible to coarse-grain theselecto-recombinative dynamics of an IPGA for a much weakerconstraint on the fitness function

I The constraint on the class of initial populations is notonerous

I A uniformly distributed population satisfies this constraint

I The constraint on the fitness function is weak enough that itmakes the coarse-graining result potentially useful in a theoryof adaptation

Constraint on Constraint onInitial Population Fitness Function

Wright et al. 2003 None Severe

Burjorjee 2007 Non-onerous Weak

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 36: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Comparison between Coarse-Graining Results

I I show that if the class of initial populations is appropriatelyconstrained then it is possible to coarse-grain theselecto-recombinative dynamics of an IPGA for a much weakerconstraint on the fitness function

I The constraint on the class of initial populations is notonerous

I A uniformly distributed population satisfies this constraint

I The constraint on the fitness function is weak enough that itmakes the coarse-graining result potentially useful in a theoryof adaptation

Constraint on Constraint onInitial Population Fitness Function

Wright et al. 2003 None Severe

Burjorjee 2007 Non-onerous Weak

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 37: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Comparison between Coarse-Graining Results

I I show that if the class of initial populations is appropriatelyconstrained then it is possible to coarse-grain theselecto-recombinative dynamics of an IPGA for a much weakerconstraint on the fitness function

I The constraint on the class of initial populations is notonerous

I A uniformly distributed population satisfies this constraint

I The constraint on the fitness function is weak enough that itmakes the coarse-graining result potentially useful in a theoryof adaptation

Constraint on Constraint onInitial Population Fitness Function

Wright et al. 2003 None Severe

Burjorjee 2007 Non-onerous Weak

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 38: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Comparison between Coarse-Graining Results

I I show that if the class of initial populations is appropriatelyconstrained then it is possible to coarse-grain theselecto-recombinative dynamics of an IPGA for a much weakerconstraint on the fitness function

I The constraint on the class of initial populations is notonerous

I A uniformly distributed population satisfies this constraint

I The constraint on the fitness function is weak enough that itmakes the coarse-graining result potentially useful in a theoryof adaptation

Constraint on Constraint onInitial Population Fitness Function

Wright et al. 2003 None Severe

Burjorjee 2007 Non-onerous Weak

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 39: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Comparison between Coarse-Graining Results

I I show that if the class of initial populations is appropriatelyconstrained then it is possible to coarse-grain theselecto-recombinative dynamics of an IPGA for a much weakerconstraint on the fitness function

I The constraint on the class of initial populations is notonerous

I A uniformly distributed population satisfies this constraint

I The constraint on the fitness function is weak enough that itmakes the coarse-graining result potentially useful in a theoryof adaptation

Constraint on Constraint onInitial Population Fitness Function

Wright et al. 2003 None Severe

Burjorjee 2007 Non-onerous Weak

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 40: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Comparison between Coarse-Graining Results

I I show that if the class of initial populations is appropriatelyconstrained then it is possible to coarse-grain theselecto-recombinative dynamics of an IPGA for a much weakerconstraint on the fitness function

I The constraint on the class of initial populations is notonerous

I A uniformly distributed population satisfies this constraint

I The constraint on the fitness function is weak enough that itmakes the coarse-graining result potentially useful in a theoryof adaptation

Constraint on Constraint onInitial Population Fitness Function

Wright et al. 2003 None Severe

Burjorjee 2007 Non-onerous Weak

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 41: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Structure of this Talk

1. Describe an abstract framework for analyzing the dynamics ofa selecto-recombinative infinite population EA (IPEA)

2. Describe the theoretical technique used to Coarse-Grain thedynamics of an IPEA

3. Present results that show that these dynamics can becoarse-grained provided that the IPEA satisfies certainabstract conditions

4. Describe how the coarse-graining results can be used tocoarse-grain the dynamics of an IPGA with long genomes anda non-trivial fitness functions

5. Present experimental validation of this theory

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 42: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Structure of this Talk

1. Describe an abstract framework for analyzing the dynamics ofa selecto-recombinative infinite population EA (IPEA)

2. Describe the theoretical technique used to Coarse-Grain thedynamics of an IPEA

3. Present results that show that these dynamics can becoarse-grained provided that the IPEA satisfies certainabstract conditions

4. Describe how the coarse-graining results can be used tocoarse-grain the dynamics of an IPGA with long genomes anda non-trivial fitness functions

5. Present experimental validation of this theory

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 43: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Structure of this Talk

1. Describe an abstract framework for analyzing the dynamics ofa selecto-recombinative infinite population EA (IPEA)

2. Describe the theoretical technique used to Coarse-Grain thedynamics of an IPEA

3. Present results that show that these dynamics can becoarse-grained provided that the IPEA satisfies certainabstract conditions

4. Describe how the coarse-graining results can be used tocoarse-grain the dynamics of an IPGA with long genomes anda non-trivial fitness functions

5. Present experimental validation of this theory

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 44: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Structure of this Talk

1. Describe an abstract framework for analyzing the dynamics ofa selecto-recombinative infinite population EA (IPEA)

2. Describe the theoretical technique used to Coarse-Grain thedynamics of an IPEA

3. Present results that show that these dynamics can becoarse-grained provided that the IPEA satisfies certainabstract conditions

4. Describe how the coarse-graining results can be used tocoarse-grain the dynamics of an IPGA with long genomes anda non-trivial fitness functions

5. Present experimental validation of this theory

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 45: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Structure of this Talk

1. Describe an abstract framework for analyzing the dynamics ofa selecto-recombinative infinite population EA (IPEA)

2. Describe the theoretical technique used to Coarse-Grain thedynamics of an IPEA

3. Present results that show that these dynamics can becoarse-grained provided that the IPEA satisfies certainabstract conditions

4. Describe how the coarse-graining results can be used tocoarse-grain the dynamics of an IPGA with long genomes anda non-trivial fitness functions

5. Present experimental validation of this theory

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 46: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Structure of this Talk

1. Describe an abstract framework for analyzing the dynamics ofa selecto-recombinative infinite population EA (IPEA)

2. Describe the theoretical technique used to Coarse-Grain thedynamics of an IPEA

3. Present results that show that these dynamics can becoarse-grained provided that the IPEA satisfies certainabstract conditions

4. Describe how the coarse-graining results can be used tocoarse-grain the dynamics of an IPGA with long genomes anda non-trivial fitness functions

5. Present experimental validation of this theory

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 47: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Modeling Populations and Operations on Populations

I Modeling scheme based on the one used in (Toussaint 2003)I Populations modeled as distributions over the genome set

I Distribution values sum to 1

I Population-level effect of evolutionary operations modeled asthe application of parameterized mathematical operators togenomic distributions

I Parameter objects used by the operators (fitness function,transmission function) give individual-level information aboutthe genomes

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 48: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Modeling Populations and Operations on Populations

I Modeling scheme based on the one used in (Toussaint 2003)I Populations modeled as distributions over the genome set

I Distribution values sum to 1

I Population-level effect of evolutionary operations modeled asthe application of parameterized mathematical operators togenomic distributions

I Parameter objects used by the operators (fitness function,transmission function) give individual-level information aboutthe genomes

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 49: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Modeling Populations and Operations on Populations

I Modeling scheme based on the one used in (Toussaint 2003)I Populations modeled as distributions over the genome set

I Distribution values sum to 1

I Population-level effect of evolutionary operations modeled asthe application of parameterized mathematical operators togenomic distributions

I Parameter objects used by the operators (fitness function,transmission function) give individual-level information aboutthe genomes

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 50: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Modeling Populations and Operations on Populations

I Modeling scheme based on the one used in (Toussaint 2003)I Populations modeled as distributions over the genome set

I Distribution values sum to 1

I Population-level effect of evolutionary operations modeled asthe application of parameterized mathematical operators togenomic distributions

I Parameter objects used by the operators (fitness function,transmission function) give individual-level information aboutthe genomes

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 51: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Modeling Populations and Operations on Populations

I Modeling scheme based on the one used in (Toussaint 2003)I Populations modeled as distributions over the genome set

I Distribution values sum to 1

I Population-level effect of evolutionary operations modeled asthe application of parameterized mathematical operators togenomic distributions

I Parameter objects used by the operators (fitness function,transmission function) give individual-level information aboutthe genomes

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 52: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Transmission Functions

I Use transmission functions (Altenberg 1994) to represent thevariational information at the individual-level

I Example: T (g |g1, . . . gn) is the probability that parentsg1, . . . , gn will yield a child g when recombined

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 53: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Transmission Functions

I Use transmission functions (Altenberg 1994) to represent thevariational information at the individual-level

I Example: T (g |g1, . . . gn) is the probability that parentsg1, . . . , gn will yield a child g when recombined

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 54: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Transmission Functions

I Use transmission functions (Altenberg 1994) to represent thevariational information at the individual-level

I Example: T (g |g1, . . . gn) is the probability that parentsg1, . . . , gn will yield a child g when recombined

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 55: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Modeling the Effect of Variation on Populations

I Given some transmission function T , the effect of variation atthe population-level is modeled by the variation operator VT

I For some population p, if p′ = VT (p), then, p′ is as follows:

p′(g) =∑

(g1,...,gm)∈

∏m1 G

T (g |g1, . . . , gm)m∏

i=1

p(gi )

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 56: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Modeling the Effect of Variation on Populations

I Given some transmission function T , the effect of variation atthe population-level is modeled by the variation operator VT

I For some population p, if p′ = VT (p), then, p′ is as follows:

p′(g) =∑

(g1,...,gm)∈

∏m1 G

T (g |g1, . . . , gm)m∏

i=1

p(gi )

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 57: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Modeling the Effect of Variation on Populations

I Given some transmission function T , the effect of variation atthe population-level is modeled by the variation operator VT

I For some population p, if p′ = VT (p), then, p′ is as follows:

p′(g) =∑

(g1,...,gm)∈

∏m1 G

T (g |g1, . . . , gm)m∏

i=1

p(gi )

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 58: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Modeling the Effect of Selection on Populations

I Given some fitness function f : G → R+, the effect of fitnessproportional selection is modeled by the selection operator Sf

I For some population p, if p′ = Sf (p), then p′ is as follows: Forany genotype g ,

p′(g) =f (g)p(g)

Ef (p)

where Ef is the weighted average fitness of p

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 59: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Modeling the Effect of Selection on Populations

I Given some fitness function f : G → R+, the effect of fitnessproportional selection is modeled by the selection operator Sf

I For some population p, if p′ = Sf (p), then p′ is as follows: Forany genotype g ,

p′(g) =f (g)p(g)

Ef (p)

where Ef is the weighted average fitness of p

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 60: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Modeling the Effect of Selection on Populations

I Given some fitness function f : G → R+, the effect of fitnessproportional selection is modeled by the selection operator Sf

I For some population p, if p′ = Sf (p), then p′ is as follows: Forany genotype g ,

p′(g) =f (g)p(g)

Ef (p)

where Ef is the weighted average fitness of p

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 61: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Some Terminology and Notation

I β : G → K a surjective functionI Call β a partitioningI Call co-domain K the theme setI Call the elements of K themes

I 〈k〉β denotes the set of all g ∈ G such that β(g) = k

I Call 〈k〉β the theme class of k under β

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 62: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Some Terminology and Notation

I β : G → K a surjective functionI Call β a partitioningI Call co-domain K the theme setI Call the elements of K themes

I 〈k〉β denotes the set of all g ∈ G such that β(g) = k

I Call 〈k〉β the theme class of k under β

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 63: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Some Terminology and Notation

I β : G → K a surjective functionI Call β a partitioningI Call co-domain K the theme setI Call the elements of K themes

I 〈k〉β denotes the set of all g ∈ G such that β(g) = k

I Call 〈k〉β the theme class of k under β

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 64: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Some Terminology and Notation

I β : G → K a surjective functionI Call β a partitioningI Call co-domain K the theme setI Call the elements of K themes

I 〈k〉β denotes the set of all g ∈ G such that β(g) = k

I Call 〈k〉β the theme class of k under β

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 65: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Some Terminology and Notation

I β : G → K a surjective functionI Call β a partitioningI Call co-domain K the theme setI Call the elements of K themes

I 〈k〉β denotes the set of all g ∈ G such that β(g) = k

I Call 〈k〉β the theme class of k under β

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 66: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Some Terminology and Notation

I β : G → K a surjective functionI Call β a partitioningI Call co-domain K the theme setI Call the elements of K themes

I 〈k〉β denotes the set of all g ∈ G such that β(g) = k

I Call 〈k〉β the theme class of k under β

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 67: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Some Terminology and Notation

I β : G → K a surjective functionI Call β a partitioningI Call co-domain K the theme setI Call the elements of K themes

I 〈k〉β denotes the set of all g ∈ G such that β(g) = k

I Call 〈k〉β the theme class of k under β

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 68: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Projection Operator

I Let β : G → K be a partitioningI A projection operator Ξβ ‘projects’ a distribution pG over G

‘through’ β to create a distribution pK = Ξβ(pG ) over thetheme set

β

G

K

For any k ∈ K ,

pK (k) =∑

g∈〈k〉β

p(g)

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 69: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Projection Operator

I Let β : G → K be a partitioningI A projection operator Ξβ ‘projects’ a distribution pG over G

‘through’ β to create a distribution pK = Ξβ(pG ) over thetheme set

Ξβ

β

G

K

For any k ∈ K ,

pK (k) =∑

g∈〈k〉β

p(g)

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 70: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Projection Operator

I Let β : G → K be a partitioningI A projection operator Ξβ ‘projects’ a distribution pG over G

‘through’ β to create a distribution pK = Ξβ(pG ) over thetheme set

Ξβ

β

G

K

For any k ∈ K ,

pK (k) =∑

g∈〈k〉β

p(g)

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 71: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Semi-Concordance, Concordance, Global Concordance

I β : G → K some partitioning (i.e. surjective function)W : ΛG → ΛG some operatorU ⊆ ΛG some subset of populations

I Say that W is semi-concordant with β on U if

UW //

Ξβ

��

ΛG

Ξβ

��ΛK

Q// ΛK

I If W(U) ⊆ U then W concordant with β on U

I If U = ΛG then W globally concordant with β on U

I Global concordance ⇔ compatibility (Vose 1999)

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 72: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Semi-Concordance, Concordance, Global Concordance

I β : G → K some partitioning (i.e. surjective function)W : ΛG → ΛG some operatorU ⊆ ΛG some subset of populations

I Say that W is semi-concordant with β on U if

UW //

Ξβ

��

ΛG

Ξβ

��ΛK

Q// ΛK

I If W(U) ⊆ U then W concordant with β on U

I If U = ΛG then W globally concordant with β on U

I Global concordance ⇔ compatibility (Vose 1999)

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 73: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Semi-Concordance, Concordance, Global Concordance

I β : G → K some partitioning (i.e. surjective function)W : ΛG → ΛG some operatorU ⊆ ΛG some subset of populations

I Say that W is semi-concordant with β on U if

UW //

Ξβ

��

ΛG

Ξβ

��ΛK

Q// ΛK

I If W(U) ⊆ U then W concordant with β on U

I If U = ΛG then W globally concordant with β on U

I Global concordance ⇔ compatibility (Vose 1999)

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 74: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Semi-Concordance, Concordance, Global Concordance

I β : G → K some partitioning (i.e. surjective function)W : ΛG → ΛG some operatorU ⊆ ΛG some subset of populations

I Say that W is semi-concordant with β on U if

UW //

Ξβ

��

ΛG

Ξβ

��ΛK

Q// ΛK

I If W(U) ⊆ U then W concordant with β on U

I If U = ΛG then W globally concordant with β on U

I Global concordance ⇔ compatibility (Vose 1999)

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 75: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Semi-Concordance, Concordance, Global Concordance

I β : G → K some partitioning (i.e. surjective function)W : ΛG → ΛG some operatorU ⊆ ΛG some subset of populations

I Say that W is semi-concordant with β on U if

UW //

Ξβ

��

ΛG

Ξβ

��ΛK

Q// ΛK

I If W(U) ⊆ U then W concordant with β on U

I If U = ΛG then W globally concordant with β on U

I Global concordance ⇔ compatibility (Vose 1999)

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 76: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Semi-Concordance, Concordance, Global Concordance

I β : G → K some partitioning (i.e. surjective function)W : ΛG → ΛG some operatorU ⊆ ΛG some subset of populations

I Say that W is semi-concordant with β on U if

UW //

Ξβ

��

ΛG

Ξβ

��ΛK

Q// ΛK

I If W(U) ⊆ U then W concordant with β on U

I If U = ΛG then W globally concordant with β on U

I Global concordance ⇔ compatibility (Vose 1999)

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 77: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Semi-Concordance, Concordance, Global Concordance

I β : G → K some partitioning (i.e. surjective function)W : ΛG → ΛG some operatorU ⊆ ΛG some subset of populations

I Say that W is semi-concordant with β on U if

UW //

Ξβ

��

ΛG

Ξβ

��ΛK

Q// ΛK

I If W(U) ⊆ U then W concordant with β on U

I If U = ΛG then W globally concordant with β on U

I Global concordance ⇔ compatibility (Vose 1999)

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 78: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Semi-Concordance, Concordance, Global Concordance

I β : G → K some partitioning (i.e. surjective function)W : ΛG → ΛG some operatorU ⊆ ΛG some subset of populations

I Say that W is semi-concordant with β on U if

UW //

Ξβ

��

ΛG

Ξβ

��ΛK

Q// ΛK

I If W(U) ⊆ U then W concordant with β on U

I If U = ΛG then W globally concordant with β on U

I Global concordance ⇔ compatibility (Vose 1999)

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 79: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Concordance

I Suppose W concordant with β on U , i.e.

UW //

Ξβ

��

U

Ξβ

��ΛK

Q// ΛK

I For initial population pG ∈ U, let pK = Ξβ(pG )

I Can observe the “shadow” of the dynamics induced by W bystudying the effect of the repeated application of Q to pK

I If the size of K is small then such a study becomescomputationally feasible

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 80: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Concordance

I Suppose W concordant with β on U , i.e.

UW //

Ξβ

��

U

Ξβ

��ΛK

Q// ΛK

I For initial population pG ∈ U, let pK = Ξβ(pG )

I Can observe the “shadow” of the dynamics induced by W bystudying the effect of the repeated application of Q to pK

I If the size of K is small then such a study becomescomputationally feasible

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 81: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Concordance

I Suppose W concordant with β on U , i.e.

UW //

Ξβ

��

U

Ξβ

��ΛK

Q// ΛK

I For initial population pG ∈ U, let pK = Ξβ(pG )

I Can observe the “shadow” of the dynamics induced by W bystudying the effect of the repeated application of Q to pK

I If the size of K is small then such a study becomescomputationally feasible

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 82: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Concordance

I Suppose W concordant with β on U , i.e.

UW //

Ξβ

��

U

Ξβ

��ΛK

Q// ΛK

I For initial population pG ∈ U, let pK = Ξβ(pG )

I Can observe the “shadow” of the dynamics induced by W bystudying the effect of the repeated application of Q to pK

I If the size of K is small then such a study becomescomputationally feasible

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 83: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Concordance

I Suppose W concordant with β on U , i.e.

UW //

Ξβ

��

U

Ξβ

��ΛK

Q// ΛK

I For initial population pG ∈ U, let pK = Ξβ(pG )

I Can observe the “shadow” of the dynamics induced by W bystudying the effect of the repeated application of Q to pK

I If the size of K is small then such a study becomescomputationally feasible

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 84: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theoretical Modus Operandi

I Let G = VT ◦ Sf

I I give sufficient conditions on T and f under which aconcordance result can be proved for G

I One of these conditions is called Ambivalence.I It is defined with respect to the transmission function T and a

partitioning

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 85: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theoretical Modus Operandi

I Let G = VT ◦ Sf

I I give sufficient conditions on T and f under which aconcordance result can be proved for G

I One of these conditions is called Ambivalence.I It is defined with respect to the transmission function T and a

partitioning

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 86: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theoretical Modus Operandi

I Let G = VT ◦ Sf

I I give sufficient conditions on T and f under which aconcordance result can be proved for G

I One of these conditions is called Ambivalence.I It is defined with respect to the transmission function T and a

partitioning

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 87: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theoretical Modus Operandi

I Let G = VT ◦ Sf

I I give sufficient conditions on T and f under which aconcordance result can be proved for G

I One of these conditions is called Ambivalence.I It is defined with respect to the transmission function T and a

partitioning

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 88: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Ambivalence (By Example)

An Ambivalent 2-parent transmission function T

��������

��������

��������

��������

��������

��������

KG

β

Say that T is ambivalent under βKeki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 89: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Ambivalence (By Example)

An Ambivalent 2-parent transmission function T

��������

��������

��������

��������

��

��

��������

��������

KG

β

Say that T is ambivalent under βKeki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 90: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Ambivalence (By Example)

An Ambivalent 2-parent transmission function T

��������

��������

��������

��������

��

��

��������

��������

KG

β

Say that T is ambivalent under βKeki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 91: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Ambivalence (By Example)

An Ambivalent 2-parent transmission function T

��������

��������

��������

��������

��

��

��������

��������

KG

bc

a

β

Say that T is ambivalent under βKeki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 92: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Ambivalence (By Example)

An Ambivalent 2-parent transmission function T

��������

��������

��������

��������

��

��

��

��

��������

��������

KG

bc

a

β

Say that T is ambivalent under βKeki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 93: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Ambivalence (By Example)

An Ambivalent 2-parent transmission function T

��������

��������

��������

��������

��

��

��

��

��������

��������

KG

bc

a

β

Say that T is ambivalent under βKeki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 94: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Ambivalence (By Example)

An Ambivalent 2-parent transmission function T

��������

��������

��������

��������

��

��

��

��

��������

��������

bG

bc

a

β

K

a

c

Say that T is ambivalent under βKeki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 95: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Ambivalence (By Example)

An Ambivalent 2-parent transmission function T

��������

��������

��������

��������

��

��

��

��

��������

��������

bG

bc

G

a

β

β

K

a

c

Say that T is ambivalent under βKeki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 96: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Ambivalence (By Example)

An Ambivalent 2-parent transmission function T

��������

��������

��������

��������

��

��

��

��

����

��������

��������

bG

bc

G

a

β

β

K

a

c

Say that T is ambivalent under βKeki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 97: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Ambivalence (By Example)

An Ambivalent 2-parent transmission function T

��������

��������

��������

��������

��

��

��

��

����

��������

��������

x

G

bc

G

a

β

K

z

a

c

b

Say that T is ambivalent under βKeki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 98: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Ambivalence (By Example)

An Ambivalent 2-parent transmission function T

��������

��������

��������

��������

��

��

��

��

��

����

��

��������

��������

x

G

bc

G

a

β

K

z

a

c

b

Say that T is ambivalent under βKeki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 99: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Ambivalence (By Example)

An Ambivalent 2-parent transmission function T

��������

��������

��������

��������

��

��

��

��

��

����

��

��������

��������

x

G

bc

G

a

β

K

z

a

c

b

Say that T is ambivalent under βKeki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 100: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Ambivalence (By Example)

An Ambivalent 2-parent transmission function T

��������

��������

��������

��������

��

��

��

��

��

����

��

��������

��������

x

G

bc

G

a

y

yz

β

β

K

z

a

c

b

x

Say that T is ambivalent under βKeki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 101: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Ambivalence (By Example)

An Ambivalent 2-parent transmission function T

��������

��������

��������

��������

��

��

��

��

��

����

��

��������

��������

x

G

bc

G

a

y

yz

β

β

K

β

G

z

a

c

b

x

Say that T is ambivalent under βKeki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 102: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Ambivalence (By Example)

An Ambivalent 2-parent transmission function T

��������

��������

��������

��������

��

��

��

��

��

����

��

��

��

��������

��������

x

G

bc

G

a

y

yz

β

β

K

β

G

z

a

c

b

x

Say that T is ambivalent under βKeki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 103: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Ambivalence (By Example)

An Ambivalent 2-parent transmission function T

��������

��������

��������

��������

��

��

��

��

��

����

��

��

��

��������

��������

x

G

bc

G

a

y

yz

β

β

K

β

G

z

a

c

b

x

Say that T is ambivalent under βKeki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 104: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Ambivalence (By Example)

An Ambivalent 2-parent transmission function T

��������

��������

��������

��������

��

��

��

��

��

����

��

��

��

��������

��������

s

G

bc

G

a

y

yz

β

β

K

t

β

G

z

a

c

b

x

x

r

Say that T is ambivalent under βKeki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 105: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Ambivalence (By Example)

An Ambivalent 2-parent transmission function T

��������

��������

��������

��������

��

��

��

��

��

����

��

��

��

��

��

��������

��������

s

G

bc

G

a

y

yz

β

β

K

t

β

G

z

a

c

b

x

x

r

Say that T is ambivalent under βKeki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 106: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Ambivalence (By Example)

An Ambivalent 2-parent transmission function T

��������

��������

��������

��������

��

��

��

��

��

����

��

��

��

��

��

��������

��������

s

G

bc

G

a

y

yz

β

β

K

t

β

G

z

a

c

b

x

x

r

Say that T is ambivalent under βKeki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 107: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Ambivalence (By Example)

An Ambivalent 2-parent transmission function T

� �� �� �� �

� �� �� �� �

� �� �� �� �

� �� �� �� �

��

��

����

��

��

��

��

��

� �� �� �� �

� �� �� �� �

s

G

bc

G

a

y

yz

β

β

K

t

t

β

G

z

a

c

b

x

xr

r

s

Say that T is ambivalent under βKeki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 108: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Ambivalence (By Example)

An Ambivalent 2-parent transmission function T

� �� �� �� �

� �� �� �� �

� �� �� �� �

� �� �� �� �

��

��

����

��

��

��

��

��

� �� �� �� �

� �� �� �� �

s

G

bc

G

a

y

yz

β

β

K

t

t

β

G

z

a

c

b

x

xr

r

s

Say that T is ambivalent under βKeki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 109: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Projection of an Ambivalent Transmission function

I Can define a new transmission function over the theme setI denoted T

−→β

I Call this the theme transmission function

� �� �� �� �

� �� �� �� �

� �� �� �� �

� �� �� �� �

��

��

����

��

��

��

��

��

� �� �� �� �

� �� �� �� �

s

G

bc

G

a

y

yz

β

β

K

t

t

β

G

z

a

c

b

x

xr

r

s

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 110: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Projection of an Ambivalent Transmission function

I Can define a new transmission function over the theme setI denoted T

−→β

I Call this the theme transmission function

��������

��������

��������

��������

��

��

��

��

��

����

��

��

��

��

��

��������

��������

s

G

bc

G

a

y

yz

β

β

K

t

t

β

G

z

a

c

b

x

xr

r

s

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 111: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Projection of an Ambivalent Transmission function

I Can define a new transmission function over the theme setI denoted T

−→β

I Call this the theme transmission function

��������

��������

��������

��������

��

��

��

��

��

����

��

��

��

��

��

��������

��������

b

G

bc

G

a

y

yz

β

β

K

t

t

β

G

z

a

c

b

x

xr

r

s

s

ac

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 112: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Projection of an Ambivalent Transmission function

I Can define a new transmission function over the theme setI denoted T

−→β

I Call this the theme transmission function

��������

��������

��������

��������

��

��

��

��

��

����

��

��

��

��

��

��������

��������

s

G

bc

G

a

y

yz

β

β

K

t

t

β

G

z

a

c

b

x

xr

r

s

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 113: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Projection of an Ambivalent Transmission function

I Can define a new transmission function over the theme setI denoted T

−→β

I Call this the theme transmission function

��������

��������

��������

��������

��

��

��

��

��

����

��

��

��

��

��

��������

��������

x

G

bc

G

a

y

yz

β

β

K

t

t

β

G

z

a

c

b

x

xr

r

s

s

zy

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 114: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Projection of an Ambivalent Transmission function

I Can define a new transmission function over the theme setI denoted T

−→β

I Call this the theme transmission function

��������

��������

��������

��������

��

��

��

��

��

����

��

��

��

��

��

��������

��������

s

G

bc

G

a

y

yz

β

β

K

t

t

β

G

z

a

c

b

x

xr

r

s

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 115: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Projection of an Ambivalent Transmission function

I Can define a new transmission function over the theme setI denoted T

−→β

I Call this the theme transmission function

��������

��������

��������

��������

��

��

��

��

��

����

��

��

��

��

��

��������

��������

t

G

bc

G

a

y

yz

β

β

K

t

t

β

G

z

a

c

b

x

xr

r

s

s

r

s

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 116: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theorem: Global Concordance of Variation

I G ,K countable sets

I β : G → K some partitioning over GI T a transmission function over G

I such that T is ambivalent under β

then, VT is globally concordant with β

ΛGVT //

Ξβ

��

ΛG

Ξβ

��ΛK

VT−→β

// ΛK

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 117: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theorem: Global Concordance of Variation

I G ,K countable sets

I β : G → K some partitioning over GI T a transmission function over G

I such that T is ambivalent under β

then, VT is globally concordant with β

ΛGVT //

Ξβ

��

ΛG

Ξβ

��ΛK

VT−→β

// ΛK

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 118: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theorem: Global Concordance of Variation

I G ,K countable sets

I β : G → K some partitioning over GI T a transmission function over G

I such that T is ambivalent under β

then, VT is globally concordant with β

ΛGVT //

Ξβ

��

ΛG

Ξβ

��ΛK

VT−→β

// ΛK

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 119: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theorem: Global Concordance of Variation

I G ,K countable sets

I β : G → K some partitioning over GI T a transmission function over G

I such that T is ambivalent under β

then, VT is globally concordant with β

ΛGVT //

Ξβ

��

ΛG

Ξβ

��ΛK

VT−→β

// ΛK

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 120: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theorem: Global Concordance of Variation

I G ,K countable sets

I β : G → K some partitioning over GI T a transmission function over G

I such that T is ambivalent under β

then, VT is globally concordant with β

ΛGVT //

Ξβ

��

ΛG

Ξβ

��ΛK

VT−→β

// ΛK

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 121: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theme Conditional Operator (By Example)

p

G

I Useful property: Ef ◦ Cβ(p, k3) is the weighted average fitnessof genomes in 〈k3〉β

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 122: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theme Conditional Operator (By Example)

G k2 k3 k4 k5

β

K

p

k1

I Useful property: Ef ◦ Cβ(p, k3) is the weighted average fitnessof genomes in 〈k3〉β

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 123: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theme Conditional Operator (By Example)

〈k3〉βk2 k3 k4 k5

β

K

p

G

〈k5〉β〈k4〉β〈k2〉β〈k1〉βk1

I Useful property: Ef ◦ Cβ(p, k3) is the weighted average fitnessof genomes in 〈k3〉β

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 124: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theme Conditional Operator (By Example)

G

k2 k3 k4 k5

β

K

Cβ(p, k3)

p

G

〈k5〉β〈k4〉β〈k2〉β〈k1〉β 〈k3〉β

〈k3〉β

k1

I Useful property: Ef ◦ Cβ(p, k3) is the weighted average fitnessof genomes in 〈k3〉β

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 125: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theme Conditional Operator (By Example)

G

k2 k3 k4 k5

β

K

Cβ(p, k3)

p

G

〈k5〉β〈k4〉β〈k2〉β〈k1〉β 〈k3〉β

〈k3〉β

k1

I Useful property: Ef ◦ Cβ(p, k3) is the weighted average fitnessof genomes in 〈k3〉β

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 126: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Bounded Thematic Mean Divergence (By Example)

I G a finite Set

I β : G → K a partitioning

I f ∗ : K → R+ some function

I δ ≥ 0

I f : G → R+

I U ⊆ ΛG G

Thematic mean Divergence of f w.r.t f ∗ on U under β is boundedby δ if for any p ∈ U and any k ∈ K ,

|Ef ◦ Cβ(p, k)− f ∗(k)| ≤ δ

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 127: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Bounded Thematic Mean Divergence (By Example)

I G a finite Set

I β : G → K a partitioning

I f ∗ : K → R+ some function

I δ ≥ 0

I f : G → R+

I U ⊆ ΛG G

〈k5〉β〈k4〉β〈k3〉β〈k2〉β〈k1〉β

Thematic mean Divergence of f w.r.t f ∗ on U under β is boundedby δ if for any p ∈ U and any k ∈ K ,

|Ef ◦ Cβ(p, k)− f ∗(k)| ≤ δ

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 128: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Bounded Thematic Mean Divergence (By Example)

I G a finite Set

I β : G → K a partitioning

I f ∗ : K → R+ some function

I δ ≥ 0

I f : G → R+

I U ⊆ ΛG

R+

〈k5〉β〈k4〉β〈k3〉β〈k2〉β〈k1〉β

*

*

*

*

*

G

Thematic mean Divergence of f w.r.t f ∗ on U under β is boundedby δ if for any p ∈ U and any k ∈ K ,

|Ef ◦ Cβ(p, k)− f ∗(k)| ≤ δ

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 129: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Bounded Thematic Mean Divergence (By Example)

I G a finite Set

I β : G → K a partitioning

I f ∗ : K → R+ some function

I δ ≥ 0

I f : G → R+

I U ⊆ ΛG

R+

〈k5〉β〈k4〉β〈k3〉β〈k2〉β〈k1〉β

*

*

*

*

*

δ

G

Thematic mean Divergence of f w.r.t f ∗ on U under β is boundedby δ if for any p ∈ U and any k ∈ K ,

|Ef ◦ Cβ(p, k)− f ∗(k)| ≤ δ

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 130: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Bounded Thematic Mean Divergence (By Example)

I G a finite Set

I β : G → K a partitioning

I f ∗ : K → R+ some function

I δ ≥ 0

I f : G → R+

I U ⊆ ΛG

R+

〈k5〉β〈k4〉β〈k3〉β〈k2〉β〈k1〉β

*

*

*

*

*

δ

G

Thematic mean Divergence of f w.r.t f ∗ on U under β is boundedby δ if for any p ∈ U and any k ∈ K ,

|Ef ◦ Cβ(p, k)− f ∗(k)| ≤ δ

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 131: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Bounded Thematic Mean Divergence (By Example)

I G a finite Set

I β : G → K a partitioning

I f ∗ : K → R+ some function

I δ ≥ 0

I f : G → R+

I U ⊆ ΛG

p ∈ U

〈k5〉β〈k4〉β〈k3〉β〈k2〉β〈k1〉β

*

*

*

*

*

δ

G

R+

Thematic mean Divergence of f w.r.t f ∗ on U under β is boundedby δ if for any p ∈ U and any k ∈ K ,

|Ef ◦ Cβ(p, k)− f ∗(k)| ≤ δ

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 132: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Bounded Thematic Mean Divergence (By Example)

I G a finite Set

I β : G → K a partitioning

I f ∗ : K → R+ some function

I δ ≥ 0

I f : G → R+

I U ⊆ ΛG

Ef ◦ Cβ(p, k2)

〈k5〉β〈k4〉β〈k3〉β〈k2〉β〈k1〉β

+

*

*

+

*+

+

*

*

+

δ

G

R+

p ∈ U

Thematic mean Divergence of f w.r.t f ∗ on U under β is boundedby δ if for any p ∈ U and any k ∈ K ,

|Ef ◦ Cβ(p, k)− f ∗(k)| ≤ δ

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 133: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Bounded Thematic Mean Divergence (By Example)

I G a finite Set

I β : G → K a partitioning

I f ∗ : K → R+ some function

I δ ≥ 0

I f : G → R+

I U ⊆ ΛG

Ef ◦ Cβ(p, k2)

〈k5〉β〈k4〉β〈k3〉β〈k2〉β〈k1〉β

+

*

*

+

*+

+

*

*

+

δ

G

R+

p ∈ U

Thematic mean Divergence of f w.r.t f ∗ on U under β is boundedby δ if for any p ∈ U and any k ∈ K ,

|Ef ◦ Cβ(p, k)− f ∗(k)| ≤ δ

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 134: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Bounded Thematic Mean Divergence (By Example)

I G a finite Set

I β : G → K a partitioning

I f ∗ : K → R+ some function

I δ ≥ 0

I f : G → R+

I U ⊆ ΛG

Ef ◦ Cβ(p, k2)

〈k5〉β〈k4〉β〈k3〉β〈k2〉β〈k1〉β

+

*

*

+

*+

+

*

*

+

δ

G

R+

p ∈ U

Thematic mean Divergence of f w.r.t f ∗ on U under β is boundedby δ if for any p ∈ U and any k ∈ K ,

|Ef ◦ Cβ(p, k)− f ∗(k)| ≤ δ

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 135: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theorem: Limitwise Semi-Concordance of Selection

I G ,K finite sets

I f : G → R+

I f ∗ : K → R+

I U ⊆ ΛG (such that Ξβ(U) = ΛK )

I δ ≥ 0

I Thematic mean divergence of f w.r.t. f ∗ on U under β isbounded by δ

USf //

Ξβ

��limδ→0

ΛG

Ξβ

��ΛK

Sf ∗// ΛK

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 136: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theorem: Limitwise Semi-Concordance of Selection

I G ,K finite sets

I f : G → R+

I f ∗ : K → R+

I U ⊆ ΛG (such that Ξβ(U) = ΛK )

I δ ≥ 0

I Thematic mean divergence of f w.r.t. f ∗ on U under β isbounded by δ

USf //

Ξβ

��limδ→0

ΛG

Ξβ

��ΛK

Sf ∗// ΛK

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 137: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theorem: Limitwise Semi-Concordance of Selection

I G ,K finite sets

I f : G → R+

I f ∗ : K → R+

I U ⊆ ΛG (such that Ξβ(U) = ΛK )

I δ ≥ 0

I Thematic mean divergence of f w.r.t. f ∗ on U under β isbounded by δ

USf //

Ξβ

��limδ→0

ΛG

Ξβ

��ΛK

Sf ∗// ΛK

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 138: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theorem: Limitwise Semi-Concordance of Selection

I G ,K finite sets

I f : G → R+

I f ∗ : K → R+

I U ⊆ ΛG (such that Ξβ(U) = ΛK )

I δ ≥ 0

I Thematic mean divergence of f w.r.t. f ∗ on U under β isbounded by δ

USf //

Ξβ

��limδ→0

ΛG

Ξβ

��ΛK

Sf ∗// ΛK

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 139: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theorem: Limitwise Semi-Concordance of Selection

I G ,K finite sets

I f : G → R+

I f ∗ : K → R+

I U ⊆ ΛG (such that Ξβ(U) = ΛK )

I δ ≥ 0

I Thematic mean divergence of f w.r.t. f ∗ on U under β isbounded by δ

USf //

Ξβ

��limδ→0

ΛG

Ξβ

��ΛK

Sf ∗// ΛK

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 140: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theorem: Limitwise Semi-Concordance of Selection

I G ,K finite sets

I f : G → R+

I f ∗ : K → R+

I U ⊆ ΛG (such that Ξβ(U) = ΛK )

I δ ≥ 0

I Thematic mean divergence of f w.r.t. f ∗ on U under β isbounded by δ

USf //

Ξβ

��limδ→0

ΛG

Ξβ

��ΛK

Sf ∗// ΛK

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 141: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theorem: Limitwise Semi-Concordance of Selection

I G ,K finite sets

I f : G → R+

I f ∗ : K → R+

I U ⊆ ΛG (such that Ξβ(U) = ΛK )

I δ ≥ 0

I Thematic mean divergence of f w.r.t. f ∗ on U under β isbounded by δ

USf //

Ξβ

��limδ→0

ΛG

Ξβ

��ΛK

Sf ∗// ΛK

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 142: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theorem: Limitwise Semi-Concordance of Selection

I G ,K finite sets

I f : G → R+

I f ∗ : K → R+

I U ⊆ ΛG (such that Ξβ(U) = ΛK )

I δ ≥ 0

I Thematic mean divergence of f w.r.t. f ∗ on U under β isbounded by δ

USf //

Ξβ

��limδ→0

ΛG

Ξβ

��ΛK

Sf ∗// ΛK

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 143: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Formalization of an IPEA and its Dynamics

I An Evolution Machine is a 3-tuple (G ,T , f ) where,I G a setI T a transmission function over GI f : G → R+

I Evolution Epoch OperatorI E = (G ,T , f ) an evolution machineI GE : ΛG → ΛG such that

GE = VT ◦ Sf

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 144: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Formalization of an IPEA and its Dynamics

I An Evolution Machine is a 3-tuple (G ,T , f ) where,I G a setI T a transmission function over GI f : G → R+

I Evolution Epoch OperatorI E = (G ,T , f ) an evolution machineI GE : ΛG → ΛG such that

GE = VT ◦ Sf

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 145: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Formalization of an IPEA and its Dynamics

I An Evolution Machine is a 3-tuple (G ,T , f ) where,I G a setI T a transmission function over GI f : G → R+

I Evolution Epoch OperatorI E = (G ,T , f ) an evolution machineI GE : ΛG → ΛG such that

GE = VT ◦ Sf

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 146: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Formalization of an IPEA and its Dynamics

I An Evolution Machine is a 3-tuple (G ,T , f ) where,I G a setI T a transmission function over GI f : G → R+

I Evolution Epoch OperatorI E = (G ,T , f ) an evolution machineI GE : ΛG → ΛG such that

GE = VT ◦ Sf

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 147: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Non-Departure

I E = (G ,T , f ) an evolution machine

I U ⊆ ΛG

I E is non-departing over U if

GE (U) ⊆ U

i.e.VT ◦ Sf (U) ⊆ U

I Note: Sf (U) 6⊆ U is acceptable as long as VT ◦ Sf (U) ⊆ U

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 148: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Non-Departure

I E = (G ,T , f ) an evolution machine

I U ⊆ ΛG

I E is non-departing over U if

GE (U) ⊆ U

i.e.VT ◦ Sf (U) ⊆ U

I Note: Sf (U) 6⊆ U is acceptable as long as VT ◦ Sf (U) ⊆ U

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 149: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Non-Departure

I E = (G ,T , f ) an evolution machine

I U ⊆ ΛG

I E is non-departing over U if

GE (U) ⊆ U

i.e.VT ◦ Sf (U) ⊆ U

I Note: Sf (U) 6⊆ U is acceptable as long as VT ◦ Sf (U) ⊆ U

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 150: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Non-Departure

I E = (G ,T , f ) an evolution machine

I U ⊆ ΛG

I E is non-departing over U if

GE (U) ⊆ U

i.e.VT ◦ Sf (U) ⊆ U

I Note: Sf (U) 6⊆ U is acceptable as long as VT ◦ Sf (U) ⊆ U

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 151: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Non-Departure

I E = (G ,T , f ) an evolution machine

I U ⊆ ΛG

I E is non-departing over U if

GE (U) ⊆ U

i.e.VT ◦ Sf (U) ⊆ U

I Note: Sf (U) 6⊆ U is acceptable as long as VT ◦ Sf (U) ⊆ U

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 152: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theorem: Limitwise Concordance of Evolution

I E = (G ,T , f ) an Evolution MachineI β : G → K a partitioning of GI U ⊆ ΛG (such that Ξβ(U) = ΛK )I f ∗ : K → R+

I δ ≥ 0

Suppose the following statements are true

1. The thematic mean divergence of f w.r.t. f ∗ on U under β isbounded by δ

2. T is ambivalent under β3. E is non-departing over U

Let E ∗ = (K ,T−→β , f ∗), then for any t ∈ Z+,

UGt

E //

Ξβ

��limδ→0

U

Ξβ

��ΛK

GtE∗

// ΛK

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 153: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theorem: Limitwise Concordance of Evolution

I E = (G ,T , f ) an Evolution MachineI β : G → K a partitioning of GI U ⊆ ΛG (such that Ξβ(U) = ΛK )I f ∗ : K → R+

I δ ≥ 0

Suppose the following statements are true

1. The thematic mean divergence of f w.r.t. f ∗ on U under β isbounded by δ

2. T is ambivalent under β3. E is non-departing over U

Let E ∗ = (K ,T−→β , f ∗), then for any t ∈ Z+,

UGt

E //

Ξβ

��limδ→0

U

Ξβ

��ΛK

GtE∗

// ΛK

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 154: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theorem: Limitwise Concordance of Evolution

I E = (G ,T , f ) an Evolution MachineI β : G → K a partitioning of GI U ⊆ ΛG (such that Ξβ(U) = ΛK )I f ∗ : K → R+

I δ ≥ 0

Suppose the following statements are true

1. The thematic mean divergence of f w.r.t. f ∗ on U under β isbounded by δ

2. T is ambivalent under β3. E is non-departing over U

Let E ∗ = (K ,T−→β , f ∗), then for any t ∈ Z+,

UGt

E //

Ξβ

��limδ→0

U

Ξβ

��ΛK

GtE∗

// ΛK

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 155: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theorem: Limitwise Concordance of Evolution

I E = (G ,T , f ) an Evolution MachineI β : G → K a partitioning of GI U ⊆ ΛG (such that Ξβ(U) = ΛK )I f ∗ : K → R+

I δ ≥ 0

Suppose the following statements are true

1. The thematic mean divergence of f w.r.t. f ∗ on U under β isbounded by δ

2. T is ambivalent under β3. E is non-departing over U

Let E ∗ = (K ,T−→β , f ∗), then for any t ∈ Z+,

UGt

E //

Ξβ

��limδ→0

U

Ξβ

��ΛK

GtE∗

// ΛK

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 156: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theorem: Limitwise Concordance of Evolution

I E = (G ,T , f ) an Evolution MachineI β : G → K a partitioning of GI U ⊆ ΛG (such that Ξβ(U) = ΛK )I f ∗ : K → R+

I δ ≥ 0

Suppose the following statements are true

1. The thematic mean divergence of f w.r.t. f ∗ on U under β isbounded by δ

2. T is ambivalent under β3. E is non-departing over U

Let E ∗ = (K ,T−→β , f ∗), then for any t ∈ Z+,

UGt

E //

Ξβ

��limδ→0

U

Ξβ

��ΛK

GtE∗

// ΛK

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 157: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theorem: Limitwise Concordance of Evolution

I E = (G ,T , f ) an Evolution MachineI β : G → K a partitioning of GI U ⊆ ΛG (such that Ξβ(U) = ΛK )I f ∗ : K → R+

I δ ≥ 0

Suppose the following statements are true

1. The thematic mean divergence of f w.r.t. f ∗ on U under β isbounded by δ

2. T is ambivalent under β3. E is non-departing over U

Let E ∗ = (K ,T−→β , f ∗), then for any t ∈ Z+,

UGt

E //

Ξβ

��limδ→0

U

Ξβ

��ΛK

GtE∗

// ΛK

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 158: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theorem: Limitwise Concordance of Evolution

I E = (G ,T , f ) an Evolution MachineI β : G → K a partitioning of GI U ⊆ ΛG (such that Ξβ(U) = ΛK )I f ∗ : K → R+

I δ ≥ 0

Suppose the following statements are true

1. The thematic mean divergence of f w.r.t. f ∗ on U under β isbounded by δ

2. T is ambivalent under β3. E is non-departing over U

Let E ∗ = (K ,T−→β , f ∗), then for any t ∈ Z+,

UGt

E //

Ξβ

��limδ→0

U

Ξβ

��ΛK

GtE∗

// ΛK

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 159: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theorem: Limitwise Concordance of Evolution

I E = (G ,T , f ) an Evolution MachineI β : G → K a partitioning of GI U ⊆ ΛG (such that Ξβ(U) = ΛK )I f ∗ : K → R+

I δ ≥ 0

Suppose the following statements are true

1. The thematic mean divergence of f w.r.t. f ∗ on U under β isbounded by δ

2. T is ambivalent under β3. E is non-departing over U

Let E ∗ = (K ,T−→β , f ∗), then for any t ∈ Z+,

UGt

E //

Ξβ

��limδ→0

U

Ξβ

��ΛK

GtE∗

// ΛK

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 160: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theorem: Limitwise Concordance of Evolution

I E = (G ,T , f ) an Evolution MachineI β : G → K a partitioning of GI U ⊆ ΛG (such that Ξβ(U) = ΛK )I f ∗ : K → R+

I δ ≥ 0

Suppose the following statements are true

1. The thematic mean divergence of f w.r.t. f ∗ on U under β isbounded by δ

2. T is ambivalent under β3. E is non-departing over U

Let E ∗ = (K ,T−→β , f ∗), then for any t ∈ Z+,

UGt

E //

Ξβ

��limδ→0

U

Ξβ

��ΛK

GtE∗

// ΛK

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 161: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theorem: Limitwise Concordance of Evolution

I E = (G ,T , f ) an Evolution MachineI β : G → K a partitioning of GI U ⊆ ΛG (such that Ξβ(U) = ΛK )I f ∗ : K → R+

I δ ≥ 0

Suppose the following statements are true

1. The thematic mean divergence of f w.r.t. f ∗ on U under β isbounded by δ

2. T is ambivalent under β3. E is non-departing over U

Let E ∗ = (K ,T−→β , f ∗), then for any t ∈ Z+,

UGt

E //

Ξβ

��limδ→0

U

Ξβ

��ΛK

GtE∗

// ΛK

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 162: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Theorem: Limitwise Concordance of Evolution

I E = (G ,T , f ) an Evolution MachineI β : G → K a partitioning of GI U ⊆ ΛG (such that Ξβ(U) = ΛK )I f ∗ : K → R+

I δ ≥ 0

Suppose the following statements are true

1. The thematic mean divergence of f w.r.t. f ∗ on U under β isbounded by δ

2. T is ambivalent under β3. E is non-departing over U

Let E ∗ = (K ,T−→β , f ∗), then for any t ∈ Z+,

UGt

E //

Ξβ

��limδ→0

U

Ξβ

��ΛK

GtE∗

// ΛK

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 163: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Some Observations

UGt

E //

Ξβ

��limδ→0

U

Ξβ

��ΛK

GtE∗

// ΛK

I Limitwise concordance of evolution theorem is very generalI The result is applicable to any IPEA, provided that 3 abstract

conditions are satisfied

1. Bounded thematic mean divergence2. Ambivalence3. Non-departure

I The fidelity of the coarse-graining depends on the bound δ onthe thematic mean divergence

I Fidelity increases as δ → 0

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 164: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Some Observations

UGt

E //

Ξβ

��limδ→0

U

Ξβ

��ΛK

GtE∗

// ΛK

I Limitwise concordance of evolution theorem is very generalI The result is applicable to any IPEA, provided that 3 abstract

conditions are satisfied

1. Bounded thematic mean divergence2. Ambivalence3. Non-departure

I The fidelity of the coarse-graining depends on the bound δ onthe thematic mean divergence

I Fidelity increases as δ → 0

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 165: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Some Observations

UGt

E //

Ξβ

��limδ→0

U

Ξβ

��ΛK

GtE∗

// ΛK

I Limitwise concordance of evolution theorem is very generalI The result is applicable to any IPEA, provided that 3 abstract

conditions are satisfied

1. Bounded thematic mean divergence2. Ambivalence3. Non-departure

I The fidelity of the coarse-graining depends on the bound δ onthe thematic mean divergence

I Fidelity increases as δ → 0

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 166: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Some Observations

UGt

E //

Ξβ

��limδ→0

U

Ξβ

��ΛK

GtE∗

// ΛK

I Limitwise concordance of evolution theorem is very generalI The result is applicable to any IPEA, provided that 3 abstract

conditions are satisfied

1. Bounded thematic mean divergence2. Ambivalence3. Non-departure

I The fidelity of the coarse-graining depends on the bound δ onthe thematic mean divergence

I Fidelity increases as δ → 0

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 167: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Some Observations

UGt

E //

Ξβ

��limδ→0

U

Ξβ

��ΛK

GtE∗

// ΛK

I Limitwise concordance of evolution theorem is very generalI The result is applicable to any IPEA, provided that 3 abstract

conditions are satisfied

1. Bounded thematic mean divergence2. Ambivalence3. Non-departure

I The fidelity of the coarse-graining depends on the bound δ onthe thematic mean divergence

I Fidelity increases as δ → 0

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 168: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Some Observations

UGt

E //

Ξβ

��limδ→0

U

Ξβ

��ΛK

GtE∗

// ΛK

I Limitwise concordance of evolution theorem is very generalI The result is applicable to any IPEA, provided that 3 abstract

conditions are satisfied

1. Bounded thematic mean divergence2. Ambivalence3. Non-departure

I The fidelity of the coarse-graining depends on the bound δ onthe thematic mean divergence

I Fidelity increases as δ → 0

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 169: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Some Observations

UGt

E //

Ξβ

��limδ→0

U

Ξβ

��ΛK

GtE∗

// ΛK

I Limitwise concordance of evolution theorem is very generalI The result is applicable to any IPEA, provided that 3 abstract

conditions are satisfied

1. Bounded thematic mean divergence2. Ambivalence3. Non-departure

I The fidelity of the coarse-graining depends on the bound δ onthe thematic mean divergence

I Fidelity increases as δ → 0

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 170: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Some Observations

UGt

E //

Ξβ

��limδ→0

U

Ξβ

��ΛK

GtE∗

// ΛK

I Limitwise concordance of evolution theorem is very generalI The result is applicable to any IPEA, provided that 3 abstract

conditions are satisfied

1. Bounded thematic mean divergence2. Ambivalence3. Non-departure

I The fidelity of the coarse-graining depends on the bound δ onthe thematic mean divergence

I Fidelity increases as δ → 0

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 171: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Implications for Coarse-Graining an IPGA

I Given an IPGA withI long genomesI uniform cross-over

I And some relatively coarse schema partitioningI The IPGA will satisfy the 3 abstract conditions if it satisfies

the following 2 concrete conditions:

1. The initial population is approximately schematically uniform2. The fitness function is low-variance schematically distributed

I For long enough genomes and a coarse enough schemapartitioning, with high probability, δ ≈ 0

I Therefore the fidelity of the coarse-graining is likely to be highfor at least a small number of generations

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 172: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Implications for Coarse-Graining an IPGA

I Given an IPGA withI long genomesI uniform cross-over

I And some relatively coarse schema partitioningI The IPGA will satisfy the 3 abstract conditions if it satisfies

the following 2 concrete conditions:

1. The initial population is approximately schematically uniform2. The fitness function is low-variance schematically distributed

I For long enough genomes and a coarse enough schemapartitioning, with high probability, δ ≈ 0

I Therefore the fidelity of the coarse-graining is likely to be highfor at least a small number of generations

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 173: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Implications for Coarse-Graining an IPGA

I Given an IPGA withI long genomesI uniform cross-over

I And some relatively coarse schema partitioningI The IPGA will satisfy the 3 abstract conditions if it satisfies

the following 2 concrete conditions:

1. The initial population is approximately schematically uniform2. The fitness function is low-variance schematically distributed

I For long enough genomes and a coarse enough schemapartitioning, with high probability, δ ≈ 0

I Therefore the fidelity of the coarse-graining is likely to be highfor at least a small number of generations

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 174: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Implications for Coarse-Graining an IPGA

I Given an IPGA withI long genomesI uniform cross-over

I And some relatively coarse schema partitioningI The IPGA will satisfy the 3 abstract conditions if it satisfies

the following 2 concrete conditions:

1. The initial population is approximately schematically uniform2. The fitness function is low-variance schematically distributed

I For long enough genomes and a coarse enough schemapartitioning, with high probability, δ ≈ 0

I Therefore the fidelity of the coarse-graining is likely to be highfor at least a small number of generations

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 175: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Implications for Coarse-Graining an IPGA

I Given an IPGA withI long genomesI uniform cross-over

I And some relatively coarse schema partitioningI The IPGA will satisfy the 3 abstract conditions if it satisfies

the following 2 concrete conditions:

1. The initial population is approximately schematically uniform2. The fitness function is low-variance schematically distributed

I For long enough genomes and a coarse enough schemapartitioning, with high probability, δ ≈ 0

I Therefore the fidelity of the coarse-graining is likely to be highfor at least a small number of generations

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 176: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Implications for Coarse-Graining an IPGA

I Given an IPGA withI long genomesI uniform cross-over

I And some relatively coarse schema partitioningI The IPGA will satisfy the 3 abstract conditions if it satisfies

the following 2 concrete conditions:

1. The initial population is approximately schematically uniform2. The fitness function is low-variance schematically distributed

I For long enough genomes and a coarse enough schemapartitioning, with high probability, δ ≈ 0

I Therefore the fidelity of the coarse-graining is likely to be highfor at least a small number of generations

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 177: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Implications for Coarse-Graining an IPGA

I Given an IPGA withI long genomesI uniform cross-over

I And some relatively coarse schema partitioningI The IPGA will satisfy the 3 abstract conditions if it satisfies

the following 2 concrete conditions:

1. The initial population is approximately schematically uniform2. The fitness function is low-variance schematically distributed

I For long enough genomes and a coarse enough schemapartitioning, with high probability, δ ≈ 0

I Therefore the fidelity of the coarse-graining is likely to be highfor at least a small number of generations

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 178: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Implications for Coarse-Graining an IPGA

I Given an IPGA withI long genomesI uniform cross-over

I And some relatively coarse schema partitioningI The IPGA will satisfy the 3 abstract conditions if it satisfies

the following 2 concrete conditions:

1. The initial population is approximately schematically uniform2. The fitness function is low-variance schematically distributed

I For long enough genomes and a coarse enough schemapartitioning, with high probability, δ ≈ 0

I Therefore the fidelity of the coarse-graining is likely to be highfor at least a small number of generations

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 179: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Approximate Schematic Uniformity (By Example)

G

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 180: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Approximate Schematic Uniformity (By Example)

Schema partition = ∗# ∗ ∗# ∗ ∗ . . . ∗

G

∗0 ∗∗0 ∗

∗ . . .∗

∗0 ∗∗1 ∗

∗ . . .∗

∗1 ∗∗0 ∗

∗ . . .∗

∗1 ∗∗1 ∗

∗ . . .∗

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 181: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Approximate Schematic Uniformity (By Example)

Schema partition = ∗# ∗ ∗# ∗ ∗ . . . ∗

G

∗0 ∗∗0 ∗

∗ . . .∗

∗0 ∗∗1 ∗

∗ . . .∗

∗1 ∗∗0 ∗

∗ . . .∗

∗1 ∗∗1 ∗

∗ . . .∗

Dis

trib

uti

on

Mass

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 182: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Low-Variance Schematic Fitness Distribution

I Given some schema partitioningI Suppose that for each schema,

I there exists a low-variance distribution over R+, such thatI all the fitness values of the genomes of the schema are

independently drawn from this distribution

I Then fitness is said to be low-variance schematicallydistributed

I This condition is much weaker than the very strong conditionof schematic fitness invariance (Wright et al. 2003)

I i.e. all the genomes in each schema must have the same value

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 183: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Low-Variance Schematic Fitness Distribution

I Given some schema partitioningI Suppose that for each schema,

I there exists a low-variance distribution over R+, such thatI all the fitness values of the genomes of the schema are

independently drawn from this distribution

I Then fitness is said to be low-variance schematicallydistributed

I This condition is much weaker than the very strong conditionof schematic fitness invariance (Wright et al. 2003)

I i.e. all the genomes in each schema must have the same value

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 184: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Low-Variance Schematic Fitness Distribution

I Given some schema partitioningI Suppose that for each schema,

I there exists a low-variance distribution over R+, such thatI all the fitness values of the genomes of the schema are

independently drawn from this distribution

I Then fitness is said to be low-variance schematicallydistributed

I This condition is much weaker than the very strong conditionof schematic fitness invariance (Wright et al. 2003)

I i.e. all the genomes in each schema must have the same value

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 185: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Low-Variance Schematic Fitness Distribution

I Given some schema partitioningI Suppose that for each schema,

I there exists a low-variance distribution over R+, such thatI all the fitness values of the genomes of the schema are

independently drawn from this distribution

I Then fitness is said to be low-variance schematicallydistributed

I This condition is much weaker than the very strong conditionof schematic fitness invariance (Wright et al. 2003)

I i.e. all the genomes in each schema must have the same value

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 186: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Low-Variance Schematic Fitness Distribution

I Given some schema partitioningI Suppose that for each schema,

I there exists a low-variance distribution over R+, such thatI all the fitness values of the genomes of the schema are

independently drawn from this distribution

I Then fitness is said to be low-variance schematicallydistributed

I This condition is much weaker than the very strong conditionof schematic fitness invariance (Wright et al. 2003)

I i.e. all the genomes in each schema must have the same value

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 187: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Low-Variance Schematic Fitness Distribution

I Given some schema partitioningI Suppose that for each schema,

I there exists a low-variance distribution over R+, such thatI all the fitness values of the genomes of the schema are

independently drawn from this distribution

I Then fitness is said to be low-variance schematicallydistributed

I This condition is much weaker than the very strong conditionof schematic fitness invariance (Wright et al. 2003)

I i.e. all the genomes in each schema must have the same value

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 188: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Low-Variance Schematic Fitness Distribution

I Given some schema partitioningI Suppose that for each schema,

I there exists a low-variance distribution over R+, such thatI all the fitness values of the genomes of the schema are

independently drawn from this distribution

I Then fitness is said to be low-variance schematicallydistributed

I This condition is much weaker than the very strong conditionof schematic fitness invariance (Wright et al. 2003)

I i.e. all the genomes in each schema must have the same value

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 189: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Low-Variance Schematic Fitness Distribution

I Given some schema partitioningI Suppose that for each schema,

I there exists a low-variance distribution over R+, such thatI all the fitness values of the genomes of the schema are

independently drawn from this distribution

I Then fitness is said to be low-variance schematicallydistributed

I This condition is much weaker than the very strong conditionof schematic fitness invariance (Wright et al. 2003)

I i.e. all the genomes in each schema must have the same value

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 190: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Validation of Results

I An ideal validation of these results involvesI Constructing an IPGA with large genomesI Choosing a schema partition such that the IPGA satisfies 2

concrete conditions w.r.t the schema partitioningI Simulating the IPGA and projecting its dynamics onto the

schema partitionI Seeing if the coarse-grained dynamics of the IPGA

approximates the projected dynamics

I Unfortunately numerical simulation of such an IPGA with iscomputationally exorbitant (because of large genome size)

I Fortunately the dynamics of the IPGA can be approximated bythe dynamics of a GA with a large but finite population

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 191: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Validation of Results

I An ideal validation of these results involvesI Constructing an IPGA with large genomesI Choosing a schema partition such that the IPGA satisfies 2

concrete conditions w.r.t the schema partitioningI Simulating the IPGA and projecting its dynamics onto the

schema partitionI Seeing if the coarse-grained dynamics of the IPGA

approximates the projected dynamics

I Unfortunately numerical simulation of such an IPGA with iscomputationally exorbitant (because of large genome size)

I Fortunately the dynamics of the IPGA can be approximated bythe dynamics of a GA with a large but finite population

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 192: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Validation of Results

I An ideal validation of these results involvesI Constructing an IPGA with large genomesI Choosing a schema partition such that the IPGA satisfies 2

concrete conditions w.r.t the schema partitioningI Simulating the IPGA and projecting its dynamics onto the

schema partitionI Seeing if the coarse-grained dynamics of the IPGA

approximates the projected dynamics

I Unfortunately numerical simulation of such an IPGA with iscomputationally exorbitant (because of large genome size)

I Fortunately the dynamics of the IPGA can be approximated bythe dynamics of a GA with a large but finite population

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 193: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Validation of Results

I An ideal validation of these results involvesI Constructing an IPGA with large genomesI Choosing a schema partition such that the IPGA satisfies 2

concrete conditions w.r.t the schema partitioningI Simulating the IPGA and projecting its dynamics onto the

schema partitionI Seeing if the coarse-grained dynamics of the IPGA

approximates the projected dynamics

I Unfortunately numerical simulation of such an IPGA with iscomputationally exorbitant (because of large genome size)

I Fortunately the dynamics of the IPGA can be approximated bythe dynamics of a GA with a large but finite population

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 194: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Validation of Results

I An ideal validation of these results involvesI Constructing an IPGA with large genomesI Choosing a schema partition such that the IPGA satisfies 2

concrete conditions w.r.t the schema partitioningI Simulating the IPGA and projecting its dynamics onto the

schema partitionI Seeing if the coarse-grained dynamics of the IPGA

approximates the projected dynamics

I Unfortunately numerical simulation of such an IPGA with iscomputationally exorbitant (because of large genome size)

I Fortunately the dynamics of the IPGA can be approximated bythe dynamics of a GA with a large but finite population

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 195: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Validation of Results

I An ideal validation of these results involvesI Constructing an IPGA with large genomesI Choosing a schema partition such that the IPGA satisfies 2

concrete conditions w.r.t the schema partitioningI Simulating the IPGA and projecting its dynamics onto the

schema partitionI Seeing if the coarse-grained dynamics of the IPGA

approximates the projected dynamics

I Unfortunately numerical simulation of such an IPGA with iscomputationally exorbitant (because of large genome size)

I Fortunately the dynamics of the IPGA can be approximated bythe dynamics of a GA with a large but finite population

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 196: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Validation of Results

I An ideal validation of these results involvesI Constructing an IPGA with large genomesI Choosing a schema partition such that the IPGA satisfies 2

concrete conditions w.r.t the schema partitioningI Simulating the IPGA and projecting its dynamics onto the

schema partitionI Seeing if the coarse-grained dynamics of the IPGA

approximates the projected dynamics

I Unfortunately numerical simulation of such an IPGA with iscomputationally exorbitant (because of large genome size)

I Fortunately the dynamics of the IPGA can be approximated bythe dynamics of a GA with a large but finite population

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 197: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Validation of Results

I Consider an IPGA which satisfies the two concrete conditionsw.r.t. to a schema partitioning of order 2

0 5 10 15 20 25 30 35 400

0.1

0.2

0.3

0.4

0.5

0.6

0.7

0.8

0.9

1

Generations

Fre

quen

cySchema Frequencies over time for a Schema Partition of Order 2

I Projected dynamics of a finite population GA (pop. size 5000)which approximates the IPGA

I Coarse-grained dynamics of the IPGA

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 198: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Validation of Results

I Consider an IPGA which satisfies the two concrete conditionsw.r.t. to a schema partitioning of order 2

0 5 10 15 20 25 30 35 400

0.1

0.2

0.3

0.4

0.5

0.6

0.7

0.8

0.9

1

Generations

Fre

quen

cySchema Frequencies over time for a Schema Partition of Order 2

I Projected dynamics of a finite population GA (pop. size 5000)which approximates the IPGA

I Coarse-grained dynamics of the IPGA

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 199: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Validation of Results

I Consider an IPGA which satisfies the two concrete conditionsw.r.t. to a schema partitioning of order 3

0 5 10 15 20 25 30 35 400

0.1

0.2

0.3

0.4

0.5

0.6

0.7

0.8

0.9

1

Generations

Fre

quen

cySchema Frequencies over time for a Schema Partition of Order 3

I Projected dynamics of a finite population GA (pop. size 5000)which approximates the IPGA

I Coarse-grained dynamics of the IPGA

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 200: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Validation of Results

I Consider an IPGA which satisfies the two concrete conditionsw.r.t. to a schema partitioning of order 3

0 5 10 15 20 25 30 35 400

0.1

0.2

0.3

0.4

0.5

0.6

0.7

0.8

0.9

1

Generations

Fre

quen

cySchema Frequencies over time for a Schema Partition of Order 3

I Projected dynamics of a finite population GA (pop. size 5000)which approximates the IPGA

I Coarse-grained dynamics of the IPGA

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 201: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Conclusion

I Previous coarse-graining result for selecto-recombinativeIPGAs only obtainable by placing a very strong constraint onthe fitness function (Wright et al. 2003)

I I have shown that the dynamics of a selecto-recombinativeIPGA can be coarse-grained under a much weaker constrainton the fitness function

I Weakness of this constraint entails that this coarse-grainingresult is more likely to be of use in a theory of GA adaptation

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 202: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Conclusion

I Previous coarse-graining result for selecto-recombinativeIPGAs only obtainable by placing a very strong constraint onthe fitness function (Wright et al. 2003)

I I have shown that the dynamics of a selecto-recombinativeIPGA can be coarse-grained under a much weaker constrainton the fitness function

I Weakness of this constraint entails that this coarse-grainingresult is more likely to be of use in a theory of GA adaptation

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 203: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Conclusion

I Previous coarse-graining result for selecto-recombinativeIPGAs only obtainable by placing a very strong constraint onthe fitness function (Wright et al. 2003)

I I have shown that the dynamics of a selecto-recombinativeIPGA can be coarse-grained under a much weaker constrainton the fitness function

I Weakness of this constraint entails that this coarse-grainingresult is more likely to be of use in a theory of GA adaptation

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics

Page 204: Sufficient Conditions for Coarsegraining Evolutionary Dynamics

Introduction Abstract Framework Coarse-Graining Results Application to GAs Experimental Validation Conclusion

Conclusion

I Previous coarse-graining result for selecto-recombinativeIPGAs only obtainable by placing a very strong constraint onthe fitness function (Wright et al. 2003)

I I have shown that the dynamics of a selecto-recombinativeIPGA can be coarse-grained under a much weaker constrainton the fitness function

I Weakness of this constraint entails that this coarse-grainingresult is more likely to be of use in a theory of GA adaptation

Keki Burjorjee Suff. Conditions for Coarse-Graining Evolutionary Dynamics