Low-Latency Federated Learning Over Wireless Channels With Differential Privacy
Open accessThe DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
Abstract
In federated learning (FL), model training is distributed over clients and local models are aggregated by a central server. The performance of uploaded models in such situations can vary widely due to imbalanced data distributions, potential demands on privacy protections, and quality of transmissions. In this paper, we aim to minimize FL training delay over wireless channels, constrained by overall training performance as well as each client’s differential privacy (DP) requirement. We solve this problem in a multi-agent multi-armed bandit (MAMAB) framework to deal with the situation where there are multiple clients confronting different unknown transmission environments, e.g., channel fading and interference. Specifically, we first transform long-term constraints on both training performance and each client’s DP into a virtual queue based on the Lyapunov drift technique. Then, we convert the MAMAB to a max-min bipartite matching problem at each communication round, by estimating rewards with the upper confidence bound (UCB) approach. More importantly, we propose two efficient solutions to this matching problem, i.e., a modified Hungarian algorithm and greedy matching with a better alternative (GMBA), of which the former can achieve the optimal solution with high complexity while the latter approaches a better trade-off by enabling verified low-complexity with little performance loss. In addition, we develop an upper bound on the expected regret of this MAMAB based FL framework, which shows a linear growth over the logarithm of communication rounds, justifying its theoretical feasibility. Extensive experimental results are conducted to validate the effectiveness of our proposed algorithms, and the impacts of various parameters on the FL performance over wireless edge networks are also discussed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Differential privacy [17, 18] guarantees that by looking at a model output, one cannot tell whether a sample is in the training dataset or not.”
From Machine Unlearning: A Survey (2024) · cites this paper as [18]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Learning Multiple Layers of Features from Tiny Images
Krizhevsky, A. (2024) · doi:10.57702/zp44cu3g · Cited by 23,395
Graph Theory with Applications
Bondy, J. A., & Murty, U. S. R. (1976) · doi:10.1007/978-1-349-03521-2 · Cited by 9,043
Deep Learning with Differential Privacy
Abadi, M., Chu, A., Goodfellow, I., McMahan, H. B., Mironov, I., Talwar, K., & Zhang, L. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978318 · Cited by 6,578
Federated learning: Challenges, methods, and future directions
Li, T., Sahu, A. K., Talwalkar, A., & Smith, V. (2020) · IEEE Signal Processing Magazine · doi:10.1109/msp.2020.2975749 · Cited by 6,210
Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms
Xiao, H., Rasul, K., & Vollgraf, R. (2017) · arXiv · doi:10.48550/arxiv.1708.07747 · Cited by 6,108
The Algorithmic Foundations of Differential Privacy
Dwork, C., & Roth, A. (2014) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000042 · Cited by 5,557
The Algorithmic Foundations of Differential Privacy
Dwork, C., & Roth, A. (2013) · doi:10.1561/9781601988195 · Cited by 3,856
Federated Learning With Differential Privacy: Algorithms and Performance Analysis
Wei, K., Li, J., Ding, M., Ma, C., Yang, H. H., Farokhi, F., Jin, S., Quek, T. Q. S., & Vincent Poor, H. (2020) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2020.2988575 · Cited by 2,400
Self-citationAdaptive Federated Learning in Resource Constrained Edge Computing Systems
Wang, S., Tuor, T., Salonidis, T., Leung, K. K., Makaya, C., He, T., & Chan, K. (2019) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2019.2904348 · Cited by 2,232
Convergence of Stochastic Processes
Pollard, D. (1984) · Springer Series in Statistics · doi:10.1007/978-1-4612-5254-2 · Cited by 1,841
Cited by
Items 101–134 of 134
On Location Privacy Protection Algorithm Based on Edge Computing and Caching
Xu, X., Song, H., Zhang, K., Chen, L., & Qian, Y. (2021) · Journal of Physics Conference Series · doi:10.1088/1742-6596/2138/1/012010
Series Editorial The Fourth Issue of the Series on Machine Learning in Communications and Networks
Li, G. Y., Saad, W., Özgür, A., Kairouz, P., Qin, Z., Hoydis, J., Han, Z., Gündüz, D., & Elmirghani, J. M. H. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3126188
Self-citation2022 Index IEEE Journal on Selected Areas in Communications Vol. 40
(2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2022.3224551
FedSKG: Self-supervised Federated Learning with Structural Knowledge of Global Model
Li, J., Luo, D., Wei, K., Mei, Z., & Shao, Y. (2023) · IEEE International Conference on Parallel and Distributed Systems (ICPADS) · doi:10.1109/icpads60453.2023.00228
Self-citationCommunication-efficient Federated Learning with Privacy Enhancing via Probabilistic Scheduling
Zhou, Z., Huang, S., Wu, Y., Wen, D., Wang, T., Cai, H., & Shi, Y. (2024) · IEEE/CIC International Conference on Communications in China (ICCC) · doi:10.1109/iccc62479.2024.10681936
Dynamic Model Selection for Asynchronous Federated Learning in IoBT Scenarios
Tankard, E., Hagos, D. H., & Rawat, D. B. (2024) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata62323.2024.10825857
Learning to compress via robust information bottleneck with digital modulation
Zhou, Y. Q., Zou, Y., Wu, Y., Shi, Y., & Zhang, J. (2025) · Elsevier eBooks · doi:10.1016/b978-0-44-322073-9.00017-1
PDTV-FEL: privacy-preserving and dual traceable verification federated edge learning
Zhang, P., Xu, L., Xu, C., Mei, L., & Ni, Y. (2026) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-026-03138-w
Investigating Training Efficiency of Direct Scaling in Multi-Agent Reinforcement LearningPreprint
Hosley, B., Cox, B. A., Robbins, M., & Yielding, N. J. (2025) · Research Square · doi:10.21203/rs.3.rs-7275059/v1
A Contextual Client Selection Method for Volatile Federated Learning
Wang, Z., Zheng, Z., & Chen, Q. (2025) · International Conference on Computer Communications and Networks (ICCCN) · doi:10.1109/icccn65249.2025.11133929
Privacy Enhancement in Over-the-Air Federated Learning via Adaptive Receive Scaling
Kalarde, F. M., Liang, B., Dong, M., Ahmed, Y., & Cheng, H. T. (2026) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom59046.2026.11571657
Farooqi, S. A., Rahman, A. A. R., & Saad, A. B. (2025) · Advances in Science Technology and Engineering Systems Journal · doi:10.25046/aj100606
Improving Wireless Networking from the Learning and Security Perspectives
Qu, Z. (2022) · Digital Commons - University of South Florida (University of South Florida)
An Alternate Formulation for Computing/Validating the Shannon Entropy of Probability Distributions
Srinivasan, P. (2025) · American Journal of Mathematical and Computer Modelling · doi:10.11648/j.ajmcm.20251004.13
FedSME: Spatial Mode Entropy Aware Aggregation for Federated LearningPreprint
Subramanian, D. K., & Liang, Q. (2026) · doi:10.36227/techrxiv.176739864.49833843/v1
Verifiability of Unlearning Schemes Through Local Explanation
Kasrelou, S. (2025) · PolyPublie (École Polytechnique de Montréal)
Edge-End Heterogeneous Collaborative Learning by Prototype Selection and Edge Association
Yu, E., Dai, H., Zhang, H., Qu, Y., Wu, T., Cheng, P., Hou, S., Zheng, Z., Wu, F., & Chen, G. (2026) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2026.3678282
AI Without Borders: Federated Learning for Intelligent Edge Computing
Surapaneni, P., Nallamothu, T., Kapila, R., & Bojjagani, S. (2026) · Studies in computational intelligence · doi:10.1007/978-3-032-16711-8_10
Privacy-Utility Trade-Off in Federated Learning
Li, K., Yuan, X., & Ni, W. (2026) · Springer series in reliability engineering · doi:10.1007/978-3-032-23959-4_9
Interference-Resilient Power Allocation for Hierarchical Over-the-Air Federated Learning
Yao, J., Li, B., He, D., Xu, J., Fang, Y., Han, G., & Quek, T. Q. S. (2026) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2026.3704708
FedSUV: Validity and Utility-guided Client Selection for Federated Learning
Chen, X., Chen, W., Chen, Y., & Xu, H. (2026) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom59046.2026.11571211
Studies on Intelligent and Secure Emergency Networking Technologies in 6G for Disaster Response
Pauu, K. T. (2025) · Institutional Repositories DataBase (IRDB) · doi:10.20556/0002008482
Wu, J., Zhou, L., Shao, Z., Zou, Y., Li, T., Zhang, Y. R.-Y., & Yang, Z. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2607.07045
OFDM-Assisted Over-the-Air Computation With Privacy Protection in Federated Learning
Zuo, S., Fan, R., Zhao, P., Zhan, C., Hu, H., & Xiong, Z. (2026) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2026.3715532
Wang, L., Chen, W., Li, J., Wu, Q., Ding, M., Zhu, X., & Wu, Q. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2607.19759
Self-citationAbdulmajid, K. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.7067138
Communication Design for Dynamic Distributed Learning Systems
Kalarde, F. M. (2026) · TSpace (University of Toronto)
FedPriv: Personalized Differential Privacy in Federated Learning for Heterogeneous Data
Jiang, M., Ren, X., Zheng, X., Zhang, C., & Zhu, L. (2026) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2026.3730717
Zhu, S., Li, Z., Zhang, Z., Youjian, Y., Weifeng, Z. H. A. O., Zhang, Q., & Hai, Z. (2026) · Vehicular Communications · doi:10.1016/j.vehcom.2026.101083
Jakhar, N., & Singh, S. (2024) · International Journal of Convergent Research
Efficient, Secure Learning and Resource Management for Wireless Networks
Xue, J. (2026) · Digital Commons - University of South Florida (University of South Florida)
Federated Learning-Based AI-Driven Resource Scheduling for 5G/6G Networks
Gupta, P., & Chaitra, N. (2026) · International Conference on Networks, Computers and Communications (ICNCCom) · doi:10.1109/icnccom69117.2026.11736229
Sarker, M., & Cherkaoui, S. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.37424
Privacy-Preserving Solutions for UAV-Aided Uplink Massive MIMO Systems
Nguyen, T. T., Ha, V. N., Le, T.-D., Nguyen-Kha, H., Tran, D., Nguyen, K. K., & Chatzinotas, S. (2026) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2026.3747568
Metadata
- Authors
- Wei, K., Li, J., Ma, C., Ding, M., Chen, C., Jin, S., Han, Z., & Poor, H. V.
- Affiliations
- Nanjing University of Science and Technology (CN)
- Data61 (AU)
- Shanghai Jiao Tong University (CN)
- Southeast University (CN)
- Kyung Hee University (KR)
- Princeton University (US)
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2022-01
- Volume
- 40
- Issue
- 1
- Pages
- 290-307
- ISSN
- 0733-8716 (ISSN-L)
- 1558-0008
- OpenAlex
- W3211856354
- Semantic Scholar
- 227a995f92eaa4af0997a412b968fb0a6a5b3d11
- Cited by
- 109
- References
- 45
- Citations by year
- 2026: 14 · 2025: 20 · 2024: 40 · 2023: 25 · 2022: 8
- FWCI
- 6.63
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- IEEE Journal on Selected Areas in Communications (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- National Natural Science Foundation of China (61625106, 61872184, 61933009, 62002170, 62025305)
- Fundamental Research Funds for the Central Universities (30919011274)
- Program of Shanghai Academic Research Leader (19XD1421800)
- U.S. National Science Foundation (CNS-2128368, CNS-2107216)
- Toyota Motor Corporation
- Amazon Catalyst
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
- Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
- Keywords
- federated learning, differential privacy, wireless channels, multi-agent multi-armed bandit, Lyapunov drift, virtual queues, bipartite matching, Hungarian algorithm, upper confidence bound, regret upper bounds, edge networks
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.