Demo Data from EDBT 2026 / reviewers in the wild / expert
Zhongyuan Zhao 0003
dblp:40/9951-3
· DBLP profile ↗
8ranked-venue papers
4as first author
4since 2021 · last 2026
0000-0002-6312-4225ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 3 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 1 since 2021Computer networks · 1 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Efficient and distributed learning · 100% | |
| Network and information security
1 paper |
Privacy and data protection · 50% Security and privacy of machine learning · 50% | |
| Computer networks
1 paper |
Internet of things and sensor networks · 100% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning › federated learning
decentralized federated learning |
1.0 | 1 | 2026 | Decentralized Online Federated Learning With Bandit Feedback in Wireless IoT Networks · IEEE Trans. Mob. Comput. 2026 |
Machine learning › Efficient and distributed learning
federated learning |
1.0 | 1 | 2026 | Decentralized Online Federated Learning With Bandit Feedback in Wireless IoT Networks · IEEE Trans. Mob. Comput. 2026 |
Privacy and data protection
differential privacy |
1.0 | 1 | 2026 | Decentralized Online Federated Learning With Bandit Feedback in Wireless IoT Networks · IEEE Trans. Mob. Comput. 2026 |
Security and privacy of machine learning
federated learning |
1.0 | 1 | 2026 | Decentralized Online Federated Learning With Bandit Feedback in Wireless IoT Networks · IEEE Trans. Mob. Comput. 2026 |
Internet of things and sensor networks › iot networks
wireless iot |
0.3 | 1 | 2026 | Decentralized Online Federated Learning With Bandit Feedback in Wireless IoT Networks · IEEE Trans. Mob. Comput. 2026 |
Methods — techniques the papers use, named apart from their topics
regret analysis · 3.0one-point residual feedback · 3.0differential privacy · 3.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Decentralized Online Federated Learning With Bandit Feedback in Wireless IoT NetworksabstractThe traditional federated learning (FL) approach in the Wireless Internet of Things (WIoT) relies on a central server to coordinate and manage the entire training process, which contradicts the design concept of distributed and autonomous IoT systems. In actual WIoT scenarios, it is difficult to find a reliable third party to serve as a central server to reduce the risk of single points of failure and system paralysis. Moreover, the dynamism and heterogeneity of the WIoT system require strong privacy protection mechanisms to safeguard the vast amounts of user data stored on devices. To tackle these issues, this paper introduces a decentralized federated learning (DFL) utilizing differential privacy (DP) applied in WIoT scenarios to ensure robust privacy protection. Furthermore, to address the black box model problem of FL neural networks, a one-point residual feedback (OPRF) mechanism is adopted. Unlike one-point feedback, regret analysis in OPRF relies on weaker assumptions and is more applicable to practical non-stationary optimization problems. Although OPRF increases randomness, complicating convergence boundaries and potentially causing error accumulation, rigorous analysis demonstrates that the proposed algorithm achieves a sublinear rate and$\epsilon$-differential privacy. Finally, simulation experiments validate the effectiveness and superior performance of the algorithm. Zhongyuan Zhao 0003, Mengli Wei 0001 |
IEEE Trans. Mob. Comput. | 1 |
| 2024 | Cubature particle filtering fusion with descent gradient and maximum correntropy for non-Gaussian noise
Quanbo Ge, Liangyi Zhang, Zhongyuan Zhao 0003, Xingguo Zhang, Zhenyu Lu 0002 |
Neurocomputing | 3 |
| 2024 | Differentially private distributed online optimization via push-sum one-point bandit dual averaging
Zhongyuan Zhao 0003, Ju Yang, Mengli Wei 0001 |
Neurocomputing | 1 |
| 2024 | DeFedHDP: Fully Decentralized Online Federated Learning for Heart Disease Prediction in Computational Health SystemsabstractHeart disease is a leading global cause of death, while federated learning (FL) is an effective way to predict it. Due to patient privacy concerns and the centralized nature of current FL approaches, collaborative research in heart disease prediction (HDP) faces significant hurdles in computational health systems. This article introduces a distributed online aggregation method within fully decentralized federated learning (DFL), named DeFedHDP, to address these privacy challenges and improve the model of HDP. Moreover, the differential privacy (DP) mechanism is applied to the aggregation strategy of DeFedHDP to protect the privacy of the patients. The data holder communicates directly with neighbors in a series of time-varying directed graphs without the involvement of a central server. Furthermore, each participant is both a trainer of the local model and a collaborator of the other participants’ models. The data does not leave the local device, only the model parameters are exchanged and integrated, and this decentralized approach can further improve the level of privacy protection. In addition, to cope with model gradient disappearance and gradient explosion, the one-point bandit feedback (OPBF) strategy is utilized to estimate the true gradient values. Experiments on a public medical dataset show that the effectiveness of DeFedHDP is close to the centralized FedAVG algorithm for client-server architectures in terms of accuracy and speed. Mengli Wei 0001, Ju Yang, Zhongyuan Zhao 0003, Xiaogang Zhang 0001, Jinsong Li 0005, Zhiliang Deng |
IEEE Trans. Comput. Soc. Syst. | 3 |
| 2018 | Distributed Event-based Algorithm for Economic Dispatch Problem over Digraph with Time delaysabstractThe economic dispatch problem(EDP) in microgrid over directed networks with communication time delays is investigated. We design a distributed event-based algorithm to handle EDP in microgrid over strongly connected and balanced digraph. Furthermore, the effect of time delays has been considered. By graph theory and Lyapunov method, an appropriate event-triggered condition is obtained and the corresponding sufficient condition which guarantees stability of the proposed algorithm is devised. As the periodic sample control has been adopted, the Zeno behavior is excluded naturally. Finally, Simulation results demonstrate the effectiveness of the algorithm. Zhongyuan Zhao 0003, Gang Chen 0014 |
ICARCV | 1 |
| 2018 | Distributed event-triggered scheme for a convex optimization problem in multi-agent systems
Zhongyuan Zhao 0003, Gang Chen 0014, Mingxiang Dai |
Neurocomputing | 1 |
| 2018 | Distributed Finite-Step Iterative Algorithm for Economic Dispatch of GenerationabstractBy combining the Newton-Raphson method, the graph discovery algorithm, and the finite-time consensus algorithm, a novel iterative algorithm is proposed in this paper to solve the economic dispatch problem of modern cyber-physical power systems. Fully distributed implementation and finite-time convergence properties distinguish our algorithm from the existing iterative algorithms. Several numerical examples are applied to illustrate our design procedure and validate our proposed algorithm. Gang Chen 0014, Zhongyuan Zhao 0003, Zhiyong Li 0013 |
IEEE Trans. Ind. Informatics | 2 |
| 2016 | An optimal active power control strategy of islanded microgrid with diverse communication delaysabstractCommunication networks are increasingly applied in smart grid for information exchange and optimal operation. This paper presents an optimal active power control strategy for islanded microgrid in the presence of communication delays. The control strategies are fully distributed. The impact of the diverse communication delays and the effectiveness of the algorithm are analyzed by using the Generalized Nyquist criterion. The proposed approach can minimize the total cost and maintain the supply-demand balance of the microgrid. Several case studies are carried out to verify the effectiveness of the proposed approach. Gang Chen 0014, Zhongyuan Zhao 0003, Mingxiang Dai |
ICARCV | 2 |