Panpan Zhang , Yilan He , Jing Rong , Ye Tian , Yajie Zhang , Shangshang Yang , Xingyi Zhang
{"title":"Reinforcement learning assisted sparse population coevolutionary algorithm for multi-component spectral feature selection","authors":"Panpan Zhang , Yilan He , Jing Rong , Ye Tian , Yajie Zhang , Shangshang Yang , Xingyi Zhang","doi":"10.1016/j.swevo.2026.102292","DOIUrl":null,"url":null,"abstract":"<div><div>As an essential step in spectral quantitative analysis, spectral feature selection identifies the most relevant and significant features from high-dimensional spectral data. This process aims to improve the accuracy of concentration prediction models while also reducing model complexity. However, existing evolutionary algorithms fail to account for the potential cooperation in this problem, which may degrade performance. This paper proposes a sparse population coevolutionary algorithm based on deep reinforcement learning for multi-component spectral feature selection. It introduces auxiliary sparse populations for single-component spectral feature selection and utilizes the Deep Q-learning Network (DQN) to select a population as an evolutionary helper, thereby accelerating the exploration and exploitation of the main sparse population for multi-component spectral feature selection. DQN establishes a mapping from population states to the selection action of an auxiliary population used for coevolution. The best auxiliary evolutionary population is selected based on the current state of the main population at each generation, thus promoting convergence towards the Pareto-optimal fronts. In the experiments, the meat and flue gas datasets are used to evaluate the effectiveness of the proposed algorithm. Experimental results indicate that the proposed algorithm is superior for multi-component spectral feature selection over four state-of-the-art evolutionary algorithms.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"101 ","pages":"Article 102292"},"PeriodicalIF":8.5000,"publicationDate":"2026-02-01","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/S221065022600012X","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/2/9 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
As an essential step in spectral quantitative analysis, spectral feature selection identifies the most relevant and significant features from high-dimensional spectral data. This process aims to improve the accuracy of concentration prediction models while also reducing model complexity. However, existing evolutionary algorithms fail to account for the potential cooperation in this problem, which may degrade performance. This paper proposes a sparse population coevolutionary algorithm based on deep reinforcement learning for multi-component spectral feature selection. It introduces auxiliary sparse populations for single-component spectral feature selection and utilizes the Deep Q-learning Network (DQN) to select a population as an evolutionary helper, thereby accelerating the exploration and exploitation of the main sparse population for multi-component spectral feature selection. DQN establishes a mapping from population states to the selection action of an auxiliary population used for coevolution. The best auxiliary evolutionary population is selected based on the current state of the main population at each generation, thus promoting convergence towards the Pareto-optimal fronts. In the experiments, the meat and flue gas datasets are used to evaluate the effectiveness of the proposed algorithm. Experimental results indicate that the proposed algorithm is superior for multi-component spectral feature selection over four state-of-the-art evolutionary algorithms.
期刊介绍:
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.