---
title: Semi-Decentralized Federated Learning
url: https://www.emergentmind.com/topics/semi-decentralized-federated-learning-sdfl
type: topic
---

# Semi-Decentralized Federated Learning

Semi-Decentralized Federated Learning (SDFL) is a distributed learning paradigm that bridges the gap between centralized federated learning (FL) architectures and fully decentralized/gossip-based learning schemes. SDFL organizes a large number of clients into clusters, typically with local aggregators (e.g., edge servers or peer-elected leaders), achieves local consensus or aggregation within clusters, and then either synchronizes these aggregates globally via a parameter server or via peer-to-peer server-level coordination. This architectural design offers substantial improvements in communication efficiency, robustness to client and server failures, and scalability particularly for large-scale, resource-constrained, and heterogeneous environments. SDFL models underpin practical systems and modern theoretical advances across energy-aware edge intelligence, trustable federated optimization, and communication-constrained learning.

## 1. Architectural Principles and Topologies

SDFL architectures have emerged in response to the bottlenecks and fragilities inherent to classic FL and decentralized protocols. Centralized FL funnels all model updates to a single server, limiting scalability, incurring a single point of failure, and suffering under uplink bandwidth constraints. Fully decentralized FL, conversely, relies on peer-to-peer exchange for model parameter dissemination—a scheme that, while robust to server failures, can be slow to converge and communication-intensive.

SDFL operates between these extremes:

- **Hierarchical or clustered topologies:** Clients are partitioned into disjoint clusters (typically determined by proximity or capabilities), each managed by a local aggregator (edge server or dynamically elected node). These aggregators perform intra-cluster model aggregation and then either: (a) communicate with a global server (star–ring, star–star, or star–mesh architectures), or (b) coordinate in a decentralized mapping (peer-to-peer or partial-mesh inter-aggregator protocols) [2112.10313, 2403.14718, 2311.18787, 2503.13624].
- **Device-to-Device (D2D) and Device-to-Server (D2S) Integration:** Many SDFL variants combine local D2D (or intra-cluster) communication with periodic D2S global aggregation to exploit the reliability, low power, and latency of localized exchanges, while maintaining global statistical convergence [2303.08988, 2103.10481, 2406.19002].
- **Edge–Cloud–Device Hierarchies:** Multi-tier SDFL frameworks broadly follow the structure: Devices ↔ Edge-Servers ↔ Cloud-Server, with each layer executing model updates and consensus to diminish both communication cost and data drift [2403.14718, 2112.10313].

This topology reduces peak communication on single nodes, yields increased robustness, and supports parallel, hierarchical, or asynchronous aggregation.

## 2. Representative Algorithms, Communication, and Aggregation Protocols

The prototypical SDFL round is composed of local updates, intra-cluster aggregation, and inter-cluster/global synchronization:

- **Local Updates:** Each client performs $T$ steps of SGD on private data.
- **Intra-Cluster Aggregation:** Cluster aggregator(s) combine local models, normally via weighted averaging by local dataset size [2112.10313, 2503.13624].
- **Inter-Cluster / Global Aggregation:** Aggregators or server(s) combine cluster aggregates into a new global model. Options include:
  - Centralized averaging at a parameter server [2103.10481, 2403.14718].
  - Peer-to-peer inter-edge consensus using mixing matrices or gossip [2112.04737, 2112.10313].
  - Incremental subgradient or ring-based incremental aggregation for non-IID robustness [2403.14718].

**Asynchronous SDFL** variants are realized by letting edge servers (or cluster heads) set their own aggregation deadlines independently, accept stale or partial updates with staleness-aware weighting, and avoid global round synchronization [2112.04737, 2112.10313].

**Cooperative and coded relaying** strategies, such as collaborative relaying (ColRel) or deterministic diversity network codes, provide straggler resilience and unbiased aggregation in the event of intermittent client–server and client–client connectivity [2202.11850, 2404.00780, 2406.19002, 2205.10998].

**Probabilistic and adaptive communication schemes** such as PISCO interleave agent-to-server and agent-to-agent rounds, with the mixing probability tuned to network conditions—this enables principled trade-offs between global and local communication [2311.18787].

