Zhaowei Zhu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Zhaowei Zhu has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Yang Liu
University of California Santa Cruz
3 shared publications Shengda Jin
2 shared publications- Xiliang Luo
School of Information and Science Technology, ShanghaiTech University, Shanghai, China
2 shared publications - Yang Yang
Beijing University of Posts and Telecommunications
2 shared publications - Abhishek Kumar
University of California, Santa Cruz, Mountain View, CA, USA
1 shared publication - Ehsan Amid
Google DeepMind ˝Sony CS Labs, Inc Google Research ˚The Australian National University & RIKEN AIP
1 shared publication
Latest Publications
- 4 November 2025
- Published by Elsevier in Neurocomputing
- Vol. 662
Dataset distillation with pre-trained models: A contrastive approach
- 4 November 2025
- Published by Elsevier in Neurocomputing
- Vol. 662
Dataset distillation with pre-trained models: A contrastive approach
- Open Access
- 20 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1551-1562
Noise-Resilient Point-wise Anomaly Detection in Time Series Using Weak Segment Labels
- 20 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1551-1562
Open AccessNoise-Resilient Point-wise Anomaly Detection in Time Series Using Weak Segment Labels
- 31 October 2024
- Published by Springer Nature
- p. 38-56
Federated Learning with Local Openset Noisy Labels
- 31 October 2024
- Published by Springer Nature
- p. 38-56
Federated Learning with Local Openset Noisy Labels
- Open Access
- 4 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 2523-2535
To Aggregate or Not? Learning with Separate Noisy Labels
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.
- 4 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 2523-2535
Open AccessTo Aggregate or Not? Learning with Separate Noisy Labels
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.
- 15 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 30 (12) , 2636-2649
BLOT: Bandit Learning-Based Offloading of Tasks in Fog-Enabled Networks
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.
- 15 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 30 (12) , 2636-2649
BLOT: Bandit Learning-Based Offloading of Tasks in Fog-Enabled Networks
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.
- 1 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Learn and Pick Right Nodes to Offload
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.
- 1 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Learn and Pick Right Nodes to Offload
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.
- 27 February 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 17 (5) , 3185-3200
Time Reusing in D2D-Enabled Cooperative Networks
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.
- 27 February 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 17 (5) , 3185-3200
Time Reusing in D2D-Enabled Cooperative Networks
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.