NEAIMay 8, 2025

Guiding Evolutionary AutoEncoder Training with Activation-Based Pruning Operators

arXiv:2505.05138v1h-index: 39Has CodeGECCO
Originality Incremental advance
AI Analysis

This work addresses efficiency in autoencoder training for machine learning applications, but it is incremental as it builds on prior evolutionary methods.

The study tackled neural network pruning for autoencoders by introducing activation-based mutation operators in evolutionary computation, finding that guided pruning outperformed random pruning in canonical training but not in coevolutionary settings, with specific schedules identified for each case.

This study explores a novel approach to neural network pruning using evolutionary computation, focusing on simultaneously pruning the encoder and decoder of an autoencoder. We introduce two new mutation operators that use layer activations to guide weight pruning. Our findings reveal that one of these activation-informed operators outperforms random pruning, resulting in more efficient autoencoders with comparable performance to canonically trained models. Prior work has established that autoencoder training is effective and scalable with a spatial coevolutionary algorithm that cooperatively coevolves a population of encoders with a population of decoders, rather than one autoencoder. We evaluate how the same activity-guided mutation operators transfer to this context. We find that random pruning is better than guided pruning, in the coevolutionary setting. This suggests activation-based guidance proves more effective in low-dimensional pruning environments, where constrained sample spaces can lead to deviations from true uniformity in randomization. Conversely, population-driven strategies enhance robustness by expanding the total pruning dimensionality, achieving statistically uniform randomness that better preserves system dynamics. We experiment with pruning according to different schedules and present best combinations of operator and schedule for the canonical and coevolving populations cases.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes