Wei Li

Prof. Dr. Wei Li

orcid

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

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

Representative Publications

View All Publications
1 June 2004 in Journal of Grid Computing
Verified
Journal Article
Closed access
PDF file
Zhiwei XuZhiwei Xu
Zhiwei Xu
WLWei Li
Wei Li
LZLi Zha
Li Zha
HYHaiyan Yu
Haiyan Yu
DLDonghua Liu
Donghua Liu

1 September 2020 in Big Data Mining and Analytics
Verified
Journal Article
Closed access
SYShuhui Yang
Shuhui Yang
ZYZimu Yuan
Zimu Yuan
WLWei Li
Wei Li

31 March 2025 in Mathematics
Verified
Journal Article
Open access
PDF file
SSSongze Shi
Songze Shi
FLFan Li
Fan Li
WLWei Li
Wei Li
Stock return prediction is a pivotal yet intricate task in financial markets, challenged by volatility and multifaceted dependencies. This study proposes a hybrid model integrating long short-term memory (LSTM) networks and graph convolutional networks (GCNs) to enhance accuracy by capturing both temporal dynamics and spatial inter-stock relationships. Tested on the Dow Jones Industrial Average (DJIA), Shanghai Stock Exchange 50 (SSE50), and China Securities Index 100 (CSI 100), our LSTM-GCN model outperforms baselines—LSTM, GCN, RNN, GRU, BP, decision tree, and SVM—achieving the lowest mean squared error (e.g., 0.0055 on DJIA), mean absolute error, and highest R2 values. This superior performance stems from the synergistic interaction of spatio-temporal features, offering a robust tool for investors and policymakers. Future enhancements could incorporate sentiment analysis and dynamic graph structures.

15 July 2026 in Scientific Reports
Verified
Journal Article
Open access
YHYixuan Huang
Yixuan Huang
WLWei Li
Wei Li
Reinforcement Learning (RL) offers significant potential for solving complex, sequential decision-making problems in supply chain management, such as dynamic inventory control. However, the adoption of state-of-the-art deep RL methods is severely hampered by their "black box" nature, as the resulting policies are notoriously opaque and difficult to trust in high-stakes industrial environments. To address this critical interpretability-performance gap, we introduce Structured Policy Reinforcement Learning (SPRL), a novel framework that embeds transparency directly into the agent's learning process. SPRL uses a decoupled architecture to distill value estimates from a powerful Q-learning agent into an inherently interpretable Decision Tree (DT). Crucially, the entire process is governed by a hard operational constraint (Inventory Position Cap, [Formula: see text]), which acts as an operational guardrail to stabilize training and enforce lean policies. We demonstrate that the optimized SPRL-DT policy achieves highly efficient combined performance, realizing a mean total cost of [Formula: see text] (a 45% reduction compared to the constrained DQN baseline) while maintaining an excellent service level of over 91%. This performance is achieved with a low complexity structure ([Formula: see text] nodes), offering a highly transparent and verifiable solution. Our results validate that SPRL enables the development of trustworthy autonomous systems, paving the way for the practical deployment of RL in real-world supply chain operations.

29 March 2015 in arXiv
Verified
Preprint
Open access
PDF file
ZYZimu Yuan
Zimu Yuan
WLWei Li
Wei Li
ZXZhiwei Xu
Zhiwei Xu
WZWei Zhao
Wei Zhao
Beacon node placement, node-to-node measurement, and target node positioning are the three key steps for a localization process. However, compared with the other two steps, beacon node placement still lacks a comprehensive, systematic study in research literatures. To fill this gap, we address the Beacon Node Placment (BNP) problem that deploys beacon nodes for minimal localization error in this paper. BNP is difficult in that the localization error is determined by a complicated combination of factors, i.e., the localization error differing greatly under a different environment, with a different algorithm applied, or with a different type of beacon node used. In view of the hardness of BNP, we propose an approximate function to reduce time cost in localization error calculation, and also prove its time complexity and error bound. By approximation, a sub-optimal distribution of beacon nodes could be found within acceptable time cost for placement. In the experiment, we test our method and compare it with other node placement methods under various settings and environments. The experimental results show feasibility and effectiveness of our method in practice.