Pith. sign in

REVIEW 3 cited by

SplitFed: When Federated Learning Meets Split Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2004.12088 v5 pith:TSTL4NTN submitted 2020-04-25 cs.LG

classification cs.LG
keywords learningclientsmodelprivacysplitmachineapproachesbetter
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Federated learning (FL) and split learning (SL) are two popular distributed machine learning approaches. Both follow a model-to-data scenario; clients train and test machine learning models without sharing raw data. SL provides better model privacy than FL due to the machine learning model architecture split between clients and the server. Moreover, the split model makes SL a better option for resource-constrained environments. However, SL performs slower than FL due to the relay-based training across multiple clients. In this regard, this paper presents a novel approach, named splitfed learning (SFL), that amalgamates the two approaches eliminating their inherent drawbacks, along with a refined architectural configuration incorporating differential privacy and PixelDP to enhance data privacy and model robustness. Our analysis and empirical results demonstrate that (pure) SFL provides similar test accuracy and communication efficiency as SL while significantly decreasing its computation time per global epoch than in SL for multiple clients. Furthermore, as in SL, its communication efficiency over FL improves with the number of clients. Besides, the performance of SFL with privacy and robustness measures is further evaluated under extended experimental settings.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Mobius Learning: Cyclic Depth Folding in Transformers

    cs.LG 2026-07 conditional novelty 6.0 of 10

    Möbius Learning, which cyclically shifts block order across data streams, achieves lower validation loss than fixed-order looped training at loop depths 6, 10, and 15 in a 124M-parameter GPT-2 experiment.

  2. SuperSFL: Resource-Heterogeneous Federated Split Learning with Weight-Sharing Super-Networks

    cs.DC 2026-01 conditional novelty 5.0 of 10

    A weight-sharing super-network plus locally supervised gradient fusion makes split-federated learning converge in fewer communication rounds than fixed-split baselines.

  3. Federated Split Learning with Improved Communication and Storage Efficiency

    cs.LG 2025-07 conditional novelty 4.0 of 10

    CSE-FSL combines an auxiliary network for local updates with periodic smashed-data uploads and a single server-side model, claiming convergence under non-convex loss and lower communication and storage costs.

Pith tools