Kai Xu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Kai Xu has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Bin Qin
School of Computer, Jiangsu University of Science and Technology, Zhenjiang 212003, China
2 shared publications - Shang Gao
School of Computer, Jiangsu University of Science and Technology, Zhenjiang, China
2 shared publications - Wei Li
School of Computer, Jiangsu University of Science and Technology, Zhenjiang 212003, China
2 shared publications - Yuhang Xie
School of Computer, Jiangsu University of Science and Technology, Zhenjiang 212003, China
2 shared publications - Cheng Zhong
Department of Power Engineering, PLA Army Engineering University, Nanjing 210007, China
1 shared publication - Diming Zhang
Jiangsu University of Science and Technology
1 shared publication
Latest Publications
- Open Access
- 31 July 2026
- Published by MDPI AG in Fractal and Fractional
- Vol. 10 (8) , 526
Fractional-Order Memory and Elite-Center-Guided Sine–Cosine Optimization for Feature Selection
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.
- 31 July 2026
- Published by MDPI AG in Fractal and Fractional
- Vol. 10 (8) , 526
Open AccessFractional-Order Memory and Elite-Center-Guided Sine–Cosine Optimization for Feature Selection
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.
- Open Access
Self-Adaptive AdamW-Guided Optimization: A Learning-Driven Metaheuristic for Solving Complex Real-World Engineering Problems
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.
Open AccessSelf-Adaptive AdamW-Guided Optimization: A Learning-Driven Metaheuristic for Solving Complex Real-World Engineering Problems
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.
- Open Access
LLM-Conductor: A Closed-Loop Resource-Adaptive Architecture for Secure LLM Deployment in Industrial Sensor Networks and IIoT Systems
To address the bottlenecks of missing decision-making closed loop, insufficient experience reuse, and decoupled resource scheduling in industrial LLM deployment, this paper proposes LLM-Conductor, a three-layer collaborative architecture that enables monitoring-feedback autonomous decision-making, structured policy memory, and joint policy-resource optimization.Through ablation studies, horizontal comparisons with ISOLATEGPT and ReAct, and graded resource-reduction experiments across six tiers, the results demonstrate that the security risk incidence rate is reduced from 70.6 percent to 1.3 percent, the multi-application collaborative task completion rate reaches 100 percent, and token utilization improves to 88.9 percent. Under constraints of at least 512 MB memory and at least 0.5 GHz CPU, the core task completion rate remains above 95 percent. By deeply coupling decision-making with resource scheduling, this architecture provides an integrated pathway toward efficient, secure, and reliable LLM deployment in Industrial Internet of Things scenarios. Current validation focuses on software-layer interaction patterns under simulated resource-constrained environments, with physical-layer industrial integration reserved for future work.
Open AccessLLM-Conductor: A Closed-Loop Resource-Adaptive Architecture for Secure LLM Deployment in Industrial Sensor Networks and IIoT Systems
To address the bottlenecks of missing decision-making closed loop, insufficient experience reuse, and decoupled resource scheduling in industrial LLM deployment, this paper proposes LLM-Conductor, a three-layer collaborative architecture that enables monitoring-feedback autonomous decision-making, structured policy memory, and joint policy-resource optimization.Through ablation studies, horizontal comparisons with ISOLATEGPT and ReAct, and graded resource-reduction experiments across six tiers, the results demonstrate that the security risk incidence rate is reduced from 70.6 percent to 1.3 percent, the multi-application collaborative task completion rate reaches 100 percent, and token utilization improves to 88.9 percent. Under constraints of at least 512 MB memory and at least 0.5 GHz CPU, the core task completion rate remains above 95 percent. By deeply coupling decision-making with resource scheduling, this architecture provides an integrated pathway toward efficient, secure, and reliable LLM deployment in Industrial Internet of Things scenarios. Current validation focuses on software-layer interaction patterns under simulated resource-constrained environments, with physical-layer industrial integration reserved for future work.