Client adaptation improves federated learning performance with non-IID data.
problem Improving model performance in federated learning with non-identically and non-independently distributed data.
method Simulates heterogeneous clients to learn client-specific conditioning using a conditional gated activation unit.
result Client adaptation enhances model performance across balanced and imbalanced data sets from audio and image domains.
This paper proposes a cooperative mechanism for mitigating the performance degradation due to non-independent-and-identically-distributed (non-IID) data in collaborative machine learning (ML), namely federated learning (FL), which trains an ML model using the rich data and computational resources of mobile clients with…
Study finds non-IID data causes FL performance issues.
problem Reduced performance in federated learning due to non-IID data.
method Investigated from IID to non-IID settings, categorized methods into two strategies.
result Inconsistencies in client loss landscapes are the primary cause of performance degradation.
Paper proposes FedAMP for improved federated learning with non-IID data.
problem Challenges of federated learning with non-IID data.
method FedAMP: Federated attentive message passing for pairwise client collaborations.
result FedAMP improves federated learning performance with non-IID data.
Quantum federated learning improves with non-IID data using one-shot communication.
problem Performance degradation in federated learning with non-IID data.
method Quantum algorithms and local density estimators for non-IID data.
result One-shot communication complexity for non-IID quantum federated learning.
FedACS uses attention to select clients with similar data for federated learning.
problem Non-IID data and data scarcity in federated learning.
method FedACS integrates an attention mechanism to prioritize clients with similar data distributions.
result FedACS improves federated learning performance by addressing non-IID data and data scarcity.
Clust-PSI-PFL uses PSI to improve accuracy and fairness in federated learning.
problem Non-IID data biases federated learning performance.
method Clust-PSI-PFL uses clustering and PSI to form homogeneous groups of clients.
result Clust-PSI-PFL delivers up to 18% higher global accuracy and improves client fairness.
DPMM-CFL clusters clients for federated learning without fixed K, improving performance.
problem Improving federated learning performance under non-IID client heterogeneity.
method DPMM-CFL uses a Dirichlet Process Mixture Model to infer both cluster number and client assignments.
result DPMM-CFL optimizes per-cluster federated objectives and jointly infers cluster number and assignments.
Survey classifies Clustered Federated Learning into three types of approaches.
problem Non-independent and identically distributed (non-IID) data in Federated Learning.
method Systematic review of CFL literature, principled taxonomy.
result Core CFL and Metadata-based approaches have distinct focuses.
This study assesses the impact of non-IID data in federated learning, revealing significant performance drops.
problem The impact of non-IID data on federated learning model performance.
method Empirical analysis using Hellinger Distance to measure distribution differences, benchmarking four strategies for handling non-IID data.
result Significant performance drops occur at specific HD thresholds, especially for extreme non-IIDness.
IDA adapts to non-iid data in federated learning for medical imaging.
problem Statistical heterogeneity in federated learning data, especially in medical imaging.
method IDA (Inverse Distance Aggregation) is a novel adaptive weighting approach for clients based on meta-information.
result IDA outperforms Federated Averaging in handling unbalanced and non-iid data in federated learning.
LotteryFL improves federated learning efficiency and personalization.
problem Statistical heterogeneity and communication efficiency in federated learning.
method Exploiting Lottery Ticket hypothesis to learn compact lottery networks.
result LotteryFL achieves better personalization and reduces communication cost.
Unified Bayesian framework for clustered federated learning improves model performance.
problem Handling non-IID client data in federated learning.
method A unified Bayesian framework for clustered federated learning that associates clients to clusters and proposes practical algorithms for data associations.
result The proposed framework increases model performance by circumventing the need for unique client-cluster associations.
Semi-Federated Learning clusters clients for efficient model training.
problem Efficiency and data distribution challenges in Federated Learning.
method Local clustering and in-cluster training with a sequential training manner.
result Semi-Federated Learning reduces communication costs and improves robustness to Non-IID data.
This paper tackles federated incremental learning with dynamic memory allocation for improved model performance in non-IID data.
problem Catastrophic forgetting in federated healthcare systems with non-IID data.
method Dynamic memory allocation strategy based on data replay mechanism.
result Significant performance improvements in medical image datasets compared to baseline models.
A new algorithm improves federated learning by combining knowledge distillation and weighted combination loss.
problem Non-IID client data in federated learning leads to model drift and poor generalization.
method pFedKD-WCL integrates knowledge distillation with bi-level optimization to address non-IID challenges.
result pFedKD-WCL outperforms state-of-the-art algorithms in accuracy and convergence speed.
FL+HC improves federated learning on non-iid data by clustering local updates.
problem FL struggles with non-iid data, leading to suboptimal models.
method Introduce hierarchical clustering to separate and train clusters of clients independently.
result FL+HC converges faster and achieves higher accuracy than standard FL.
This work improves federated learning privacy and accuracy with non-private data sharing and approximate gradient coding.
problem Challenges of non-IID data and stragglers in federated learning.
method Data-driven strategy combining offline data sharing and approximate gradient coding.
result Achieves a trade-off between privacy and utility, leading to improved model convergence and accuracy.
Federated multi-mini-batch improves efficiency in non-IID environments.
problem Performance and communication efficiency challenges in federated learning with non-IID data.
method Introduces federated multi-mini-batch approach to balance performance and communication.
result Federated multi-mini-batch outperforms federated averaging in non-IID settings.
FedSmart optimizes federated learning models for non-IID data.
problem Model performance on non-IID data is poor and privacy is at risk.
method FedSmart optimizes models by sharing global gradients and adjusting weights based on local validation set accuracy.
result FedSmart improves model performance by allocating more weight to similar data distributions.
New method addresses class imbalance in federated learning.
problem Class imbalance in federated learning training data.
method Proposes a monitoring scheme to infer training data composition and a new loss function, Ratio Loss, to mitigate imbalance.
result Demonstrates effectiveness in mitigating class imbalance in federated learning, outperforming previous methods.
This work addresses a new problem that learns generative adversarial networks (GANs) from multiple data collections that are each i) owned separately by different clients and ii) drawn from a non-identical distribution that comprises different classes. Given such non-iid data as input, we aim to learn a distribution in…
A federated method for feature selection in multi-label data.
problem Feature selection in multi-label data for distributed and federated environments.
method Semi-Supervised Federated Multi-Label Feature Selection (SSFMLFS) using fuzzy information measures.
result SSFMLFS outperforms other methods in feature selection for multi-label data in federated settings.
Study proposes BFEL framework for privacy-preserving FL in personalized healthcare.
problem Privacy and security concerns in traditional cloud-centric ML, especially in wearable devices.
method Develops a blockchain-enhanced federated edge learning (BFEL) framework based on FedCurv, incorporating fisher information matrix and public key encryption.
result Significant reduction in communication cost and high efficiency for federated training on non-iid and heterogeneous data.
PTOPOFL uses topological descriptors to protect privacy in federated learning.
problem Privacy and data reconstruction attacks in federated learning.
method PTOPOFL replaces gradient communication with persistent homology feature vectors for privacy and topology-guided aggregation.
result PTOPOFL achieves higher AUC and reduces reconstruction risk compared to gradient sharing.
A framework for federated adversarial learning with convergence analysis.
problem Unique vulnerabilities to adversarial attacks in federated learning.
method Formulates a general federated adversarial learning framework with inner and outer loops for client-side adversarial training and server-side model aggregation.
result The minimum loss under the proposed algorithm can converge to ε with chosen learning rate and communication rounds.
Federated Learning allows multiple parties to jointly train a deep learning model on their combined data, without any of the participants having to reveal their local data to a centralized server. This form of privacy-preserving collaborative learning however comes at the cost of a significant communication overhead du…
This paper surveys techniques to personalize federated learning models.
problem Personalized models outperform shared models for some clients, reducing participation.
method Surveys recent research on personalizing federated learning models.
result Personalization techniques improve model performance for individual clients.
Federated Averaging (FedAvg) has emerged as the algorithm of choice for federated learning due to its simplicity and low communication cost. However, in spite of recent research efforts, its performance is not fully understood. We obtain tight convergence rates for FedAvg and prove that it suffers from `client-drift' w…
Federated learning enables resource-constrained edge compute devices, such as mobile phones and IoT devices, to learn a shared model for prediction, while keeping the training data local. This decentralized approach to train models provides privacy, security, regulatory and economic benefits. In this work, we focus on …
FLANDERS detects and blocks extreme model poisoning in federated learning.
problem Resilience against large-scale model poisoning attacks in federated learning.
method FLANDERS treats client updates as matrix-valued time series and identifies outliers using autoregressive forecasting.
result FLANDERS significantly improves robustness in federated learning across various attacks.
New methods handle both data and network heterogeneity in federated learning.
problem Challenges in federated learning due to data and network heterogeneity.
method Two novel client selection schemes that minimize theoretical runtime to convergence.
result Our methods are at least competitive to and up to 20 times better than existing baselines.
GraphFL tackles semi-supervised node classification on graphs using federated learning.
problem Real-world graph-based problems often require collecting the entire graph and labeling a reasonable number of labels, which is impractical and costly.
method GraphFL is a federated learning framework that addresses non-IID data, new label domains, and unlabeled data issues in graph-based semi-supervised node classification.
result GraphFL significantly outperforms compared FL baselines and self-training methods.
Federated learning (FL) enables on-device training over distributed networks consisting of a massive amount of modern smart devices, such as smartphones and IoT (Internet of Things) devices. However, the leading optimization algorithm in such settings, i.e., federated averaging (FedAvg), suffers from heavy communicatio…
Theoretical study explains why federated optimization fails to achieve perfect fitting.
problem Performance degradation in federated optimization under data heterogeneity.
method Assumption of distinct local optima due to client data heterogeneity.
result The global objective has a lower bound that prevents perfect fitting of all client data.
New algorithm achieves linear speedup in non-i.i.d. federated bilevel learning.
problem Linear speedup in convergence for non-i.i.d. datasets in federated bilevel optimization.
method Proposes FedMBO with a novel client sampling scheme for non-i.i.d. datasets.
result Achieves a convergence rate of O(1/√(nK) + 1/K + √n/K³/²).
Federated learning can be vulnerable to adversarial attacks, which this work addresses.
problem Federated learning's adversarial vulnerability when deployed.
method Bias-Variance decomposition for federated learning, proposing Fed_BVA framework.
result Fed_BVA framework generates adversarial examples to improve robustness.
New federated learning algorithms improve model aggregation robustness.
problem Improving model aggregation in federated learning.
method Complete mathematical convergence analysis and novel aggregation algorithms.
result Derived novel algorithms that modify model architecture based on client contributions.
A new federated learning method clusters users into multiple models for better data distribution handling.
problem Non-IID data from heterogeneous sources in federated learning.
method Proposes a multi-center aggregation mechanism to learn multiple global models and optimally match users to centers.
result Our method outperforms existing federated learning methods on benchmark datasets.
WassFFed addresses fairness in Federated Learning by ensuring consistency between local and global models.
problem Achieving fairness in Federated Learning where data is distributed among diverse user groups.
method WassFFed employs a Wasserstein barycenter calculation to aggregate local models' outputs, ensuring consistency and fairness.
result WassFFed outperforms existing approaches in balancing accuracy and fairness.
STL-SGD accelerates Local SGD by gradually increasing communication periods.
problem Reducing communication complexity in distributed SGD.
method Gradually increasing communication periods while decreasing learning rate.
result Significant reduction in communication complexity with improved convergence rates.
FedAUX improves Federated Learning by better using unlabeled data.
problem Improving Federated Learning performance with unlabeled data.
method FedAUX modifies FD training by unsupervised pre-training and private certainty scoring.
result FedAUX outperforms state-of-the-art Federated Learning methods.
Federated Learning (FL) enables learning a shared model across many clients without violating the privacy requirements. One of the key attributes in FL is the heterogeneity that exists in both resource and data due to the differences in computation and communication capacity, as well as the quantity and content of data…
We certify federated learning model performance under meta-distribution shifts.
problem Certifying model performance on unseen networks with heterogeneous distributions.
method Derive worst-case uniform guarantees for federated learning model's average loss and risk CDF.
result Asymptotically minimax optimal and privacy-preserving certification.
SA-PEF improves federated learning efficiency by correcting gradient mismatches.
problem Slow decay of residual error in federated learning under non-IID data.
method Integrates step-ahead correction with partial error feedback.
result Achieves faster convergence and target accuracy compared to standard EF.
FedGradNorm improves federated MTL by balancing task learning speeds.
problem Statistical and data heterogeneity in federated MTL.
method Dynamic-weighting normalization of gradient norms.
result FedGradNorm achieves faster training performance and balanced datasets.
FedCD improves non-IID federated learning performance.
problem Learning from non-IID data in federated learning.
method FedCD dynamically groups devices with similar data.
result FedCD achieves higher accuracy and faster convergence.
FedFMC improves federated learning on non-iid data without sharing data or increasing communication costs.
problem Efficiently updating a global model on non-iid data in federated learning.
method FedFMC dynamically forks devices into different global models, merges and consolidates them.
result FedFMC substantially improves upon earlier approaches to non-iid data in federated learning.