Note
Click here to download the full example code
Simplification by pruningΒΆ
Out:
Symc + sin(Symc + x_0**2) (0.009182273966118449, 8.0)
Symc + sin(Symc*(x_0**2 - 2)) (0.003648423477499919, 12.0)
Symc + sin(Symc*(x_0**2 - 2)) (0.003648423477499919, 12.0)
Symc + sin(Symc*(x_0**2 - 2)) (0.003648423477499919, 12.0)
Symc + sin(Symc*(x_0**2 - 2)) (0.003648423477499919, 12.0)
Symc + sin(Symc*(x_0**2 - 2)) (0.003648423477499919, 12.0)
Symc + sin(Symc*(x_0**2 - 2)) (0.003648423477499919, 12.0)
Symc + sin(Symc*(x_0**2 - 2)) (0.003648423477499919, 12.0)
Symc + sin(Symc*(x_0**2 - 2)) (0.003648423477499919, 12.0)
-Symc*cos(x_0) - Symc + cos(Symc*(x_0**2 + 1)) (5.714991547451496e-06, 15.0)
from functools import partial
import numpy as np
import deap.gp
import deap.tools
from glyph import gp
from glyph.assessment import const_opt
from glyph.utils import Memoize
from glyph.utils.numeric import silent_numpy, nrmse
pset = gp.numpy_primitive_set(arity=1, categories=["algebraic", "trigonometric", "exponential", "symc"])
Individual = gp.Individual(pset=pset)
@silent_numpy
def error(ind, *args):
g = lambda x: x ** 2 - 1.1
points = np.linspace(-1, 1, 100, endpoint=True)
y = g(points)
f = gp.individual.numpy_phenotype(ind)
yhat = f(points, *args)
if np.isscalar(yhat):
yhat = np.ones_like(y) * yhat
return nrmse(y, yhat)
@Memoize
def measure(ind):
popt, err_opr = const_opt(error, ind)
ind.popt = popt
return err_opr, len(ind)
def update_fitness(population, map=map):
invalid = [p for p in population if not p.fitness.valid]
fitnesses = map(measure, invalid)
for ind, fit in zip(invalid, fitnesses):
ind.fitness.values = fit
return population
def main():
pop_size = 100
mate = deap.gp.cxOnePoint
expr_mut = partial(deap.gp.genFull, min_=0, max_=2)
mutate = partial(deap.gp.mutUniform, expr=expr_mut, pset=Individual.pset)
simplify = gp.individual.simplify_constant
algorithm = gp.algorithms.AgeFitness(mate, mutate, deap.tools.selNSGA2, Individual.create_population)
pop = update_fitness(Individual.create_population(pop_size))
for gen in range(20):
pop = algorithm.evolve(pop)
pop = [Individual(simplify(ind)) for ind in pop]
pop = update_fitness(pop)
best = deap.tools.selBest(pop, 1)[0]
print(gp.individual.simplify_this(best), best.fitness.values)
if best.fitness.values[0] <= 1e-3:
break
if __name__ == "__main__":
main()
Total running time of the script: ( 1 minutes 2.698 seconds)