Introducing Echo Networks for Computational Neuroevolution
Not on the map. Why?
Abstract (arXiv)
For applications on the extreme edge, minimal networks of only a few dozen artificial neurons for event detection and classification in discrete time signals would be highly desirable. Feed-forward networks, RNNs, and CNNs evolved through evolutionary algorithms can all be successful in this respect but pose the problem of allowing little systematicity in mutation and recombination if the standard direct genetic encoding of the weights is used (as for instance in the classic NEAT algorithm). We therefore introduce Echo Networks, a type of recurrent network that consists of the connection matrix only, with the source neurons of the synapses represented as rows, destination neurons as columns and weights as entries. There are no layers, and connections between neurons can be bidirectional but are technically all recurrent. Input and output can be arbitrarily assigned to any of the neurons and only use an additional (optional) function in their computational path, e.g., a sigmoid to obtain a binary classification output. We evaluated Echo Networks successfully on the classification of electrocardiography signals but see the most promising potential in their genome representation as a single matrix, allowing matrix computations and factorisations as mutation and recombination operators.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 20 references that are in the map. First posted on arXiv 9 Apr 2026.
Builds on
6 of 20 references.
References · 6
- 2020Hopfield Networks is All You Needcited by 475
- 2014The Loss Surfaces of Multilayer Networkscited by 280
- 2022The Forward-Forward Algorithm: Some Preliminary Investigationscited by 266
- 2016Dense Associative Memory for Pattern Recognitioncited by 236
- 2022Gradients without Backpropagationcited by 73
- 2020Correspondence between neuroevolution and gradient descentcited by 11
Built on by
Not cited yet.