Low Rank Factorizations are Indirect Encodings for Evolved Neural Networks

Deep neuroevolution is a highly scalable alternative to reinforcement learning due to its unique ability to encode network updates in a small number of bytes. Recent insights from traditional deep learning indicate high-dimensional models possess intrinsic, low-rank structure. In this work, we introduce low-rank, factorized neuroevolution-an indirect encoding through which we can search a small space of low-rank factors that enforce underlying structure across a network's weights. We compare our approach with non-factorized networks of similar and smaller size to understand how much performance can be attributed to the smaller search space. We evaluate our method on a language modeling task using transformers. Our study shows that low-rank, factorized neuroevolution outperforms or is competitive with non-factorized neuroevolution, performing notably well on language modeling. More broadly, these results show how we can use insights from backpropgation-based methods to enhance neuroevolution.

Authors

Institutions

Publication Details

Journal
Proceedings of the Genetic and Evolutionary Computation Conference Companion
Published
2025-07-14
DOI
https://doi.org/10.1145/3712255.3726564
Primary Topic
Neural Networks and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Low Rank Factorizations are Indirect Encodings for Evolved Neural Networks

Jordan Pollack, Jack Garbus
Proceedings of the Genetic and Evolutionary Computation Conference Companion
Neural Networks and Applications
article

Low Rank Factorizations are Indirect Encodings for Evolved Neural Networks

Jordan Pollack, Jack Garbus
article en

Abstract

Deep neuroevolution is a highly scalable alternative to reinforcement learning due to its unique ability to encode network updates in a small number of bytes. Recent insights from traditional deep learning indicate high-dimensional models possess intrinsic, low-rank structure. In this work, we introduce low-rank, factorized neuroevolution-an indirect encoding through which we can search a small space of low-rank factors that enforce underlying structure across a network's weights. We compare our approach with non-factorized networks of similar and smaller size to understand how much performance can be attributed to the smaller search space. We evaluate our method on a language modeling task using transformers. Our study shows that low-rank, factorized neuroevolution outperforms or is competitive with non-factorized neuroevolution, performing notably well on language modeling. More broadly, these results show how we can use insights from backpropgation-based methods to enhance neuroevolution.

Proceedings of the Genetic and Evolutionary Computation Conference Companion
Brandeis University (US)
Openalex Percentile: Top 61%
Neural Networks and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.