This paper develops a federated EM algorithm for unsupervised learning of mixture models.
problem Theoretical foundations of unsupervised federated learning are lacking.
method Introduces a federated gradient EM algorithm (FedGrEM) for unsupervised learning of mixture models.
result Theoretical analysis shows FedGrEM outperforms local single-task learning.
EM algorithm speeds up convergence in federated learning with heterogenous data.
problem Understanding convergence rates of federated learning algorithms under data heterogeneity.
method Characterized convergence rate of EM algorithm for FMLR model under various regimes.
result EM algorithm converges to ground truth with SNR ≥ √K in all regimes.
Federated learning is viewed as a hierarchical latent variable model for new algorithm development.
problem Training models privately across multiple clients while maintaining privacy and efficiency.
method Viewing federated learning as a hierarchical latent variable model and applying Expectation-Maximization (EM) algorithm.
result Proposes FedSparse, a federated learning algorithm that promotes sparsity and reduces communication and inference costs.
Federated MTL learns personalized models under mixed distributions.
problem Heterogeneity of local data distributions leads to poor global model performance.
method Proposes federated MTL under mixture of distributions, using penalized optimization and federated EM-like algorithms.
result Models with higher accuracy and fairness than state-of-the-art methods.
New algorithms improve Gaussian mixture model estimation in DFL with heterogeneous data.
problem Bias in EM algorithm for Gaussian mixtures in DFL with heterogeneous data.
method MNEM and semi-MNEM algorithms integrating historical and partially labeled data.
result MNEM and semi-MNEM achieve asymptotic efficiency and improved convergence.
New uncertainty principle limits compression in distributed learning, suggesting optimal methods.
problem Minimizing communication cost while maintaining message quality in distributed learning.
method Formalized uncertainty principle for compression operators, introduced Kashin compression.
result Explicit formula for Kashin compression's variance bound, dimension independent.
The paper improves EM for clustering in a mixture of linear regression models.
problem Improving EM for clustering in a mixture of linear regression models with clustered data.
method Employed Expectation-Maximization (EM) method to estimate parameters from dependent samples.
result EM on structured data requires only O(1) iterations for statistical accuracy, compared to O(log(mn/d)) for unstructured data.
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.
Two algorithms improve federated learning efficiency and resilience.
problem Scalability issues in federated learning due to communication, privacy, and Byzantine attacks.
method Proposes two algorithms, Ada-StoSign and β β β -StoSign, that compress gradients into bit vectors to reduce communication. result Ada-StoSign converges with a rate of O ( log T / T + 1 / M ) O(\log T/\sqrt{T} + 1/\sqrt{M}) O ( log T / T + 1/ M ) and outperforms existing methods. FL's early training phase significantly impacts final test accuracy.
problem Understanding how early phases affect FL's final test accuracy.
method Generalized Fisher Information Matrix (FedFIM) to FL.
result FL exhibits critical learning periods where small errors can have large impacts.
A novel algorithm reduces communication costs in federated best arm identification.
problem Identifying the best arm in a federated multi-armed bandit setup with minimal communication cost.
method Proposes a novel algorithm called FedElim that communicates only in exponential time steps.
result Demonstrates that communication is almost cost-free in FedElim, with a total cost at most 3 times the maximum under its variant.
Compressed Federated Distillation reduces communication in federated learning.
problem Communication constraints in Federated Learning.
method Compressed Federated Distillation (CFD) leverages soft labels and quantization techniques.
result Reduces communication by more than 4 orders of magnitude compared to Federated Averaging.
Adaptive optimizers improve federated learning performance.
problem Inadequate optimization methods in federated learning.
method Federated versions of adaptive optimizers (Adagrad, Adam, Yogi).
result Adaptive optimizers enhance federated learning performance.
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.
FedIV uses federated GMM for IV analysis in non-i.i.d. data.
problem Efficient IV analysis in non-i.i.d. federated data.
method Federated GMM via FedGDA algorithm.
result Federated solution consistently estimates local moment conditions.
A practical one-shot federated learning algorithm for cross-silo setting.
problem Limited applicability of existing one-shot federated learning algorithms due to specific model support and lack of privacy guarantees.
method FedKT, a one-shot federated learning algorithm that supports any classification models and provides differential privacy guarantees.
result FedKT significantly outperforms other state-of-the-art federated learning algorithms with a single communication round.
Paper introduces OARF benchmark suite for federated learning systems.
problem Limited diversity in federated learning benchmarks.
method Characterizes OARF benchmark suite with diverse data and applications.
result Federated learning can effectively increase end-to-end throughput.
New federated f f f -differential privacy for collaborative learning.
problem Privacy in federated learning.
method Introducing federated f f f -differential privacy and proposing a generic private federated learning framework. result Proves federated f f f -differential privacy provides privacy guarantee on each record of one client's data. New algorithm solves federated minimax optimization problems.
problem Federated minimax optimization challenges.
method Federated Stochastic Smoothed Gradient Descent Ascent (FESS-GDA).
result FESS-GDA uniformly solves federated minimax problems.
A framework to compare federated learning algorithms in high-dimensional settings.
problem Comparing the performance of federated learning algorithms in high-dimensional settings.
method Formulating federated learning as a multi-criterion objective and analyzing a linear regression model.
result Federated Averaging with simple client fine-tuning achieves the same asymptotic risk as more intricate approaches and outperforms without personalization.
Study reveals adversarially robust domain adaptation is harder to generalize across domains.
problem Hardness of transferring adversarial robustness across different domains.
method Analysis of adversarial Rademacher complexity over symmetric difference hypothesis space.
result Adversarial Rademacher complexity is always greater than non-adversarial, indicating intrinsic hardness.
Federated learning has been a hot research topic in enabling the collaborative training of machine learning models among different organizations under the privacy restrictions. As researchers try to support more machine learning models with different privacy-preserving approaches, there is a requirement in developing s…
pFedGame uses game theory for decentralized federated learning in dynamic networks.
problem Performance bottlenecks, data bias, model convergence issues, and model poisoning attacks in federated learning.
method pFedGame employs game theory to decentralize federated learning, avoiding a central aggregation server and addressing dynamic network challenges.
result pFedGame achieves higher accuracy (over 70%) in heterogeneous data compared to existing methods.
This paper analyzes privacy threats in federated matrix factorization.
problem Privacy threats in federated matrix factorization models.
method Categorizes federated matrix factorization into three types and analyzes privacy threats.
result This is the first study of privacy threats in federated matrix factorization.
Research improves federated text models for next word prediction.
problem Training models on distributed devices efficiently and effectively.
method Employ transfer learning in federated learning for next word prediction.
result Enhancements to current baselines with pretrained embeddings and whole model pretraining.
Federated learning method improves covariate shift adaptation for missing target values.
problem Missing target values in federated learning.
method Federated covariate shift adaptation algorithm for missing target output values.
result Asymptotically unbiased and efficient algorithm for federated learning.
In federated learning, a central server coordinates the training of a single model on a massively distributed network of devices. This setting can be naturally extended to a multi-task learning framework, to handle real-world federated datasets that typically show strong statistical heterogeneity among devices. Despite…
This work improves fairness in federated learning by using zero-shot data augmentation.
problem Statistical heterogeneity leads to biased and less uniform accuracy across clients in federated learning.
method Proposes a federated learning system with zero-shot data augmentation to mitigate statistical heterogeneity and improve fairness.
result Empirical results show improved test accuracy and fairness across clients.
A fair reward system boosts participation in federated learning.
problem Fairness in federated learning among competitive agents with siloed data.
method Hierarchically fair federated learning (HFFL) framework with proportional rewards based on contribution levels.
result Efficacy of HFFL in maintaining fairness and facilitating federated learning in competitive settings.
Federated learning studies separate client data and distribution gaps.
problem Understanding performance differences in federated learning across different datasets.
method Proposed a framework to disentangle out-of-sample and participation gaps.
result Dataset synthesis strategy is crucial for realistic simulations of federated learning generalization.
Federated multi-view matrix factorization learns from multiple data sources without centralizing user data.
problem Cold-start federated recommendations and multi-view data structure.
method Federated learning framework extended to multi-view matrix factorization.
result Federated multi-view matrix factorization outperforms simpler methods in cold-start federated recommendations.
Federated learning linked to mean-field games for large-scale learning.
problem Large-scale distributed and privacy-preserving learning algorithms.
method Established a connection between federated learning and mean-field games, presenting federated learning as a differential game.
result Properties of the equilibrium of the federated learning game were discussed.
A new federated learning method reduces communication costs and improves adaptivity.
problem Large communication overhead and lack of adaptivity in federated learning.
method FedCAMS: A novel communication-efficient adaptive federated learning method with theoretical guarantees.
result FedCAMS achieves the same convergence rate as non-compressed federated learning methods.
New perspective on federated learning as posterior inference, improving optimization.
problem Optimizing global models in distributed learning settings.
method Formulated as posterior inference problem, using MCMC for approximate inference and federated averaging for refinement.
result Federated posterior averaging (FedPA) outperforms existing methods on benchmarks.
FedSPDnet improves federated learning for SPD matrices, outperforming existing methods.
problem Federated learning for SPD matrices with orthogonality constraints.
method Two efficient aggregation strategies: ProjAvg and RLAvg, preserving geometric structure.
result FedSPDnet outperforms federated EEGnet in F1 score and robustness to federation and partial participation.
Novel algorithm resists Byzantine attacks in federated learning for PCA and LRCS.
problem Byzantine attacks in federated learning for PCA and LRCS.
method Subspace-Median algorithm for federated PCA, altGDmin for LRCS.
result Provably Byzantine-resilient communication-efficient and sample-efficient algorithms.
Sherpa.ai framework combines federated learning and differential privacy for edge AI services.
problem Protecting data privacy in edge AI services.
method Holistic federated learning and differential privacy approach with methodological guidelines.
result Demonstrated through classification and regression use cases.
Federated learning technique improves convergence speed with communication delays.
problem Communication delays between edge nodes and aggregator in federated learning.
method Developed FedDelAvg, a technique that generalizes federated averaging to incorporate a weighting between current local model and delayed global model.
result FedDelAvg achieves a significant improvement in convergence speed, especially when optimizing the weighting scheme to account for delays.
Federated Learning is introduced to protect privacy by distributing training data into multiple parties. Each party trains its own model and a meta-model is constructed from the sub models. In this way the details of the data are not disclosed in between each party. In this paper we investigate the model interpretation…
FedForest adapts RF for federated learning, improving performance and efficiency.
problem Adapting RF for federated learning with heterogeneous data.
method FedForest uses a novel splitting procedure to aggregate client statistics, allowing non-parametric personalization.
result FedForest's federated RF achieves performance close to centralized models while being communication-efficient.
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³/²).
Dynamic defense against Byzantine poisoning in federated learning.
problem Byzantine poisoning attacks on federated learning models.
method Dynamic federated aggregation operator to filter out adversarial clients.
result Dynamic selection of clients improves global learning model performance.
Modern federated networks, such as those comprised of wearable devices, mobile phones, or autonomous vehicles, generate massive amounts of data each day. This wealth of data can help to learn models that can improve the user experience on each device. However, the scale and heterogeneity of federated data presents new …
New study tackles free-rider attacks in federated learning models.
problem Free-rider attacks compromise federated learning models by non-contributing to data updates.
method Theoretical and experimental analysis of iterative federated learning schemes, including FedAvg and FedProx.
result Formal guarantees for free-rider attacks to converge to aggregated models of fair participants.
New federated learning framework reduces model complexity and improves performance.
problem Slow convergence in traditional federated learning due to non-i.i.d. data.
method Clients train personalized local models, server trains shared model, addressing heterogeneity.
result Substantial performance gains over baselines, robust to non-i.i.d. data.
This paper improves federated learning for industrial predictive analytics by accommodating client heterogeneity.
problem Traditional federated models assume homogeneity in degradation processes, which doesn't apply to industrial settings.
method Personalized federated prognostic model using proximal gradient descent algorithm for joint parameter estimation.
result The proposed model enhances performance and provides comprehensive failure time distributions.
This review synthesizes missing data imputation across diverse fields.
problem Missing data hinders analysis across various disciplines.
method Systematic review of imputation methods and their application across domains.
result Critical challenges and future directions identified.
New federated learning methods improve model performance on non-IID data.
problem Improving model performance on non-IID decentralized data.
method Proposed Federated AGMs using adaptive gradient methods with first-order and second-order momenta.
result The proposed Federated AGMs converge to a first-order stationary point under non-IID and unbalanced data settings for nonconvex optimization.