Searching Search Spaces: Meta-evolving a Geometric Encoding for Neural Networks
<|reference_start|>Searching Search Spaces: Meta-evolving a Geometric Encoding for Neural Networks: In evolutionary policy search, neural networks are usually represented using a direct mapping: each gene encodes one network weight. Indirect encoding methods, where each gene can encode for multiple weights, shorten the genome to reduce the dimensions of the search space and better exploit permutations and symmetries. The Geometric Encoding for Neural network Evolution (GENE) introduced an indirect encoding where the weight of a connection is computed as the (pseudo-)distance between the two linked neurons, leading to a genome size growing linearly with the number of genes instead of quadratically in direct encoding. However GENE still relies on hand-crafted distance functions with no prior optimization. Here we show that better performing distance functions can be found for GENE using Cartesian Genetic Programming (CGP) in a meta-evolution approach, hence optimizing the encoding to create a search space that is easier to exploit. We show that GENE with a learned function can outperform both direct encoding and the hand-crafted distances, generalizing on unseen problems, and we study how the encoding impacts neural network properties.<|reference_end|>
@article{kunze2024searching,
    title={Searching Search Spaces: Meta-evolving a Geometric Encoding for Neural
  Networks},
    author={Tarek Kunze, Paul Templier, Dennis G Wilson},
    journal={arXiv preprint arXiv:2403.14019},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.14019},
    primaryClass={cs.NE cs.AI}
}