New tools study curvature measures of convex bodies, revealing structured spaces.
problem Investigate translation invariant curvature measures of convex bodies.
method Introduce new tools to study curvature measures, proving conjectures about their structure.
result Space of curvature measures has length at most 2 as a representation of the general linear group in degrees 0 and n-2.
FedCM measures contributions in real-time for federated learning.
problem Fairly allocating contributions in federated learning systems.
method FedCM calculates impact based on current and previous rounds with attention aggregation.
result FedCM is more sensitive to data quality and quantity in real-time.
Proposes a privacy-preserving system for federated learning of road networks.
problem Privacy and security of data shared between vehicles and infrastructure.
method Federated learning over V2V and V2N links, non-IID dataset modeling.
result Improves learning performance and prevents eavesdropping.
Energy distance measures feature heterogeneity in federated learning.
problem Heterogeneity across data sources hinders model aggregation in federated learning.
method Introduced Taylor approximations of energy distance for efficient computation.
result Taylor approximations accurately capture feature discrepancies, improving convergence.
Study federates measurement of demographic disparities from quantile sketches.
problem Misalignment of fairness goals with siloed data collection and privacy regulations.
method Federated auditing of demographic parity through score distributions, using Wasserstein--Frechet variance and quantile summaries.
result Proposes a one-shot, communication-efficient protocol to estimate global disparity and its decomposition.
DFFL tackles federated learning with heterogeneous objectives and constraints.
problem Federated learning with clients having different objectives and feasible regions.
method Derived heterogeneity bounds for cost-vector distances and support-function/shape-distance terms. Lifted pointwise bounds to local-versus-federated excess-risk comparison.
result Federation is beneficial when the statistical advantage of pooling exceeds a client-specific heterogeneity penalty.
Federated Learning enables visual models to be trained in a privacy-preserving way using real-world data from mobile devices. Given their distributed nature, the statistics of the data across these devices is likely to differ significantly. In this work, we look at the effect such non-identical data distributions has o…
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…
Ditto improves fairness and robustness in federated learning.
problem Fairness and robustness in statistically heterogeneous federated learning networks.
method Personalized federated learning framework (Ditto) with a scalable solver.
result Ditto achieves competitive performance and superior fairness and robustness compared to existing methods.
Federated Machine Learning (FML) creates an ecosystem for multiple parties to collaborate on building models while protecting data privacy for the participants. A measure of the contribution for each party in FML enables fair credits allocation. In this paper we develop simple but powerful techniques to fairly calculat…
A new hybrid federated learning algorithm for combining clinical and omics data.
problem Combining clinical and omics data in federated learning settings.
method Reformulated Kernel Regularized Least Squares algorithm for hybrid federated learning.
result Validation of two variants of the hybrid algorithm on well-established datasets.
Fed-FEARE model extracts rules from multiple agencies' data securely.
problem Data privacy and secure rule extraction across multiple agencies.
method Federated F-score based ensemble tree model.
result Model performance measures significantly improved with federated learning.
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 UCBVI reduces communication costs while minimizing regret in multi-agent settings.
problem Minimizing regret in federated learning with heterogeneous agents.
method Federated Upper Confidence Bound Value Iteration (Fed-UCBVI) algorithm.
result Regret bound scales as i l d e O ( H 3 ∣ S ∣ ∣ A ∣ T / M ) ilde{\mathcal{O}}(\sqrt{H^3 |\mathcal{S}| |\mathcal{A}| T / M}) i l d e O ( H 3 ∣ S ∣∣ A ∣ T / M ) with small additional term due to heterogeneity. New algorithm reduces federated learning rounds and improves privacy.
problem Inefficient synchronous federated learning causing scalability issues.
method Asynchronous federated learning with reduced communication and differential privacy via Gaussian noise.
result The algorithm reduces waiting times and network communication, making federated learning more scalable and private.
FedGTEA learns new tasks in federated learning with task embeddings and alignment.
problem Federated class-incremental learning with task-specific knowledge and model uncertainty.
method Cardinality-Agnostic Task Encoder (CATE) for Gaussian task embeddings, 2-Wasserstein distance for inter-task alignment.
result FedGTEA achieves superior classification performance and mitigates forgetting.
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.
Federated learning leaks participant dataset quality even with secure aggregation.
problem Leakage of participant dataset quality in federated learning with secure aggregation.
method Image recognition experiments to infer and attribute dataset quality.
result Relative quality ordering of participants can be inferred and used for various purposes.
This paper evaluates and compares gradient leakage attacks in federated learning.
problem Gradient leakage attacks compromise client privacy in federated learning.
method Formal and experimental analysis of gradient leakage attacks, evaluation of attack effectiveness and cost.
result Gradient leakage attacks can reconstruct private local training data from shared parameter updates.
FedRD improves risk difference estimation in federated learning for clinical outcomes.
problem Privacy-preserving model co-training in medical research is hindered by server-dependent architectures and focus on relative effect measures.
method FedRD is a server-independent, communication-efficient framework for federated risk difference estimation in distributed survival data.
result FedRD provides valid confidence intervals and hypothesis testing, and is asymptotically equivalent to pooled individual-level analysis.
In this article, we initiate a geometric measure theoretic approach to symplectic Hodge theory. In particular, we apply one of the central results in geometric measure theory, the Federer-Fleming deformation theorem, together with the cohomology theory of normal cur- rents on a differential manifold, to establish a fun…
Personalized federated learning adapts models to each user's data.
problem Training models across users without data exchange leads to a common model, not personalized.
method Develops a personalized federated learning approach using Model-Agnostic Meta-Learning (MAML).
result Personalized models can be adapted by a few gradient descent steps on local data.
Graph-based multimodal federated learning for HAR improves accuracy and privacy.
problem Challenges in HAR due to noisy data, incomplete measurements, and privacy concerns.
method Proposes GraMFedDHAR, a Graph-based Multimodal Federated Learning framework for HAR tasks, using modality-specific graphs, residual GCNs, and attention-based fusion.
result Experimental results show up to 13 percent performance improvement for MultiModalGCN under differential privacy constraints.
This work analyzes aggregation strategies for Bayesian deep learning models in federated learning.
problem Improper aggregation of Bayesian deep learning models in federated learning leads to sub-optimal performance.
method Six aggregation strategies for Bayesian deep learning models are analyzed using CIFAR-10 dataset and a fully variational ResNet-20 architecture.
result Aggregation strategy is a key hyperparameter affecting accuracy, calibration, uncertainty quantification, training stability, and client compute requirements.
We extend the Besicovitch-Federer projection theorem to transversal families of mappings. As an application we show that on a certain class of Riemann surfaces with constant negative curvature and with boundary, there exist natural 2-dimensional measures invariant under the geodesic flow having 2-dimensional supports s…
A federated learning algorithm tackles unknown contexts in multi-arm bandits.
problem Learning optimal actions in federated multi-arm bandits with unobserved contexts.
method Elimination-based algorithm for linearly parametrized reward functions.
result Proved regret bound for linearly parametrized reward functions.
FUALA improves Federated Learning for EHR data, enhancing model uncertainty.
problem Applying ML to EHR data while maintaining privacy and accuracy.
method FUALA embeds uncertainty in federated learning, using ensembling and averaging.
result FUALA outperforms FedAvg on out-of-distribution data in EHR model predictions.
Hierarchical Federated Learning bounds generalize using Wasserstein distance.
problem Bounding generalization error in Federated Learning with hierarchical sampling.
method Introduced a hierarchical sampling framework and derived generalization bounds using Wasserstein distance.
result Recover and strictly imply existing CMI bounds for bounded losses.
Federated Granger causality learns reliable interactions without sharing data.
problem Uncertainty in federated Granger causality estimates.
method Closed-form covariance recursions and spectral-radius-based convergence conditions.
result Uncertainty depends only on client data statistics and is independent of model parameters.
FedAMD framework improves federated learning with partial client participation.
problem Data heterogeneity and inactive client updates in partial client participation.
method Anchor sampling divides clients into anchor and miner groups, using large and small batches respectively.
result FedAMD achieves faster convergence and improved model performance compared to state-of-the-art methods.
MTFL improves UA and speeds convergence in personalised DNNs on edge devices.
problem Non-IID user data harms FL convergence and global UA is not always the goal.
method Introduces non-federated BN layers into federated DNNs for personalised training.
result MTFL reduces UA rounds by up to 5x and convergence time by up to 3x.
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.
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.
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.
Study addresses covariate mismatch in federated learning, improving model accuracy.
problem Learning from clients with different feature sets in federated learning.
method Developed two approaches for linear prediction under covariate mismatch: plug-in estimator and impute-then-regress strategy.
result Proposed methods provide asymptotic and finite-sample learning rates, improving model accuracy.
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 tackles concept drift in Federated Learning, improving model performance.
problem Concept drift in real-world data makes existing Federated Learning methods ineffective.
method Introduces a multiscale algorithm combining extit{FedAvg} and extit{FedOMD} with non-stationary detection and adaptation.
result Achieves dynamic regret of $\Tilde{\mathcal{O}} ( \min \{ \sqrt{LT} , Δ^{\frac{1}{3}}T^{\frac{2}{3}} + \sqrt{T} \})$ for T T T rounds. 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.
Adaptive kernel approach learns causal effects from diverse data sources.
problem Learning causal effects from multiple, decentralized data sources in a federated setting.
method Adaptive transfer algorithm using Random Fourier Features to estimate similarities and disentangle loss function components.
result Empirically outperforms baselines on decentralized data sources with different distributions.
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.
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…
Paper analyzes FedAvg and FedProx, showing they don't reach global optima and may not generalize well.
problem Federated Learning algorithms fail to reach global optima and may not generalize well in heterogeneous settings.
method Non-parametric regression in RKHS, analyzing convergence and error rates.
result FedAvg and FedProx achieve optimal error rates in certain heterogeneous settings.
This work analyzes generalization in federated learning using information theory.
problem Generalization performance in federated learning is less explored compared to centralized learning.
method The work applies an information-theoretic analysis via the conditional mutual information (CMI) framework to study federated learning's two-level generalization.
result The work derives multiple CMI-based bounds, including hypothesis-based CMI bounds and fast-rate evaluated CMI bounds, which improve convergence rates for specific model aggregation strategies and structured loss functions.
Study compares federated learning and coreset approaches for privacy in distributed machine learning.
problem Measuring privacy in distributed machine learning approaches.
method Comparison of federated learning and coreset approaches using membership inference attack.
result Federated learning offers better privacy than coreset, but with higher communication cost.