Releases
v0.11.0
Compare
Sorry, something went wrong.
No results found
Added
(python) evolution strategies, islands and checkpoints (#342 )
(gp) tree genetic programming, strongly typed, with subtree crossover and mutation (#343 )
(gp) point, hoist, shrink and constant mutation, bloat control and Boolean problems (#345 )
(nn) neural networks and pole-balancing tasks, with CMA-ES examples (#348 )
(gp) symbolic regression, with linear scaling, and Koza's regression problems (#359 )
(gp) the Nguyen regression problems, their pages, and accuracy against size (#360 )
(gp) normal constants and the inverse, and G4's outcome (#361 )
(neat) add NEAT, networks whose structure evolves with their weights, and XOR by NEAT (#363 )
nine multi-objective engineering design problems, each with its own example (#357 )
(neat) add recurrent evaluation, and NEAT on the pole-balancing tasks (#366 )
fifteen classic test functions, from Beale to Powell, each with its own example (#367 )
(open_es) add OpenAI's evolution strategy, and two spirals by it (#368 )
(python) OpenEs, neural networks and pole-balancing tasks (#385 )
(python) NEAT and its networks (#387 )
(python) genetic programming with built-in primitives (#389 )
(python) genetic programming with your own primitives (#390 )
(examples) the pole-balancing pages animate the cart and its poles (#391 )
Fixed
a checkpoint of a De with fewer than 4 individuals, or of Islands with no island, is an error (#346 )
(cli) a fitness program that writes extra lines or stops answering ends the run with an error (#347 )
lengths above 2^24 are errors for Real and Integer, and CMA-ES restarts stay within 2^24 (#344 )
(python) a parallel run stops on Ctrl+C after the calls under way, not after the generation (#350 )
the problems' genome and objectives pass type checking, and small gaps in the CLI and Python checks (#353 )
(examples) progress plots that end where the progress does (#372 )
(examples) front pages that end where the front stops visibly moving (#384 )
Performance
the NSGA-III association skips the exact distance to reference directions a lower bound rules out (#354 )
permutation operators, SPEA2, NSGA-III and MOEA/D reuse their scratch space instead of allocating it (#355 )
[breaking ] both normals of each polar-method draw, lazy CMA-ES eigendecomposition, and integer powers in the CTP constraints (#356 )
the last front of SMS-EMOA is sorted once, not after every removal (#352 )
Documentation
a plan for genetic programming and neuroevolution (#340 )
(contributing) no AI attribution in commits, PRs, comments or files (#370 )
You can’t perform that action at this time.