So in the article we also reported in the experimental results section, the performance increase when we fit the individual parameters using the network topology found, and compared it to the non-tuned parameters.
Here are some related papers:
- original idea: http://people.idsia.ch/~tino/papers/koutnik.gecco10.pdf
- vision-based TORCS: http://repository.supsi.ch/4548/1/koutnik2013fdg.pdf
- backpropagation with compressed weights: http://www.informatik.uni-bremen.de/~afabisch/files/2013_NN_...
For example, in the case of the cart pole (without swing up) benchmark a simple linear controller with equal positive weights is required which can easily be encoded with this approach.
Thanks for the references. The GECCO paper on compressed network search has been a big influence on previous projects I worked on, see:
https://news.ycombinator.com/item?id=16694153
https://news.ycombinator.com/item?id=14883694
it’s a small community!
I have a couple astrophysics CNN problems for which I am not sure the best architecture and I am now curious to try this out.