non-iid-data

Tag

Cards List
#non-iid-data

CALM: Class-wise Agreement and Label-gated Disagreement Modulation for Decentralized Federated Learning

arXiv cs.LG ↗ · 2026-09-10 Cached

CALM proposes a method for decentralized federated learning that uses class-wise agreement and label-gated disagreement modulation to handle non-IID data, improving teacher weighting and distillation trust without additional communication overhead.

0 favorites 0 likes
#non-iid-data

D-FROST: Decentralized Federated pRompt-tuning via Optimal tranSporT for Non-IID and Imbalanced Data

arXiv cs.LG ↗ · 2026-09-03 Cached

D-FROST introduces a decentralized federated prompt-tuning algorithm using optimal transport to address challenges with non-IID and imbalanced data, ensuring convergence and effectiveness for foundation models.

0 favorites 0 likes
#non-iid-data

FedImp: Enhancing Federated Learning Convergence with Impurity-Based Weighting

arXiv cs.LG ↗ · 2026-08-18 Cached

FedImp is a novel federated learning algorithm that uses impurity-based weighting to enhance convergence speed in non-IID data settings, showing significant reductions in communication rounds compared to baselines.

0 favorites 0 likes
#non-iid-data

FedLBW: A Loss-Based Weighting Strategy for Federated Learning on Non-IID Data in Wireless Networks

arXiv cs.AI ↗ · 2026-08-10 Cached

This paper proposes FedLBW, a federated learning aggregation strategy that weights client updates by inverse validation loss instead of dataset size, improving accuracy and robustness to non-IID data and client dropouts in wireless networks.

0 favorites 0 likes
#non-iid-data

DG-FedReuse: Proxy-Gradient-Gated Cached-Update Reuse with Matched Sparse Uplink Accounting

arXiv cs.LG ↗ · 2026-08-07 Cached

Presents DG-FedReuse, a federated learning mechanism that reuses age-decayed cached client updates under a proxy-gradient threshold to reduce uplink communication, achieving significant modeled savings with minimal accuracy loss on image classification benchmarks.

0 favorites 0 likes
← Back to home

Submit Feedback