Evolvability (computer science)

General Framework

Let F n and R n be collections of functions on n variables. Given an ideal function f ∈ F n , the goal is to find by local search a representation r ∈ R n that closely approximates f . This closeness is measured by the performance Perf ⁡ ( f , r ) of r with respect to f .

As is the case in the biological world, there is a difference between genotype and phenotype. In general, there can be multiple representations (genotypes) that correspond to the same function (phenotype). That is, for some r , r ′ ∈ R n , with r ≠ r ′ , still r ( x ) = r ′ ( x ) for all x ∈ X n . However, this need not be the case. The goal then, is to find a representation that closely matches the phenotype of the ideal function, and the spirit of the local search is to allow only small changes in the genotype. Let the neighborhood N ( r ) of a representation r be the set of possible mutations of r .

For simplicity, consider Boolean functions on X n = { − 1 , 1 } n , and let D n be a probability distribution on X n . Define the performance in terms of this. Specifically,

Note that Perf ⁡ ( f , r ) = Prob ⁡ ( f ( x ) = r ( x ) ) − Prob ⁡ ( f ( x ) ≠ r ( x ) ) . In general, for non-Boolean functions, the performance will not correspond directly to the probability that the functions agree, although it will have some relationship.

Throughout an organism's life, it will only experience a limited number of environments, so its performance cannot be determined exactly. The empirical performance is defined by Perf s ⁡ ( f , r ) = 1 s ∑ x ∈ S f ( x ) r ( x ) , where S is a multiset of s independent selections from X n according to D n . If s is large enough, evidently Perf s ⁡ ( f , r ) will be close to the actual performance Perf ⁡ ( f , r ) .

Given an ideal function f ∈ F n , initial representation r ∈ R n , sample size s , and tolerance t , the mutator Mut ⁡ ( f , r , s , t ) is a random variable defined as follows. Each r ′ ∈ N ( r ) is classified as beneficial, neutral, or deleterious, depending on its empirical performance. Specifically,

If there are any beneficial mutations, then Mut ⁡ ( f , r , s , t ) is equal to one of these at random. If there are no beneficial mutations, then Mut ⁡ ( f , r , s , t ) is equal to a random neutral mutation. In light of the similarity to biology, r itself is required to be available as a mutation, so there will always be at least one neutral mutation.

The intention of this definition is that at each stage of evolution, all possible mutations of the current genome are tested in the environment. Out of the ones who thrive, or at least survive, one is chosen to be the candidate for the next stage. Given r 0 ∈ R n , we define the sequence r 0 , r 1 , r 2 , … by r i + 1 = Mut ⁡ ( f , r i , s , t ) . Thus r g is a random variable representing what r 0 has evolved to after g generations.

Let F be a class of functions, R be a class of representations, and D a class of distributions on X . We say that F is evolvable by R over D if there exists polynomials p ( ⋅ , ⋅ ) , s ( ⋅ , ⋅ ) , t ( ⋅ , ⋅ ) , and g ( ⋅ , ⋅ ) such that for all n and all ϵ > 0 , for all ideal functions f ∈ F n and representations r 0 ∈ R n , with probability at least 1 − ϵ ,

where the sizes of neighborhoods N ( r ) for r ∈ R n are at most p ( n , 1 / ϵ ) , the sample size is s ( n , 1 / ϵ ) , the tolerance is t ( 1 / n , ϵ ) , and the generation size is g ( n , 1 / ϵ ) .

F is evolvable over D if it is evolvable by some R over D .

F is evolvable if it is evolvable over all distributions D .

Results

The class of conjunctions and the class of disjunctions are evolvable over the uniform distribution for short conjunctions and disjunctions, respectively.

The class of parity functions (which evaluate to the parity of the number of true literals in a given subset of literals) are not evolvable, even for the uniform distribution.

Evolvability implies PAC learnability.