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
When Federated Learning Meets Privacy-Preserving Computation
Chen, J., Yan, H., Liu, Z., Zhang, M., Xiong, H., & Yu, S. (2024) · ACM Computing Surveys · doi:10.1145/3679013 · Cited by 247
Personalized Federated Learning With Differential Privacy and Convergence Guarantee
Wei, K., Li, J., Ma, C., Ding, M., Chen, W., Wu, J., Tao, M., & Poor, H. V. (2023) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2023.3293417 · Cited by 210
Self-citationFederated Learning in Intelligent Transportation Systems: Recent Applications and Open Problems
Zhang, S., Li, J., Shi, L. X., Ding, M., Nguyen, D. C., Tan, W., Weng, J., & Han, Z. (2023) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2023.3324962 · Cited by 206
Self-citationFederated Learning Over Wireless IoT Networks With Optimized Communication and Resources
Chen, H., Huang, S., Zhang, D., Xiao, M., Skoglund, M., & Poor, H. V. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2022.3151193 · Cited by 202
Self-citationRobust Information Bottleneck for Task-Oriented Communication With Digital Modulation
Xie, S., Ma, S., Ding, M., Shi, Y., Tang, M., & Wu, Y. (2023) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2023.3288252 · Cited by 170
Self-citation
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Low-Latency Federated Learning Over Wireless Channels With Differential Privacy. https://app.cochat.ai/papers/10.1109/jsac.2021.3126052
- The paper
- Wei, K., Li, J., Ma, C., Ding, M., Chen, C., Jin, S., Han, Z., & Poor, H. V. (2022). Low-Latency Federated Learning Over Wireless Channels With Differential Privacy. IEEE Journal on Selected Areas in Communications. https://doi.org/10.1109/jsac.2021.3126052
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.