Example demonstrating the use of the caching decorator with functional equivalance checking

Caches the results of fitness evaluations in a pickle file (example_fec_caching_cache.pkl). To illustrate its practical use, compare the runtime of this script when you first call it vs. the second time and when you comment out the decorator on inner_objective.

import functools
import multiprocessing as mp
import time

import numpy as np

import cgp

We define the target function for this example.

def f_target(x):
    return x ** 2 + x + 1.0

We then define the objective function for the evolutionary algorithm: It consists of an inner objective which we wrap with the caching decorator. This decorator specifies a pickle file that will be used for caching results of fitness evaluations. In addition the decorator accepts keyword arguments that specifiy the statistic of the samples used for evaluation. The inner objective is then used by the objective function to compute (or retrieve from cache) the fitness of the individual.

@cgp.utils.disk_cache(
    "example_fec_caching_cache.pkl",
    compute_key=functools.partial(
        cgp.utils.compute_key_from_numpy_evaluation_and_args,
        _seed=12345,
        _min_value=-10.0,
        _max_value=10.0,
        _batch_size=5,
    ),
    file_lock=mp.Lock(),
)
def inner_objective(ind):
    """The caching decorator uses the return values generated from
    providing random inputs to ind.to_numpy() to identify functionally
    indentical individuals and avoid reevaluating them. Note that
    caching only makes sense for deterministic objective functions, as
    it assumes that identical phenotypes will always return the same
    fitness values.

    """

    f = ind.to_numpy()
    x = np.linspace(-2.0, 2.0, 100)
    y = f(x)
    loss = (f_target(x) - y) ** 2

    time.sleep(0.25)  # emulate long fitness evaluation

    return np.mean(loss)


def objective(individual):
    if not individual.fitness_is_None():
        return individual

    individual.fitness = -inner_objective(individual)

    return individual

Finally, we call the evolve method to perform the evolutionary search.

pop = cgp.evolve(objective, max_generations=200, termination_fitness=0.0, print_progress=True)


print(f"evolved function: {pop.champion.to_sympy()}")

Out:

[2/200] max fitness: -4.690424154478845
[3/200] max fitness: -4.690424154478845
[4/200] max fitness: -4.690424154478845
[5/200] max fitness: -4.690424154478845
[6/200] max fitness: -4.690424154478845
[7/200] max fitness: -4.690424154478845
[8/200] max fitness: -4.690424154478845
[9/200] max fitness: -4.690424154478845
[10/200] max fitness: -4.690424154478845
[11/200] max fitness: -4.690424154478845
[12/200] max fitness: -4.690424154478845
[13/200] max fitness: -4.690424154478845
[14/200] max fitness: -4.690424154478845
[15/200] max fitness: -4.690424154478845
[16/200] max fitness: -4.690424154478845
[17/200] max fitness: -4.690424154478845
[18/200] max fitness: -4.690424154478845
[19/200] max fitness: -4.690424154478845
[20/200] max fitness: -4.690424154478845
[21/200] max fitness: -4.690424154478845
[22/200] max fitness: -4.690424154478845
[23/200] max fitness: -2.9698854339401235
[24/200] max fitness: -2.9698854339401235
[25/200] max fitness: -2.9698854339401235
[26/200] max fitness: -2.9698854339401235
[27/200] max fitness: -2.9698854339401235
[28/200] max fitness: -2.9698854339401226
[29/200] max fitness: -1.0
[30/200] max fitness: -1.0
[31/200] max fitness: -1.0
[32/200] max fitness: -1.0
[33/200] max fitness: -1.0
[34/200] max fitness: -1.0
[35/200] max fitness: -1.0
[36/200] max fitness: -1.0
[37/200] max fitness: 0.0
evolved function: 1.0*x_0**2 + 1.0*x_0 + 1.0