- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The work presents a framework for federated learning that extends existing SOTA with the ability to do split federated learning in a decentralized and asynchronous mode. The use case is to enable low-capability edge devices to participate in model training when devices have access to only a subset of the training data and also the model is too large for a single device so its training is split across two devices. Experimental results indicate that it is still possible to achieve an acceptable accuracy even under these constraints and requirement.
Critical strengths
The proposed approach is interesting because it allows to split model under training across multiple devices and at the same time eliminate the centralized and synchronous training schema. This comes with a significant amount of complexity though and the provided descripting and algorithms do not make it particularly easy to follow. Nevertheless, the work seems to be relatively novel and interesting.
Experimental results seem to indicate that a satisfactory performance can be achieved with this approach. Experiments carried out with multiple datasets and multiple models are compared to other federated learning techniques and indicate a superiority of the proposed method.
The paper is structured around answering critical questions to demonstrate the performance and scalability of the proposed training mode.
Critical weaknesses
One weakness of this work is that only toy datasets and small enough models have been used in conducting experimental study. It is not clear how the datasets were split between each subset of federated devices. For a real-life scenario there are probably other considerations that need to be taken into account, such as a disbalance between the amount of data in each federation and frequency with which a new data arrives (since these are IoT devises and presumably they receive new data from sensors.) This study is still valuable even under the idealized conditions, but its real application needs to be tested.
Questions for authors
Why stopping at splitting the model only across 2 devices? How would the proposed method work if the model is too large for two devices? How scalable is the proposed solution in this dimension?
Review Response
We thank the reviewer for the positive assessment and for finding the approach novel and interesting. We address the questions and concerns below.
We have uploaded a revised version of the paper. It clarifies the communication experiment: the gossip volumes in Table 2 are estimates of the traffic each trigger would send, while the accuracies are measured and test whether filtering communication degrades the model. It also fixes a broken equation reference and corrects several grammatical errors.
Datasets and model size
Our target devices are tiny resource constrained microcontrollers such as the ESP32-S3, which have only a few hundred kilobytes of on-chip memory. To evaluate ARC-SFL across different model complexities and maintain comparability with prior SFL work, our simulation experiments include architectures up to ResNet-18 with approximately 11.2M parameters, of which 15–25% reside in the client-side partition depending on the architecture (Table 6). These larger model experiments evaluate the framework's behavior in simulation and should not be interpreted as demonstrating the feasibility of training ResNet-18 on tiny devices. Separately, we evaluate ARC-SFL on real IoT clusters using UCI-HAR and FashionMNIST (Section 4). UCI-HAR consists of actual device-attached sensor recordings and is particularly relevant to the IoT scenario described by the reviewer. Our simulation benchmarks follow established SFL evaluation practice, facilitating comparison with prior work, while also covering additional modalities such as medical imaging (MedMNIST) and audio (Speech Commands).
How the data is split
Each simulated benchmark is partitioned across 50 clients using a Dirichlet distribution with concentration parameter α=0.5 (Section 4 and Table 3), a common approach for simulating non-IID federated data. This introduces heterogeneous label distributions across clients and can also result in unequal local dataset sizes. The hardware experiments on UCI-HAR follow the same Dirichlet configuration, with four training clients in the five-device cluster and eight training clients in the ten-device cluster (Fig. 14). ARC-SFL accounts for differences in client contributions through its aggregation mechanisms, i.e., gossip aggregation weights each peer by the number of samples it has processed (Eq. 2), while committee consensus weights each member by the number of activations it has served (Eq. 3). These mechanisms account for differences in participation and processed data volumes without requiring equal contributions from all devices.
To clarify the answers to the questions explicitly:
Q1: Why stop at splitting the model across two devices? Two segments is the standard SFL setting and already allows training models that do not fit on a single microcontroller. Every additional split adds a wireless communication hop, which is the main bottleneck on such devices, so two segments keep this cost low.
Q2: How would the method work if the model is too large for two devices? First, ARC-SFL already reduces how often this case occurs. Because clients and committee members are devices of similar capability, we split the model more evenly than typical SFL, where the client holds only a small part and a powerful server holds the rest (Section 3.1). Both devices' memory is therefore used, so a model has to be considerably larger before two devices are no longer enough. If it still does not fit, the model would be cut into more than two parts, and each additional part would get its own committee. For example, with three parts, each client holds the first part, a first committee holds replicas of the middle part, and a second committee holds replicas of the last part. In the forward pass, the client sends its activations to a member of the first committee, which computes the middle part and forwards its activations to a member of the second committee. That member computes the loss and sends the gradient back along the same path. The middle committee would work exactly like a client and a committee member at the same time: it receives activations from below and gradients from above. The existing mechanisms carry over to each of these links. Gradients that arrive late are down-weighted with the same staleness discount, and the middle part could use its own auxiliary head to keep training while it waits for gradients from the last part, just as clients do today. Both committees would rotate and synchronize their replicas as described in Section 3.
Q3: How scalable is the method in this dimension? Each extra segment adds one activation and gradient exchange per batch, staleness accumulates along the chain, and every additional committee is one more point where a failure can interrupt training. We therefore expect a small number of segments to be practical, but we have not evaluated more than two in this paper.