Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

3897771,1661,554 · Jun 202019922001200920172026
48 results for personalized federated learning

Adaptive personalized federated learning improves local model personalization.

problem Maximizing global model performance limits local model personalization.
method APFL algorithm trains local models while contributing to global model, with optimal mixing parameter and communication-efficient optimization.
result Demonstrates effectiveness of personalization schema and correctness of generalization theories.

A new federated multi-armed bandit framework with personalization balances generalization and personalization.

problem Balancing generalization and personalization in federated multi-armed bandits.
method Proposed a Personalized Federated Upper Confidence Bound (PF-UCB) algorithm to achieve a O(log(T))O(\log(T)) regret.
result PF-UCB achieves an O(log(T))O(\log(T)) regret regardless of personalization degree and has similar instance dependency to lower bound.

Unified proof for scalable personalized federated learning.

problem Personalized federated learning under asynchronous updates.
method Unified proof for asynchronous federated learning with bounded staleness applied to MAML and ME personalization frameworks.
result Unified proof for convergence to first-order stationary point for smooth and non-convex functions.

This paper analyzes the trade-off between accuracy and communication in personalized federated learning.

problem The accuracy-communication trade-off in personalized federated learning.
method The paper provides a quantitative characterization of the personalization degree on the trade-off, establishing minimax optimality.
result The paper offers theoretical insights for choosing the personalization degree and validates the results on synthetic and real-world datasets.

Personalized federated learning for diverse client objectives.

problem Training a single global model across diverse local datasets is not optimal.
method Efficiently calculates optimal weighted model combinations for each client based on their specific objectives.
result Our method outperforms existing alternatives and enables new personalized features.

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.

This paper improves federated learning by selecting between global and personalized models based on uncertainty.

problem Inherent heterogeneity and diverse data distributions in federated learning.
method Introduces a new approach to federated learning that models predictive uncertainties to select between global and personalized models.
result The model performs better on out-of-distribution data and on par with state-of-the-art personalized federated learning algorithms in standard scenarios.

Personalized federated learning improves model accuracy and fairness by leveraging shared representations and local memorization.

problem Sub-optimal performance of federated learning when client data distributions are heterogeneous.
method Proposes a personalization mechanism based on local memorization of shared representations from a collectively trained global model.
result Significantly higher accuracy and fairness compared to state-of-the-art methods.

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.

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.

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.

FedSplit improves federated learning for heterogeneous data.

problem Data heterogeneity in federated learning degrades convergence and performance.
method FedSplit splits data into shared and personalized groups, optimizing a novel objective function.
result FedSplit converges faster and performs better than standard federated learning.

The emerging paradigm of federated learning strives to enable collaborative training of machine learning models on the network edge without centrally aggregating raw data and hence, improving data privacy. This sharply deviates from traditional machine learning and necessitates the design of algorithms robust to variou…

2019-12-02abs ↗pdf ↗

A novel Federated Learning scheme using Optimal Transport for personalized model training.

problem Training models with data from clients having non-identically distributed data.
method Personalized Federated Learning scheme based on Optimal Transport (FedOT).
result FedOT scheme effectively transfers data from multiple distributions to a common domain and optimizes the prediction model.

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.

Federated learning is a distributed, on-device computation framework that enables training global models without exporting sensitive user data to servers. In this work, we describe methods to extend the federation framework to evaluate strategies for personalization of global models. We present tools to analyze the eff…

2019-10-22abs ↗pdf ↗

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.

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.

A new Federated Learning approach balances personalization and global training.

problem Breaking the curse of data heterogeneity in Federated Learning.
method Splitting variables into global and local parameters, using a simple algorithm.
result The approach allows each client to fit their data perfectly, breaking the curse of data heterogeneity.

LP-FT improves personalized model training in FL by balancing generalization and personalization.

problem Federated Learning struggles with balancing global generalization and local personalization due to non-identical data distributions.
method Adapting Linear Probing followed by full Fine-Tuning (LP-FT) to the FL setting.
result LP-FT outperforms standard fine-tuning in balancing personalization and generalization across various datasets and PFT variants.

Boosting-inspired framework for federated learning with progressive model personalization.

problem Statistical heterogeneity across clients in federated learning.
method Construct an ensemble of personalized models, progressively increasing the depth of the personalized component while controlling its effective complexity.
result Consistently outperforms state-of-the-art PFL methods under heterogeneous data distributions.

Group personalization improves FL performance in heterogeneous client data.

problem Mitigating client drift in federated learning with heterogeneous data.
method Fine-tuning a global FL model over homogeneous groups of clients, then personalizing each group's model.
result The proposed method achieves superior personalization performance compared to other FL approaches.

