Hao Wang

Dr. Hao Wang


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
20 November 2025 in Electronics
Verified
Journal Article
Open access
PDF file
XWXufeng Wu
Xufeng Wu
ZCZuowei Chen
Zuowei Chen
HJHefang Jiang
Hefang Jiang
SLShoukang Luo
Shoukang Luo
YZYi Zhao
Yi Zhao
HWHao Wang
Hao Wang
Despite notable advances in load forecasting and fault detection, current power system operation and maintenance (O&M) technologies remain fragmented into independent and primarily reactive modules. Load forecasting estimates future demand, whereas fault detection identifies whether abnormal conditions exist in the present state. This paper proposes a unified and proactive Cognitive Digital Twin (CDT) system. Unlike traditional data-driven approaches, the CDT integrates Large Language Models (LLMs) and Knowledge Graphs (KGs) as cognitive cores to enable deeper reasoning and context-aware decision-making. The CDT system not only mirrors the physical grid but also acts as an intelligent O&M engine capable of understanding, reasoning, predicting, and self-diagnosing. The core innovation lies in prediction-based anomaly detection. The system first estimates the expected healthy state of the grid at future time steps and then compares real-time monitoring data against these predictions to identify incipient anomalies. This enables genuine foresight rather than simple reactive detection. By orchestrating advanced analytical modules, including CNN–LSTM hybrid models and optimization algorithms, the CDT supports autonomous O&M operations with transparent and explainable decision-making. These capabilities enhance grid resilience and improve the system’s capacity for self-healing.

2 April 2026 in Electronics
Verified
Journal Article
Open access
PDF file
XWXufeng Wu
Xufeng Wu
ZCZuowei Chen
Zuowei Chen
HJHefang Jiang
Hefang Jiang
SLShoukang Luo
Shoukang Luo
YZYi Zhao
Yi Zhao
HWHao Wang
Hao Wang
The authors would like to make the following correction to their published paper

19 November 2025 in arXiv
Verified
Preprint
Open access
PDF file
HKHaidong Kang
Haidong Kang
LLLihong Lin
Lihong Lin
EYEnneng Yang
Enneng Yang
Hong-Ning DaiHong-Ning Dai
Hong-Ning Dai
HWHao Wang
Hao Wang
Large language models (LLMs) have achieved remarkable performance on a wide range of tasks, hindering real-world deployment due to their massive size. Existing pruning methods (e.g., Wanda) tailored for LLMs rely heavily on manual design pruning algorithms, thereby leading to \textit{huge labor costs} and \textit{requires expert knowledge}. Furthermore, we are the first to identify the serious \textit{outlier value issue} behind dramatic performance degradation under high pruning ratios that are caused by uniform sparsity, raising an additional concern about how to design adaptive pruning sparsity ideal for LLMs. Can LLMs prune by themselves? In this work, we introduce an affirmative answer by proposing a novel pruning method called \textbf{AutoPrune}, which first overcomes expert knowledge limits by leveraging LLMs to design optimal pruning algorithms for themselves automatically without any expert knowledge. Specifically, to mitigate the black-box nature of LLMs, we propose a Graph-driven Chain-of-Thought (GCoT) to optimize prompts, significantly enhancing the reasoning process in learning the pruning algorithm and enabling us to generate pruning algorithms with superior performance and interpretability in the next generation. Finally, grounded in insights of outlier value issue, we introduce Skew-aware Dynamic Sparsity Allocation (SDSA) to overcome the outlier value issue, mitigating performance degradation under high pruning ratios. We conduct extensive experiments on mainstream LLMs benchmarks, demonstrating the superiority of AutoPrune, which consistently excels state-of-the-art competitors. The code is available at: https://anonymous.4open.science/r/AutoPrune.

8 October 2026 in CCF Transactions on Pervasive Computing and Interaction
Verified
Journal Article
Closed access
PDF file
SLShihao Liu
Shihao Liu
YLYiming Luo
Yiming Luo
Di WuDi Wu
Di Wu
HWHao Wang
Hao Wang
YPYushan Pan
Yushan Pan