AF-DNDF: Asynchronous Federated Learning of Deep Neural Decision Forests
Abstract
In recent years, with more edge devices being put into use, the amount of data that is created, transmitted and stored is increasing exponentially. Moreover, due to the development of machine learning algorithms, modern software-intensive systems are able to take advantage of the data to further improve their service quality. However, it is expensive and inefficient to transmit large amounts of data to a central location for the purpose of training and deploying machine learning models. Data transfer from edge devices across the globe to central locations may also raise privacy and concerns related to local data regulations. As a distributed learning approach, Federated Learning has been introduced to tackle those challenges. Since Federated Learning simply exchanges locally trained machine learning models rather than the entire data set throughout the training process, the method not only protects user data privacy but also improves model training efficiency. In this paper, we have investigated an advanced machine learning algorithm, Deep Neural Decision Forests (DNDF), which unites classification trees with the representation learning functionality from deep convolutional neural networks. In this paper, we propose a novel algorithm, AF-DNDF which extends DNDF with an asynchronous federated aggregation protocol. Based on the local quality of each classification tree, our architecture can select and combine the optimal groups of decision trees from multiple local devices. The…
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
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?
Authors in [180] introduce an asynchronous federated aggregation protocol specifically for target recognition.
“To further optimize model selection authors in [180] introduce an asynchronous federated aggregation protocol specifically for target recognition.”
From Privacy-preserving Machine Learning in Internet of Vehicle Applications: Fundamentals, Recent Advances, and Future Direction (2025) · cites this paper as [180]
The protocol in [180] selects optimal local models based on data quality and computational capacity of clients.
“Similar to [164] this protocol also selects optimal local models based on data quality and computational capacity of clients.”
From Privacy-preserving Machine Learning in Internet of Vehicle Applications: Fundamentals, Recent Advances, and Future Direction (2025) · cites this paper as [180]
Cites
Lwakatare, L. E., Raj, A., Bosch, J., Olsson, H. H., & Crnkovic, I. (2019) · Lecture Notes in Business Information Processing · doi:10.1007/978-3-030-19034-7_14 · Cited by 214 · see citing works
Self-citationEngineering AI Systems: A Research Agenda
Bosch, J., Olsson, H. H., & Crnkovic, I. (2021) · Advances in Systems Analysis, Software Engineering, and High Performance Computing · doi:10.4018/978-1-7998-5101-1.ch001 · Cited by 108 · see citing works
Self-citation
Flagged first, then by citations
Cited by
Sorted by citations
Islam, N., & Zulkernine, M. (2025) · arXiv · doi:10.48550/arxiv.2503.01089 · Cited by 1 · see citing works
“Despite various advances, high computational costs and complexity associated with HE still persist when integrating in PPML [2].”
- Authors
- Zhang, H., Bosch, J., Olsson, H. H., & Koppisetty, A. C.
- Affiliations
- Chalmers University of Technology (SE)
- Volvo (Sweden) (SE)
- Venue
- 2021 47th Euromicro Conference on Software Engineering and Advanced Applications (SEAA)
- Publisher
- IEEE
- Published
- 2021-09
- Pages
- 308-315
- OpenAlex
- W3210230975
- Cited by
- 10
- References
- 2
- Citations by year
- 2026: 1 · 2025: 4 · 2024: 2 · 2023: 2 · 2022: 1
- FWCI
- 0.58
- Type
- conference paper
- Language
- en
- Open access
- closed
- Licence
- Locations
- Euromicro Conference on Software Engineering and Advanced Applications (SEAA) (publishedVersion)
- Chalmers Research (Chalmers University of Technology) (submittedVersion)
- 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
- Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
- Keywords
- asynchronous federated learning, edge computing, communication efficiency, privacy-preserving machine learning, automotive applications, heterogeneous hardware, classification trees
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