This reminds me a lot of the work on compressed neural network from Jan Koutnik and his colleagues. They don't evolve topology of a NN, but they learn weights of a neural network in some compressed space. That seems to be very similar to weight sharing.
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!