The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Node Selection Toward Faster Convergence for Federated Learning on Non-IID Data
Open accessAbstract
Federated Learning (FL) is a distributed learning paradigm that enables a large number of resource-limited nodes to collaboratively train a model without data sharing. The non-independent-and-identically-distributed (non-i.i.d.) data samples invoke discrepancies between the global and local objectives, making the FL model slow to converge. In this paper, we proposedOptimal Aggregationalgorithm for better aggregation, which finds out the optimal subset of local updates of participating nodes in each global round, by identifying and excluding the adverse local updates via checking the relationship between the local gradient and the global gradient. Then, we proposed aProbabilisticNodeSelection framework (FedPNS) to dynamically change the probability for each node to be selected based on the output ofOptimal Aggregation.FedPNScan preferentially select nodes that propel faster model convergence. The convergence rate improvement ofFedPNSover the commonly adopted Federated Averaging (FedAvg) algorithm is analyzed theoretically. Experimental results demonstrate the effectiveness ofFedPNSin accelerating the FL convergence rate, as compared toFedAvgwith random node selection.
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.
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
Communication-Efficient Learning of Deep Networks from Decentralized Data
McMahan, H. B., Moore, E., Ramage, D., Hampson, S., & Arcas, B. A. Y. (2016) · arXiv · doi:10.48550/arxiv.1602.05629 · Cited by 14,215
Federated Optimization in Heterogeneous Networks
Li, T., Sahu, A. K., Zaheer, M., Sanjabi, M., Talwalkar, A., & Smith, V. (2018) · arXiv · doi:10.48550/arxiv.1812.06127 · Cited by 4,023
Fog and IoT: An Overview of Research Opportunities
Chiang, M., & Zhang, T. (2016) · IEEE Internet of Things Journal · doi:10.1109/jiot.2016.2584538 · Cited by 2,362
Client Selection for Federated Learning with Heterogeneous Resources in Mobile Edge
Nishio, T., & Yonetani, R. (2019) · ICC 2019 - 2019 IEEE International Conference on Communications (ICC) · doi:10.1109/icc.2019.8761315 · Cited by 1,875 · cited 3×
“Several works are carried out focusing on node selection design to improve the FL convergence rate, taking the system heterogeneity and uncertainty of wireless medium into consideration [18], [19], [21]–[23].”
BackgroundClient Selection for Federated Learning with Heterogeneous Resources in Mobile Edge
Nishio, T., & Yonetani, R. (2018) · arXiv · doi:10.48550/arxiv.1804.08333 · Cited by 1,875
Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Training
Lin, Y., Han, S., Mao, H., Wang, Y., & Dally, W. J. (2017) · arXiv · doi:10.48550/arxiv.1712.01887 · Cited by 1,134
Communication-Efficient Distributed Optimization using an Approximate Newton-type Method
Shamir, O., Srebro, N., & Zhang, T. (2013) · arXiv · doi:10.48550/arxiv.1312.7853 · Cited by 424 · cited 1×
“To better characterize the data heterogeneity and study its impact on model convergence, we generate synthetic data by following the similar setup as in [9], [29].”
MethodMobile-edge computing architecture: the role of mec in the internet of things
Sabella, D., Vaillant, A., Kuure, P., Rauschenbach, U., & Giust, F. (2016) · IEEE Consumer Electronics Magazine · doi:10.1109/mce.2016.2590118 · Cited by 413
Convergence Time Optimization for Federated Learning Over Wireless Networks
Chen, M., Poor, H. V., Saad, W., & Cui, S. (2021) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.3042530 · Cited by 403 · cited 1×
“Along with [21], authors in [22] proposed to use Artificial Neural Networks (ANNs) as a predictor to estimate the model updates of nodes that are not allocated the bandwidth for transmission, based on the model updates that are successfully transmitted using limited bandwidth resource.”
BackgroundWireless Network Intelligence at the Edge
Park, J., Samarakoon, S., Bennis, M., & Debbah, M. (2019) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2941458 · Cited by 92
Cited by
Xu, W., Yang, Z., Ng, D. W. K., Levorato, M., Eldar, Y. C., & Debbah, M. (2023) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2023.3239189 · Cited by 660
Federated Learning With Non-IID Data: A Survey
Lu, Z., Pan, H., Dai, Y., Si, X., & Zhang, Y. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3376548 · Cited by 430
Federated Learning in Edge Computing: A Systematic Survey
Abreha, H. G., Hayajneh, M., & Serhani, M. A. (2022) · Sensors · doi:10.3390/s22020450 · Cited by 342
Client Selection in Federated Learning: Principles, Challenges, and Opportunities
Fu, L., Zhang, H., Gao, G., Zhang, M., & Liu, X. (2023) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3299573 · Cited by 308
Myrzashova, R., Alsamhi, S. H., Shvetsov, A. V., Hawbani, A., & Wei, X. (2023) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3263598 · Cited by 178
“Although they compromise model correctness, structured, and sketched updates [105] can become promising strategies for model compression.”
Background
Metadata
- Authors
- Wu, H., & Wang, P.
- Venue
- IEEE Transactions on Network Science and Engineering
- Published
- 2022-09-01
- Volume
- 9
- Issue
- 5
- Pages
- 3099-3111
- ISSN
- 2327-4697 (ISSN-L)
- 2334-329X
- OpenAlex
- W3163105316
- Cited by
- 203
- References
- 10
- FWCI
- 13.98
- Type
- journal article
- Language
- en
- Open access
- green
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.