{"title":"Pruning for efficient DenseNet via surrogate-model-assisted genetic algorithm considering neural architecture search proxies","authors":"Jingeun Kim , Yourim Yoon","doi":"10.1016/j.swevo.2025.101983","DOIUrl":null,"url":null,"abstract":"<div><div>Recently, convolution neural networks have achieved remarkable progress in computer vision. These neural networks have a large number of parameters, which should be limited in resource-constrained environments. To address this problem, new pruning approaches have explored using neural architecture search (NAS) to determine optimal subnetworks. We propose a novel pruning framework using a surrogate model-assisted genetic algorithm considering NAS proxies (SMA-GA-NP). We applied multi-dimensional encoding and designed crossover and mutation methods. To reduce the search time of NAS, we leveraged a surrogate model to approximate the fitness value of individuals and used NAS proxies, such as reducing the number of epochs and the training set size. The DenseNet-BC (<em>k</em> <span><math><mo>=</mo></math></span> 12) model was used as the baseline. We achieved highly competitive performance on CIFAR-10 compared with other GA-based pruning methods and baselines. For CIFAR-100, we reduced the number of parameters by 11.25% to 18.75%, while achieving less than 1% performance degradation compared to the baseline model. These findings highlight SMA-GA-NP’s effectiveness in significantly reducing the number of parameters while having a negligible impact on the model’s performance. We also conducted an ablation study to explore the efficiency of the GA settings, the surrogate model, and NAS proxies in SMA-GA-NP and identified the current limitations and future potential of SMA-GA-NP.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"97 ","pages":"Article 101983"},"PeriodicalIF":8.2000,"publicationDate":"2025-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650225001415","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Recently, convolution neural networks have achieved remarkable progress in computer vision. These neural networks have a large number of parameters, which should be limited in resource-constrained environments. To address this problem, new pruning approaches have explored using neural architecture search (NAS) to determine optimal subnetworks. We propose a novel pruning framework using a surrogate model-assisted genetic algorithm considering NAS proxies (SMA-GA-NP). We applied multi-dimensional encoding and designed crossover and mutation methods. To reduce the search time of NAS, we leveraged a surrogate model to approximate the fitness value of individuals and used NAS proxies, such as reducing the number of epochs and the training set size. The DenseNet-BC (k 12) model was used as the baseline. We achieved highly competitive performance on CIFAR-10 compared with other GA-based pruning methods and baselines. For CIFAR-100, we reduced the number of parameters by 11.25% to 18.75%, while achieving less than 1% performance degradation compared to the baseline model. These findings highlight SMA-GA-NP’s effectiveness in significantly reducing the number of parameters while having a negligible impact on the model’s performance. We also conducted an ablation study to explore the efficiency of the GA settings, the surrogate model, and NAS proxies in SMA-GA-NP and identified the current limitations and future potential of SMA-GA-NP.
期刊介绍:
Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.