## 3. Optimization, Convergence Theory, and Client Dynamics

SDFL leverages advanced optimization and consensus techniques to ensure statistically efficient and robust convergence:

- **Convergence Guarantees:** Under standard smoothness and convexity assumptions, synchronous and asynchronous SDFL methods yield convergence rates $O(1/\sqrt{K})$ (non-convex) or $O(1/K)$ (strongly convex), with explicit dependence on heterogeneity, staleness, and intra-cluster communication parameters [2112.10313, 2112.04737, 2311.18787].
- **Staleness and Straggler Analysis:** Asynchronous schemes introduce bias and variance controlled by the maximum staleness $\delta_\mathrm{max}$ and heterogeneity gap $H = \max_i h_i/\min_j h_j$. Staleness-aware aggregation and adaptive decay functions mitigate these effects [2112.04737, 2112.10313].
- **Gradient Coding and Diversity Networks:** SDFL-coded strategies guarantee exact global gradient recovery under packet loss constraints, with outage probability and convergence rate derived as functions of code redundancy and wireless link statistics [2406.19002, 2404.00780].
- **Client Scheduling and Trust-aware Participation:** Dynamic client participation, modeled via hidden semi-Markov models and trust metrics, is used to optimize server load, reliability, and model quality. Greedy and integer-programming-based schedulers select trusted and high-quality participants dynamically per round, preserving convergence rates and reducing training loss [2412.11448].

## 4. Trust, Incentive Mechanisms, and Blockchain Integration

Large-scale SDFL deployments require robust defenses against faulty or malicious nodes and unreliable participants. Recent work tightly integrates trust evaluation and incentive design within SDFL workflows:

- **Trust Score Computation:** Each node's trust is a weighted function of accuracy contribution, consistency, data quality, and participation regularity, with explicit decay and recovery [2602.08290].
- **Admission and Reward Policies:** Policies gate node admission, place low-trust nodes on probation, and suspend persistently low-contributing participants. Rewards are allocated proportional to a utility score and trust value; slashing is triggered by repeated failures or malicious action [2602.08290, 2310.19287].
- **Blockchain and Smart Contracts:** Blockchain is employed to store model hashes, enforce incentive policy, and provide distributed, tamper-proof logs. Trust penalization mechanisms reduce the impact of malicious updates, and smart contracts handle slashing and reward distribution [2310.19287, 2602.08290].
- **Decentralized Storage:** Off-chain storage using IPFS minimizes on-chain storage cost and latency. Model snapshots, round reports, and trust digests are referenced on-chain (typically as Merkle roots) [2602.08290].

Empirical results indicate that blockchain integration adds $\sim$10–15% computational overhead but does not degrade convergence or accuracy for up to 20 clients [2310.19287].

## 5. Communication Efficiency, Resource and Energy Considerations

SDFL protocols are explicitly designed to optimize communication load and computational cost:

- **Hierarchical and Multi-tier Aggregation:** By reducing the number of uplinks to the global server, cluster-based aggregation reduces per-node and total communication. For a total of $K$ clients and $M$ clusters, SDFL reduces server-bound messages from $K$ to $M$ per global round [2403.14718, 2503.13624].
- **Adaptive Participation and Connectivity-Aware Client Selection:** SDFL frameworks dynamically sample clients within clusters based on connectivity (out-degree, singular values of cluster adjacency matrices) and energy budgets. Quantitative savings up to $\sim$50% in total D2S (device-to-server) transmissions to achieve a given accuracy are established in simulation [2303.08988].
- **Partial Model Exchange and Lightweight Neighbor Aggregation:** Offline clients or those with intermittent connection upload only partial parameters (e.g., last layer) to neighbors, reducing communication by $\approx0.8\%$ per offline round [2509.03660].
- **Compression, Quantization, Gradient Coding:** Stochastic gradient quantization, systematic codebooks, and batch splitting further reduce per-message size with negligible accuracy impact [2404.00780, 2406.19002, 2503.13624].
- **Parallel Local Updates:** By configuring the number of local updates per global round ($T_o$), SDFL schemes such as PISCO offer linear speedup in communication rounds relative to local computation capacity [2311.18787].

