Zhaowei Zhu

Zhaowei Zhu

Auto-generated profile, based on publicly available information

Zhaowei Zhu

BIAI, ZJUT, Hangzhou, China & D5 Data, Hangzhou, China

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
15 July 2019 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
ZZZhaowei Zhu
Zhaowei Zhu
TLTing Liu
Ting Liu
YYYang Yang
Yang Yang
XLXiliang Luo
Xiliang Luo
Task offloading is a promising technology to exploit the available computational resources in spatially distributed fog nodes efficiently in the era of fog computing. In this paper, we look for an online task offloading strategy to minimize the long-term cost, which factors in the latency, the energy consumption, and the switching cost. To this end, we formulate a stochastic programming problem and the expectations of the system parameters are allowed to change abruptly at unknown time instants. Meanwhile, we consider the fact that the queried nodes can only feed back the processing results after finishing the tasks. Then we put forth an effective bandit learning algorithm, i.e. the BLOT, to solve this challenging stochastic programming under the non-stationary bandit model. We also demonstrate that our proposed BLOT algorithm is asymptotically optimal in a non-stationary fog-enabled network. Numerical experiments further verify the superb performance of BLOT.

4 August 2023
Verified
Conference Paper
Open access
JWJiaheng Wei
Jiaheng Wei
ZZZhaowei Zhu
Zhaowei Zhu
TLTianyi Luo
Tianyi Luo
EAEhsan Amid
Ehsan Amid
AKAbhishek Kumar
Abhishek Kumar
YLYang Liu
Yang Liu
The rawly collected training data often comes with separate noisy labels collected from multiple imperfect annotators (e.g., via crowdsourcing). A typical way of using these separate labels is to first aggregate them into one and apply standard training methods. The literature has also studied extensively on effective aggregation approaches. This paper revisits this choice and aims to provide an answer to the question of whether one should aggregate separate noisy labels into single ones or use them separately as given. We theoretically analyze the performance of both approaches under the empirical risk minimization framework for a number of popular loss functions, including the ones designed specifically for the problem of learning with noisy labels. Our theorems conclude that label separation is preferred over label aggregation when the noise rates are high, or the number of labelers/annotations is insufficient. Extensive empirical results validate our conclusions.

27 February 2018 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
ZZZhaowei Zhu
Zhaowei Zhu
SJShengda Jin
Shengda Jin
YYYang Yang
Yang Yang
HHHonglin Hu
Honglin Hu
XLXiliang Luo
Xiliang Luo
Device-to-device (D2D) communication has become one important part of next-generation mobile networks particularly due to the booming of proximity-based services, e.g. the ProSe standardized in LTE. However, D2D communications may create strong interference to nearby users that are sharing the same spectrum. Thus, interference management in a D2D-enabled cooperative network is critical. In this paper, the time reuse problem and its distributed solution in a D2D-enabled cooperative network are investigated. Even though the total number of possible time reuse patterns increases exponentially with the quantity of the users, the authors first show that the optimal network performance can be achieved by only activating a limited number of time reuse patterns. The effects of the incentive mechanism on the reuse pattern selection are also investigated. Meanwhile, the set of active reuse patterns are determined efficiently with the Frank-Wolfe method. For a specific set of active time reuse patterns, the authors further show that the optimal resource allocation problem can be formulated as one consensus-building problem. Based on the alternating-direction method of multipliers, one low-complexity algorithm is proposed to determine the optimal resource allocations in a distributed fashion. Numerical simulations are carried out to corroborate our designs.

1 December 2018
Verified
Conference Paper
Closed access
ZZZhaowei Zhu
Zhaowei Zhu
TLTing Liu
Ting Liu
SJShengda Jin
Shengda Jin
XLXiliang Luo
Xiliang Luo
Task offloading is a promising technology to exploit the benefits of fog computing. An effective task offloading strategy is needed to utilize the computational resources efficiently. In this paper, we endeavor to seek an online task offloading strategy to minimize the long-term latency. In particular, we formulate a stochastic programming problem, where the expectations of the system parameters change abruptly at unknown time instants. Meanwhile, we consider the fact that the queried nodes can only feed back the processing results after finishing the tasks. We then put forward an effective algorithm to solve this challenging stochastic programming under the non-stationary bandit model. We further prove that our proposed algorithm is asymptotically optimal in a non-stationary fog-enabled network. Numerical simulations are carried out to corroborate our designs.

20 July 2025
Verified
Conference Paper
Open access
YWYaxuan Wang
Yaxuan Wang
HCHao Cheng
Hao Cheng
JXJing Xiong
Jing Xiong
QWQingsong Wen
Qingsong Wen
HJHan Jia
Han Jia
YLYang Liu
Yang Liu

4 November 2025 in Neurocomputing
Verified
Journal Article
Closed access
YLYao Lu
Yao Lu
XCXuguang Chen
Xuguang Chen
JGJianyang Gu
Jianyang Gu
YZYuchen Zhang
Yuchen Zhang
QXQi Xuan
Qi Xuan
ZZZhaowei Zhu
Zhaowei Zhu