New algorithm for federated learning with non-smooth regularizers.
problem Federated Learning with non-smooth composite optimization problems.
method Proposed Federated Dual Averaging (FedDualAvg) algorithm to overcome convergence issues.
result FedDualAvg outperforms other algorithms in federated composite optimization.
This dissertation advances the theoretical foundation of local optimization methods in Federated Learning.
problem Theoretical understanding of local optimization methods in Federated Learning is lacking.
method The dissertation proposes and analyzes new methods to improve convergence rates and communication efficiency in Federated Learning.
result Sharp bounds and convergence rates for FedAvg are established, and new methods like FedAc and Federated Dual Averaging are proposed.
This paper advances FL algorithms for composite optimization and statistical recovery.
problem Federated learning optimization and statistical recovery in composite settings.
method Proposes Fast Federated Dual Averaging for strongly convex and smooth loss, and Multi-stage Federated Dual Averaging for restricted strongly convex and smooth loss.
result Establishes state-of-the-art iteration and communication complexity, and high probability complexity bound with linear speedup.
New FL framework handles non-i.i.d data without strong assumptions.
problem Non-identically independent distributed (non-i.i.d) data in federated learning.
method Proposes a new algorithm design strategy from primal-dual optimization.
result Achieves optimal communication efficiency and communication complexity.
FedMA improves federated learning for neural nets, matching and averaging model elements.
problem Federated learning's communication burden and model performance.
method Layer-wise construction of shared model by matching and averaging hidden elements.
result FedMA outperforms state-of-the-art algorithms on deep CNN and LSTM architectures.
Efficient federated algorithm for calculating transportation barycenter.
problem Efficiently calculating the free-support transportation barycenter in a federated setting.
method Single-loop dual decomposition algorithm that uses only aggregated information.
result Significantly scalable and low-complexity algorithm for federated computation.
Partial model averaging improves Federated Learning performance.
problem Periodic model averaging causes significant model discrepancy in Federated Learning.
method Proposes a partial model averaging framework that encourages local models to stay close to each other.
result Partial averaging achieves up to 2.2% higher validation accuracy than full averaging.
Paper analyzes and compares ELF algorithms for federated learning.
problem Improving efficiency and privacy in federated learning.
method Proposes P-ELF, D-ELF, and B-ELF algorithms with primal, dual, and bidirectional compression.
result Provides non-asymptotic convergence guarantees under Log-Sobolev inequality.
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.
FedSGM tackles constrained federated learning with unified framework.
problem Functional constraints, communication bottlenecks, local updates, and partial client participation in federated learning.
method Unified framework based on switching gradient method, incorporating bi-directional error feedback, and soft switching for stability.
result Achieves O ( 1 / T ) \boldsymbol{\mathcal{O}}(1/\sqrt{T}) O ( 1/ T ) convergence rate with high-probability bounds decoupling from sampling noise. This paper analyzes the convergence of Federated Average under relaxed assumptions.
problem Lack of theoretical analysis for Federated Average under assumptions beyond smoothness.
method Relaxing assumptions of strong smoothness to semi-smoothness and semi-Lipschitz properties, and introducing a bound on the gradient.
result Provides a theoretical convergence study on Federated Learning under new assumptions.
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.
FeDualEx tackles saddle point optimization in federated learning with composite objectives.
problem Saddle point optimization with constraints and non-smooth regularization in federated learning.
method Federated Dual Extrapolation (FeDualEx) algorithm for saddle point optimization and composite objectives.
result FeDualEx effectively solves saddle point optimization problems with composite objectives in federated learning.
Scaff-PD improves fairness and robustness in federated learning with reduced communication.
problem Improving fairness and robustness in federated learning with limited communication.
method Scaff-PD uses a family of distributionally robust objectives and an accelerated primal dual algorithm with bias-corrected steps.
result Scaff-PD achieves significant gains in communication efficiency and convergence speed while maintaining fairness and robustness.
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.
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.
We propose a practical approach based on federated learning to solve out-of-domain issues with continuously running embedded speech-based models such as wake word detectors. We conduct an extensive empirical study of the federated averaging algorithm for the "Hey Snips" wake word based on a crowdsourced dataset that mi…
This work improves Q-learning for average-reward MDPs, reducing sample and communication complexities in federated settings.
problem Improving sample complexity of Q-learning for average-reward MDPs.
method Simple Q-learning algorithm with carefully chosen parameters for both single-agent and federated scenarios.
result Established first federated Q-learning algorithm for average-reward MDPs with provable efficiency in sample and communication complexities.
Paper improves Bayesian inference in federated learning with new algorithm VR-FALD*.
problem Bayesian inference in federated learning with communication bottlenecks and statistical heterogeneity.
method Federated Averaging Langevin Dynamics (FALD) and VR-FALD*.
result VR-FALD* corrects client drift due to statistical heterogeneity, improving convergence.
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.
Federated learning is a distributed framework according to which a model is trained over a set of devices, while keeping data localized. This framework faces several systems-oriented challenges which include (i) communication bottleneck since a large number of devices upload their local updates to a parameter server, a…
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.
FedAvg converges linearly to global minimum in federated learning with partial participation.
problem Challenges in federated learning with partial client participation.
method Federated averaging (FedAvg) method for over-parameterized neural networks.
result FedAvg converges to global minimum at a linear rate after t iterations.
New algorithm reduces communication in federated learning.
problem Communication inefficiency in distributed federated learning.
method Distributionally Robust Federated Averaging (DRFA) with snapshotting scheme.
result DRFA achieves efficient convergence in various settings.
Sharp bounds established for Federated Averaging (FedAvg), improving convergence rates.
problem Undetermined convergence rate of Federated Averaging (FedAvg) in Federated Learning.
method Developed novel iterate bias concept and proved sharp bounds on it, leading to improved convergence results.
result Lower bounds for FedAvg match existing upper bounds, showing no improvable capacity.
Unified analysis of Federated Averaging and Nesterov FedAvg for linear speedup.
problem Understanding convergence of FL algorithms under non-i.i.d. data and partial participation.
method Systematic study of convergence guarantees for FedAvg and Nesterov FedAvg under different conditions.
result Unified analysis of linear speedup for FedAvg and Nesterov FedAvg in various settings.
FA-HMC improves Bayesian federated learning with rigorous guarantees.
problem Parameter estimation and uncertainty quantification in non-iid distributed data.
method Federated Averaging stochastic Hamiltonian Monte Carlo (FA-HMC) with convergence guarantees.
result FA-HMC achieves better convergence and communication efficiency than existing methods.
Faster convergence in federated learning for non-convex problems.
problem Accelerating convergence in federated learning for non-convex models.
method Reformulated federated learning as gradient-based method with biased gradients, proving convergence for non-convex problems and proposing an accelerated algorithm.
result Proved federated averaging algorithm converges for non-convex problems and proposed an accelerated federated learning algorithm with convergence guarantee.
A federated learning framework using superquantile aggregation for robust performance across heterogeneous data.
problem Robust predictive performance across clients with heterogeneous data.
method Superquantile-based learning objective and stochastic training algorithm with differential privacy.
result Proves finite time convergence guarantees and demonstrates competitive performance with tail statistics improvement.
Federated learning enables training collaborative machine learning models at scale with many participants whilst preserving the privacy of their datasets. Standard federated learning techniques are vulnerable to Byzantine failures, biased local datasets, and poisoning attacks. In this paper we introduce Adaptive Federa…
FedAc accelerates Federated Averaging for distributed optimization.
problem Efficiently optimizing distributed machine learning models.
method Federated Accelerated Stochastic Gradient Descent (FedAc) using a potential-based perturbed iterate analysis.
result FedAc achieves faster convergence and lower communication costs than previous methods.
Combines ADMM and VB for federated learning.
problem Improving federated learning performance.
method Derives ADMM variants from VB with flexible covariances and functional regularisation.
result Improves federated learning performance through new ADMM variants.
New method improves convergence in federated learning for nonconvex problems.
problem Optimizing global objective in distributed learning with non-i.i.d. data.
method Generalized local stochastic and full gradient descent with periodic averaging.
result Demonstrates convergence rates for nonconvex federated optimization.
Paper analyzes \FedAvg's convergence and introduces a new algorithm to reduce bias.
problem Analyzing convergence and bias in Federated Averaging.
method Markov property, first-order bias expansion, Richardson-Romberg extrapolation.
result Bias in \FedAvg can be decomposed into noise and client heterogeneity components.
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.
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.
A new method for federated learning with only positive labels.
problem Learning with only positive labels leads to poor classifier performance.
method Federated Averaging with Spreadout (FedAwS) framework.
result FedAwS can almost match the performance of conventional learning with negative labels.
This paper examines federated learning from an information-theoretic perspective.
problem Understanding the conditions under which averaging model parameters in federated learning is beneficial.
method Measuring mutual information between representations and inputs/labels in local models and comparing it to the averaged model.
result Empirical results confirm the practical usefulness of averaging for neural networks, even with varying local dataset distributions.
Federated Q-learning achieves linear speedup with heterogeneity, improving sample complexity.
problem Collaborative learning in distributed RL settings with limited data sharing.
method Analyzes synchronous and asynchronous federated Q-learning, proposes importance averaging.
result Achieves linear speedup with heterogeneity, robust to local trajectory heterogeneity.
FedHDPrivacy uses DP to improve FL in IoT, maintaining high accuracy.
problem Privacy threats in FL, especially in IoT environments.
method Integrates DP with neuro-symbolic computing, actively monitoring and adjusting noise.
result Maintains high performance in manufacturing monitoring, surpassing other FL methods.
SCAFFOLD improves Federated Learning by reducing client-drift and speeding up convergence.
problem Federated Learning's performance is limited by client-drift in heterogeneous data.
method SCAFFOLD uses control variates to correct client-drift and improve convergence.
result SCAFFOLD requires fewer communication rounds and is not affected by data heterogeneity.
FA-LD algorithm improves uncertainty quantification and mean predictions in federated learning.
problem Uncertainty quantification and mean predictions in federated learning with distributed clients.
method FA-LD algorithm for strongly log-concave distributions with non-i.i.d data, considering general models.
result The FA-LD algorithm provides theoretical guarantees for convergence and optimal noise injection.
New federated method preserves privacy and estimates treatment effects.
problem Privacy-preserving causal inference for multi-site studies.
method Multiply robust nuisance function estimation, transfer learning.
result Efficient and optimal treatment effect estimation under different scenarios.
DFedAvgM is a decentralized FedAvg with momentum for privacy and communication efficiency.
problem Efficiently train models with privacy and communication efficiency in federated learning.
method Decentralized Federated Averaging with Momentum (DFedAvgM) on clients connected by an undirected graph, using stochastic gradient descent with momentum and quantization.
result DFedAvgM converges under trivial assumptions and can be improved with the PŁ property, numerically verified.
A scalable protocol for federated averaging with privacy and correctness guarantees.
problem Privacy and correctness in federated learning from multiple parties.
method Scalable protocol using correlated and independent Gaussian noise, analyzed for differential privacy and graph topology.
result Nearly matches trusted curator model's utility with minimal communication.
We present one-shot federated learning, where a central server learns a global model over a network of federated devices in a single round of communication. Our approach - drawing on ensemble learning and knowledge aggregation - achieves an average relative gain of 51.5% in AUC over local baselines and comes within 90.…
FedGP uses GANs to generate private data samples in federated learning.
problem Privacy-preserving data release in federated learning.
method FedGP employs generative adversarial networks (GANs) with FedAvg for privacy-preserving data generation.
result FedGP generates high-quality labelled data that can train and validate supervised models securely.
The theory of differential characters is developed completely from a de Rham - Federer viewpoint. Characters are defined as equivalence classes of special currents, called sparks, which appear naturally in the theory of singular connections. There are many different spaces of currents which yield the character groups. …