Shulei Liu

Shulei Liu

Auto-generated profile, based on publicly available information

Shulei Liu

School of Artificial Intelligence, Xidian University, Xi’an, China

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 February 2022 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
SLShulei Liu
Shulei Liu
Handing WangHanding Wang
Handing Wang
WPWei Peng
Wei Peng
WYWen Yao
Wen Yao
Various evolutionary algorithms (EAs) have been proposed to address feature selection (FS) problems, in which a large number of fitness evaluations are needed. With the rapid growth of data scales, the fitness evaluation becomes time consuming, which makes FS problems expensive optimization problems. Surrogate-assisted EAs (SAEAs) have been widely used to solve expensive optimization problems. However, the SAEAs still face difficulties in solving expensive FS problems due to their high-dimensional discrete decision variables. To address this issue, we propose an SAEA with parallel random grouping for expensive FS problems, in which three main components consist. First, a constraint-based sampling strategy is proposed, which considers the influence of the constraint boundary and the number of selected features. Second, a high-dimensional FS problem is randomly divided into several low-dimensional subproblems. Surrogate models are then constructed in these low-dimensional decision spaces. After that, all the subproblems are optimized in parallel. The process of random grouping and parallel optimization continues until the termination condition is met. Finally, a final solution is chosen from the best solution in the historical search and the best solution in the last population using a random, distance-, or voting-based method. Experimental results show that the proposed algorithm generally outperforms traditional, ensemble, and evolutionary FS methods on 14 datasets with up to 10 000 features, especially when the required number of real fitness evaluations is limited.

18 May 2024 in Complex & Intelligent Systems
Verified
Journal Article
Open access
PDF file
SLShulei Liu
Shulei Liu
Handing WangHanding Wang
Handing Wang
WPWei Peng
Wei Peng
WYWen Yao
Wen Yao
As potent approaches for addressing computationally expensive optimization problems, surrogate-assisted evolutionary algorithms (SAEAs) have garnered increasing attention. Prevailing endeavors in evolutionary computation predominantly concentrate on expensive continuous optimization problems, with a notable scarcity of investigations directed toward expensive combinatorial optimization problems (ECOPs). Nevertheless, numerous ECOPs persist in practical applications. The widespread prevalence of such problems starkly contrasts the limited development of relevant research. Motivated by this disparity, this paper conducts a comprehensive survey on SAEAs tailored to address ECOPs. This survey comprises two primary segments. The first segment synthesizes prevalent global, local, hybrid, and learning search strategies, elucidating their respective strengths and weaknesses. Subsequently, the second segment furnishes an overview of surrogate-based evaluation technologies, delving into three pivotal facets: model selection, construction, and management. The paper also discusses several potential future directions for SAEAs with a focus towards expensive combinatorial optimization.

9 February 2023 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
SLShulei Liu
Shulei Liu
Handing WangHanding Wang
Handing Wang
WYWen Yao
Wen Yao
WPWei Peng
Wei Peng
Hypervolume-based evolutionary algorithms have been widely used to handle many-objective optimization problems. In such algorithms, hypervolume-based environmental selection (HVES), which aims at selecting a subpopulation with the maximal hypervolume (HV) from the current population, plays a crucial role in guiding evolution. However, the computation time of HV increases exponentially with the number of objectives, making the HVES task an expensive optimization problem. In this paper, we propose an efficient surrogate-assisted greedy inclusion algorithm to deal with computationally expensive HVES tasks. It uses a lightweight surrogate model, radial basis function network, to replace the most time-consuming calculations. In addition, an L1-norm distance-based filter is performed as a preselection operator to reduce the search space and avoid some unnecessary calculations. Considering the inevitable approximation errors of surrogate models, we also design an online sampling strategy to enhance the reliability of selected solutions. The proposed algorithm is tested on two types of datasets and compared with six state-of-the-art greedy algorithms. Experimental results show that the proposed algorithm performs excellently on most datasets.

25 October 2023 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
SLShulei Liu
Shulei Liu
WYWen Yao
Wen Yao
Handing WangHanding Wang
Handing Wang
WPWei Peng
Wei Peng
YYYang Yang
Yang Yang
The automatic design of soft robots characterizes as jointly optimizing structure and control. As reinforcement learning is gradually used to optimize control, the time-consuming controller training makes soft robots design an expensive optimization problem. Although surrogate-assisted evolutionary algorithms have made a remarkable achievement in dealing with expensive optimization problems, they typically suffer from challenges in constructing accurate surrogate models due to the complex mapping among structure, control, and task performance. Therefore, we propose an action inheritance-based evolutionary algorithm to accelerate the design process. Instead of training a controller, the proposed algorithm uses inherited actions to control a candidate design to complete a task and obtain its approximated performance. Inherited actions are near-optimal control policies that are partially or entirely inherited from optimized control actions of a real evaluated robot design. The action inheritance plays the role of surrogate models where its input is the structure and output is the near-optimal control actions. We also propose a random perturbation operation to estimate the error introduced by inherited control actions. The effectiveness of our proposed method is validated by evaluating it on a wide range of tasks, including locomotion and manipulation. Experimental results show that our algorithm is better than the other three state-of-the-art algorithms on most tasks when only a limited computational budget is available. Compared with the algorithm without surrogate models, our algorithm saves about half the computing cost.


13 May 2025 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
SLShulei Liu
Shulei Liu
Junchi YanJunchi Yan
Junchi Yan
Handing WangHanding Wang
Handing Wang
YJYaochu Jin
Yaochu Jin
Automatic design of intelligent robots plays a central role and has been a trending topic in embodied intelligence. A promising approach is the co-design framework, wherein evolutionary algorithms (EAs) are employed to optimize the robot’s morphology while reinforcement learning algorithms are utilized to refine its control strategies. However, the discrete morphology design space introduces significant challenges for EAs, to efficiently identify optimal morphologies. In this work, we propose a novel morphology optimization method driven by a classifier-guided diffusion model to enhance the search efficiency of EAs. Prior to the design process, a universal diffusion model is trained using a set of randomly sampled feasible morphologies, prompting that the generated structures satisfy physical constraints. In each iteration of the EA for morphology optimization, a classifier is trained using previously evaluated morphologies and is then used to condition the diffusion model to generate quality solutions. Subsequently, the generated morphology is further refined based on the voxel distribution to incorporate features from the current high-quality morphology. Extensive experiments on a large-scale benchmark for co-designing the morphology and control of voxel-based soft robots demonstrate that our method significantly improves search efficiency in the morphological design space, outperforming both traditional EAs and surrogate-assisted EAs.