Zhaopeng Peng

Zhaopeng Peng

Auto-generated profile, based on publicly available information

Zhaopeng Peng

Fujian Key Laboratory of Sensing and Computing for Smart Cities, School of Informatics, Xiamen University, Xiamen, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
13 June 2023 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
CZChuanpan Zheng
Chuanpan Zheng
XFXiaoliang Fan
Xiaoliang Fan
SPShirui Pan
Shirui Pan
HJHaibing Jin
Haibing Jin
ZPZhaopeng Peng
Zhaopeng Peng
PYPhilip S. Yu
Philip S. Yu
Recent studies have shifted their focus towards formulating traffic forecasting as a spatio-temporal graph modeling problem. Typically, they constructed a static spatial graph at each time step and then connected each node with itself between adjacent time steps to create a spatio-temporal graph. However, this approach failed to explicitly reflect the correlations between different nodes at different time steps, thus limiting the learning capability of graph neural networks. Additionally, those models overlooked the dynamic spatio-temporal correlations among nodes by using the same adjacency matrix across different time steps. To address these limitations, we propose a novel approach called Spatio-Temporal Joint Graph Convolutional Networks (STJGCN) for accurate traffic forecasting on road networks over multiple future time steps. Specifically, our method encompasses the construction of both pre-defined and adaptive spatio-temporal joint graphs (STJGs) between any two time steps, which represent comprehensive and dynamic spatio-temporal correlations. We further introduce dilated causal spatio-temporal joint graph convolution layers on the STJG to capture spatio-temporal dependencies from distinct perspectives with multiple ranges. To aggregate information from different ranges, we propose a multi-range attention mechanism. Finally, we evaluate our approach on five public traffic datasets and experimental results demonstrate that STJGCN is not only computationally efficient but also outperforms 11 state-of-the-art baseline methods.

4 January 2024 in Neurocomputing
Verified
Journal Article
Closed access
ZWZihui Wang
Zihui Wang
ZPZhaopeng Peng
Zhaopeng Peng
XFXiaoliang Fan
Xiaoliang Fan
ZWZheng Wang
Zheng Wang
SWShangbin Wu
Shangbin Wu
CWCheng Wang
Cheng Wang

24 August 2024
Verified
Conference Paper
Open access
ZWZihui Wang
Zihui Wang
ZWZheng Wang
Zheng Wang
LLLingjuan Lyu
Lingjuan Lyu
ZPZhaopeng Peng
Zhaopeng Peng
ZYZhicheng Yang
Zhicheng Yang
XFXiaoliang Fan
Xiaoliang Fan
Collaborative fairness stands as an essential element in federated learning to encourage client participation by equitably distributing rewards based on individual contributions. Existing methods primarily focus on adjusting gradient allocations among clients to achieve collaborative fairness. However, they frequently overlook crucial factors such as maintaining consistency across local models and catering to the diverse requirements of high-contributing clients. This oversight inevitably decreases both fairness and model accuracy in practice. To address these issues, we propose FedSAC, a novel Federated learning framework with dynamic Submodel Allocation for Collaborative fairness, backed by a theoretical convergence guarantee. First, we present the concept of "bounded collaborative fairness (BCF)", which ensures fairness by tailoring rewards to individual clients based on their contributions. Second, to implement the BCF, we design a submodel allocation module with a theoretical guarantee of fairness. This module incentivizes high-contributing clients with high-performance submodels containing a diverse range of crucial neurons, thereby preserving consistency across local models. Third, we further develop a dynamic aggregation module to adaptively aggregate submodels, ensuring the equitable treatment of low-frequency neurons and consequently enhancing overall model accuracy. Extensive experiments conducted on three public benchmarks demonstrate that FedSAC outperforms all baseline methods in both fairness and model accuracy. We see this work as a significant step towards incentivizing broader client participation in federated learning. The source code is available at https://github.com/wangzihuixmu/FedSAC.