Proposes SROF for row-wise fusion in federated learning for multivariate responses.

problem Heterogeneous client models with shared variable-level structure.
method Sparse Row-wise Fusion (SROF) regularizer and RowFed algorithm.
result Empirically shows consistent error reduction and stronger variable-level cluster recovery.

pFedMe uses Moreau envelopes to improve personalized FL performance.

problem Statistical diversity among clients limits FL performance.
method pFedMe employs Moreau envelopes as clients' regularized loss functions in a bi-level optimization problem.
result pFedMe achieves state-of-the-art convergence rates and superior empirical performance.

FGPR uses averaging and SGD for federated GP\mathcal{GP} regression, excelling in personalization and multi-fidelity modeling.

problem Privacy-preserving multi-fidelity data modeling and personalization.
method Federated Gaussian process framework with averaging and SGD for local computations.
result FGPR converges to a critical point of the full log-likelihood function, excels in personalization and multi-fidelity modeling.

Collaborative personalization, such as through learned user representations (embeddings), can improve the prediction accuracy of neural-network-based models significantly. We propose Federated User Representation Learning (FURL), a simple, scalable, privacy-preserving and resource-efficient way to utilize existing neur…

2019-09-27abs ↗pdf ↗

Unified approach to federated learning improves robustness and personalization.

problem Real-world federated learning challenges like non-IID data and outliers.
method Fed+ methods that unify federated learning algorithms for better robustness and personalization.
result Convergence guarantees for Fed+ on convex and non-convex loss functions under various aggregation methods.

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.

Study improves privacy in cross-silo federated learning by personalizing data.

problem Privacy concerns in cross-silo federated learning.
method Introduced sample-level differential privacy for silos, analyzed mean-regularized multi-task learning.
result Mean-regularized multi-task learning is a strong baseline for cross-silo federated learning under stronger privacy requirements.

pFedGP uses Gaussian processes for personalized federated learning with improved kernel learning.

problem Learning personalized models across clients with limited data.
method pFedGP uses Gaussian processes with deep kernel learning, including a shared neural network kernel and inducing points.
result pFedGP achieves well-calibrated predictions and significantly outperforms baseline methods.

Paper analyzes minimax risks of personalized federated learning algorithms.

problem Statistical heterogeneity among clients in federated learning.
method Minimax analysis of FedAvg and local training approaches.
result Threshold for optimality between FedAvg and local training depends on data heterogeneity.

FiT combines transfer and meta-learning for efficient few-shot image classification.

problem Few-shot image classification in personalized and federated learning settings.
method Combines transfer learning and meta-learning with fixed pretrained backbones and fine-tuned FiLM adapter layers.
result Achieves state-of-the-art accuracy on VTAB-1k benchmark with fewer than 1% of updateable parameters.

A new algorithm optimizes local objectives in federated learning with heterogeneous clients.

problem Optimizing local objectives in federated learning with heterogeneous client data.
method Proposes PF-PNE algorithm with double elimination strategy.
result PF-PNE algorithm optimizes local objectives with arbitrary heterogeneity and protects client data confidentiality.

FedLog reduces communication in federated learning by sharing data summaries.

problem Significant communication overhead in federated learning with large model parameters.
method Shares minimal sufficient statistics via Bayesian inference and differential privacy.
result High learning accuracy with low communication overhead.

SPIRE enables efficient federated learning for diffusion models by separating client-specific embeddings from a shared backbone.

problem Large diffusion models are impractical for federated learning due to their size.
method SPIRE separates the network into a global backbone and client-specific embeddings, enabling efficient finetuning.
result SPIRE achieves parameter-efficient finetuning, updating only a small fraction of weights.

PFedRL-Rep learns shared and personalized policies for heterogeneous environments.

problem Poor performance of single policy in heterogeneous environments.
method Develops PFedRL-Rep framework with shared feature representation and personalized weights.
result Proves linear convergence speedup with respect to the number of agents.

A federated graph learning approach improves EV charging demand forecasting while protecting against cyberattacks.

problem Cybersecurity risk and data heterogeneity in EV charging demand forecasting.
method Federated Graph Neural Network (GNN) model with global attention mechanism and credit-based function.
result Enhanced robustness and prediction accuracy in EV charging demand forecasting.

FLIX simplifies federated learning with efficient communication.

problem Handling constraints specific to federated learning.
method Introduces FLIX, a new framework for federated learning that addresses communication and personalization challenges.
result FLIX achieves dissimilarity regularization similar to local methods without requiring local steps.

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.