Wei Li

Mrs. Wei Li

orcid

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications
30 December 2025 in Symmetry
Verified
Journal Article
Open access
PDF file
YXYuhang Xie
Yuhang Xie
WLWei Li
Wei Li
BQBin Qin
Bin Qin
SGShang Gao
Shang Gao
This study addresses the limitations of the traditional Plant Growth Algorithm (PGA), including insufficient local exploitation, premature convergence, and performance degradation in high-dimensional optimization. To enhance search efficiency, we propose the ALDPGA (Adam–Lévy Dynamic Plant Growth Algorithm), which incorporates Adam-based adaptive gradient learning, Lévy long-tailed perturbation, and a dynamic stage-control mechanism. The method strengthens directional refinement in the light region using gradient-assisted learning and a simulated-annealing rule, while staged hybrid perturbations and adaptive learning-rate scheduling expand early exploration in the shaded region. During the cell-elongation phase, Lévy-driven dynamic trajectories guide the transition from global search to fine-grained convergence. Notably, the light and shaded regions of the algorithm are designed symmetrically, balancing exploration and exploitation. The light region reflects phototropism, fostering growth towards optimal solutions, while the shaded region adapts to explore previously underexplored areas. Extensive experiments on CEC2017, CEC2020, and CEC2022 benchmarks demonstrate improvements in optimal solutions, convergence speed, and statistical stability. Wilcoxon tests confirm the significance of these gains, and ablation studies verify the contributions of each component. ALDPGA’s enhanced robustness and optimization efficiency make it well suited for complex, multimodal, and high-dimensional problems, offering new insights into bio-inspired optimization frameworks.

9 June 2026 in Entropy
Verified
Journal Article
Open access
PDF file
YXYuhang Xie
Yuhang Xie
WLWei Li
Wei Li
CZCheng Zhong
Cheng Zhong
SGShang Gao
Shang Gao
XKXu Kai
Xu Kai
BQBin Qin
Bin Qin
Given the growing complexity of continuous optimization problems in strongly coupled and black-box environments, this study proposes a novel adaptive gradient-guided metaheuristic, referred to as Self-Adaptive AdamW-Guided Optimization (SAWG). Without requiring explicit gradient information, SAWG constructs population-based pseudo-gradients and systematically integrates key AdamW mechanisms, including adaptive moment estimation, step-size regulation, and weight decay, to guide efficient population updates. Furthermore, a stagnation-aware adaptive control strategy is introduced to alleviate premature convergence and dynamically balance exploration and exploitation. To evaluate the optimization performance of SAWG, experiments were conducted on the CEC2017 and CEC2020 benchmark suites and eight engineering optimization problems. SAWG was also compared with nine other typical and novel high-performance optimizers. Experimental results and statistical analysis show that SAWG achieved excellent optimization performance in most test tasks and maintained strong adaptability and competitiveness in various numerical optimization problems. Therefore, SAWG can be regarded as a high-performance optimizer, providing a novel and effective method for solving complex numerical optimization tasks.

31 July 2026 in Fractal and Fractional
Verified
Journal Article
Open access
PDF file
YXYuhang Xie
Yuhang Xie
WLWei Li
Wei Li
BQBin Qin
Bin Qin
XKXu Kai
Xu Kai
SGShang Gao
Shang Gao
Metaheuristic optimization algorithms are widely used in wrapper-based feature selection, since they can search complex combinatorial spaces without gradient information. The standard sine cosine algorithm (SCA) is simple and easy to implement, but depends on the current population state and a single global optimal guide. This dependence can cause premature convergence and late-stage oscillations in discretized feature-selection tasks. To address these issues, we propose the fractional-order elite-memory sine cosine algorithm (FOSCA). The FOSCA integrates short-memory fractional-order position reconstruction, dynamic elite-center guidance and nonlinear search-factor decay into the SCA search dynamics. These mechanisms improve the trajectory continuity, guidance diversity and convergence stability. Experiments on 14 classification datasets showed that the FOSCA achieved a competitive accuracy, F1-score, precision and recall. The FOSCA also outperformed the original SCA on 12 out of the 14 datasets. Statistical tests, a stability analysis, a performance–sparsity trade-off analysis and ablation studies confirmed the effectiveness of the proposed mechanisms. Overall, the FOSCA improves the SCA search reliability in discrete feature selection and offers a reproducible basis for related optimizer-based methods.