- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes PyramidSFL, a resource-aware stacked-activation Split Federated Learning framework that dynamically selects client-specific cut layers according to computation and communication resources. To address the optimization inconsistency introduced by heterogeneous cut layers, the method combines a bandwidth-prioritized warm-up phase with layer-wise weight shrinking, while retaining a shared server-side model. The paper also provides a convergence analysis of fixed-cut SA-SFL and experimentally evaluates the method on CIFAR-10, CIFAR-100, and Tiny-ImageNet.
Critical strengths
- The paper addresses a practically relevant problem by jointly considering system heterogeneity and optimization degradation in split federated learning.
- The client-specific adaptive splitting mechanism provides a natural way to balance local computation and communication costs under heterogeneous device conditions.
Critical weaknesses
- The related-work section explicitly discusses several adaptive splitting approaches, but the main baselines are SFLV1/V2, SA-SFL, MergeSFL, ParallelSFL, and SMoFi. A direct comparison with existing resource-aware adaptive-splitting SFL methods would better establish the novelty and empirical advantage of PyramidSFL.
- Client computation and bandwidth are sampled from AI Benchmark and MobiPerf, while the experiments themselves are executed on NVIDIA A40/A100 GPUs. Real-device experiments would provide stronger evidence that the reported wall-clock improvements translate to practical SFL systems.
- Equation 4 optimizes the synchronization latency of client-side forward propagation, whereas the actual training latency also includes backward computation, server-side computation, and bidirectional communication. A clearer justification is needed for why minimizing this partial latency objective reliably minimizes end-to-end training time.
- The convergence analysis is derived for fixed-cut SA-SFL with uniform partial participation, whereas PyramidSFL relies on dynamic client-specific splitting, biased warm-up sampling, and layer-wise weight shrinking. Consequently, the theory provides useful background but does not formally explain the convergence behavior of the proposed method itself.
- The text states that client models of different depths must first be reconstructed into full models and then averaged, whereas Algorithm 1 directly describes averaging the client-side submodels and concatenating them with the server-side model. This discrepancy should be resolved.
Questions for authors
Please see Weaknesses.