Happy-Algorithms-League / hal-cgp

Cartesian genetic programming (CGP) in pure Python.
GNU General Public License v3.0
28 stars 10 forks source link

Local search randomly over a set of values #373

Open HenrikMettler opened 1 year ago

HenrikMettler commented 1 year ago

Currently our library offers two ways of searching values for parameterised nodes: Evolution Strategies and Gradient based. Both search values "locally" around the current values. In some use cases one might not want to search locally, but, e.g. over values of different magnitude. One possible way to do this is by randomly sampling possible values for each parameter and updating parameters when fitness increases. Such a search should be added to the local search implementations.