Sparse Mutation Decompositions: Fine Tuning Deep Neural Networks with Subspace Evolution
Not on the map. Why?
Abstract (arXiv)
Neuroevolution is a promising area of research that combines evolutionary algorithms with neural networks. A popular subclass of neuroevolutionary methods, called evolution strategies, relies on dense noise perturbations to mutate networks, which can be sample inefficient and challenging for large models with millions of parameters. We introduce an approach to alleviating this problem by decomposing dense mutations into low-dimensional subspaces. Restricting mutations in this way can significantly reduce variance as networks can handle stronger perturbations while maintaining performance, which enables a more controlled and targeted evolution of deep networks. This approach is uniquely effective for the task of fine tuning pre-trained models, which is an increasingly valuable area of research as networks continue to scale in size and open source models become more widely available. Furthermore, we show how this work naturally connects to ensemble learning where sparse mutations encourage diversity among children such that their combined predictions can reliably improve performance. We conduct the first large scale exploration of neuroevolutionary fine tuning and ensembling on the notoriously difficult ImageNet dataset, where we see small generalization improvements with only a single evolutionary generation using nearly a dozen different deep neural network architectures.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 14 of its 39 references that are in the map. First posted on arXiv 12 Feb 2023.
Builds on
14 of 39 references.
References · 14
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2016Wide Residual Networkscited by 3,070
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
- 2020What is the State of Neural Network Pruning?cited by 583
- 2017Evolution Strategies as a Scalable Alternative to Reinforcement Learningcited by 574
- 2016The CMA Evolution Strategy: A Tutorialcited by 377
- 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 328
- 2022The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Trainingcited by 85
- 2018Evolution-Guided Policy Gradient in Reinforcement Learningcited by 83
- 2020Neuroevolution in Deep Neural Networks: Current Trends and Future Challengescited by 33
Built on by
Not cited yet.