Table: Comparative Communication Overhead per Global Round

| Protocol                    | Uplinks per Round | D2D / Intra-Cluster | Aggregator/Server Uplink |
|-----------------------------|-------------------|---------------------|-------------------------|
| Centralized FL (FedAvg)     | K                 | -                   | 1                       |
| Decentralized (gossip)      | 0                 | $N_\mathrm{edges}$  | 0                       |
| SDFL (K clients, M clusters)| $K/M$             | ~K                  | $M$                     |

Empirical results show SDFL can attain parity or improvement in steady-state accuracy (10–25% lower RMSE and faster convergence) over FedAvg, while reducing per-node memory and peak bandwidth by up to 35% [2503.13624, 2509.03660].

## 6. Applications, Use-Cases, and System Implementations

SDFL models have been deployed in diverse contexts:

- **Edge IoT Systems:** Hierarchical SDFL (e.g., FedSR) efficiently trains deep models in Industrial IoT and sensor networks under strict privacy and bandwidth constraints, handling non-IID data splits and large-scale device populations [2403.14718].
- **Mobile Trajectory and Time-Series Applications:** FedDeCAB and derived methods provide robust time-series prediction for vehicle trajectories, marine vessel tracking, and similar large-scale, intermittently connected datasets [2509.03660].
- **Wireless Environments with Unreliable Links:** DNC-based coded SDFL and collaborative relaying address straggler and outage resilience in Rayleigh-fading models for massive wireless edge learning [2404.00780, 2406.19002, 2202.11850, 2205.10998].
- **Vertical Federated Learning:** MTCD enables communication-efficient vertical FL by tuning the relative frequencies of client–client and client–server updates, interpolating between star and peer-to-peer, and supporting O(1/T) convergence [2309.09977].
- **Real-Time and Edge-Scale FL:** MQTT-based SDFL frameworks (SDFLMQ) dynamically manage clusters, assign aggregator roles, and support large DNN partitioning for resource-constrained clients [2503.13624].
- **Trustworthy and Incentivized Collaboration:** Recent SDFL systems incorporate blockchain-based trust, auditing, and incentives to combat poisoning attacks and encourage quality participation [2602.08290, 2310.19287].

## 7. Limitations, Open Challenges, and Directions for Future Work

While SDFL models offer compelling advantages, multiple challenges remain:

- **Parameter Selection and System Tuning:** Optimal choices for cluster sizes, deadlines, aggregation periods ($\tau_1, \tau_2$), and code redundancy involve trade-offs between communication cost and convergence, often requiring adaptive or online optimization [2112.10313, 2103.10481, 2303.08988].
- **Scalability:** Blockchain and off-chain orchestration introduce additional storage and latency overhead, which may be addressed by batch finalization, Merkle-tree rollups, or hierarchical incentive mechanisms [2310.19287, 2602.08290].
- **Heterogeneity and Fairness:** Straggler and device heterogeneity, data non-IIDness, and intermittent connectivity require sophisticated trust-aware, staleness-adaptive scheduling and aggregation. Trust penalization can reduce diversity in participation, possibly slowing final convergence [2412.11448, 2602.08290].
- **Security:** Random leader (cluster head) selection is vulnerable to Sybil or malicious-node attacks; verifiable random functions and reputation-based selection are suggested for future defenses [2310.19287].
- **Empirical Validation:** Many incentive and trust-based SDFL designs remain theoretical, pending extensive evaluation on adversarial and real-world datasets with malicious participant scenarios [2602.08290].

Further research directions include adaptive topology assignment, integration with large-model optimization, deployment in fully peer-to-peer SDFL, and the synthesis of privacy-enhancing technologies with trust and incentive layers. The interplay of communication complexity, energy usage, and security remains a fertile area for both theoretical and system innovation.

Source: https://www.emergentmind.com/topics/semi-decentralized-federated-learning-sdfl