REVIEW 29 cited by
Adaptive Personalized Federated Learning
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Investigation of the degree of personalization in federated learning algorithms has shown that only maximizing the performance of the global model will confine the capacity of the local models to personalize. In this paper, we advocate an adaptive personalized federated learning (APFL) algorithm, where each client will train their local models while contributing to the global model. We derive the generalization bound of mixture of local and global models, and find the optimal mixing parameter. We also propose a communication-efficient optimization method to collaboratively learn the personalized models and analyze its convergence in both smooth strongly convex and nonconvex settings. The extensive experiments demonstrate the effectiveness of our personalization schema, as well as the correctness of established generalization theories.
Forward citations
Cited by 29 Pith papers
-
Clipping Makes Distributed and Federated Asynchronous SGD Robust to Stragglers
Gradient clipping eliminates the dependence on maximum delay in the oracle complexity of asynchronous SGD, yielding convergence in expectation and high probability under sub-Weibull gradient noise.
-
Collaborative Yet Personalized Policy Training: Single-Timescale Federated Actor-Critic
A federated actor-critic framework lets agents share a linear subspace representation for policies while maintaining personalized local actors and critics, achieving critic error and policy gradient convergence rates ...
-
FedOBP: Federated Optimal Brain Personalization through Cloud-Edge Element-wise Decoupling
FedOBP introduces a quantile-thresholded importance score based on a federated first-order Taylor approximation to select a small set of parameters for personalization, claiming better performance than prior PFL methods.
-
Unlocking Multi-Site Clinical Data: A Federated Approach to Privacy-First Child Autism Behavior Analysis
A two-layer privacy system using skeletal abstraction and federated learning enables multi-site training for child autism behavior recognition and outperforms standard federated baselines on the MMASD benchmark.
-
On the Convergence Rates of Federated Q-Learning across Heterogeneous Environments
Federated Q-learning in heterogeneous environments achieves linear speedup in K agents for sampling error but is limited to Θ(E/T) convergence when averaging every E steps, with a two-phase error decay-then-rise behav...
-
FeDepth: Federated Learning for Depth Estimation under Robot Heterogeneity
FeDepth assigns each robot client to multiple clusters using frozen-encoder descriptors and Jeffreys divergence, improving federated depth estimation over hard-clustering baselines in the HPE scenario while performing...
-
Tuning-Free Efficient Estimation for Multi-Source Data via Covariance-Aware Shrinkage
Proposes a covariance-aware tuning-free shrinkage framework and sequential algorithm for multi-source estimation that attains oracle risk asymptotically and improves on single-step methods.
-
Range Penalization: Theoretical Insights with Applications in Federated Learning
Introduces range penalization for federated linear models that identifies shared weights and performs polar clustering on personalized features, supported by new nonasymptotic proofs and a fast optimization algorithm.
-
Closing the Alignment-Maturity Gap in Federated Prototype Learning
FedSAP stabilizes federated prototype learning via a deterministic alignment curriculum and proxy separation loss, reporting up to 4 percentage point gains under high heterogeneity across three benchmarks.
-
COSMOS: Model-Agnostic Personalized Federated Learning with Clustered Server Models and Pseudo-Label-Only Communication
COSMOS clusters clients via pseudo-label predictions on public data, trains cluster-specific server models, and distills them to clients, claiming exponential personalization risk contraction and outperforming model-a...
-
COSMOS: Model-Agnostic Personalized Federated Learning with Clustered Server Models and Pseudo-Label-Only Communication
COSMOS performs model-agnostic personalized federated learning via server-side clustering on pseudo-label predictions and distillation of cluster models, claiming exponential personalization risk contraction.
-
Personalized Digital Health Modeling with Adaptive Support Users
A framework for personalizing digital health models by jointly learning adaptive weights on support users, using similarity-weighted transfer from similar users and contrastive regularization from dissimilar users to ...
-
Personalized Digital Health Modeling with Adaptive Support Users
A new framework trains personal digital health models using adaptive weights on support users including dissimilar ones, achieving up to 25% lower RMSE in low-data settings.
-
A Taxonomy and Resolution Strategy for Client-Level Disagreements in Federated Learning
A taxonomy of client-level disagreements in federated learning is presented together with a multi-track resolution strategy that enforces strict exclusion via isolated update paths, shown to handle permanent, temporal...
-
Reasoning on the Manifold: Bidirectional Consistency for Self-Verification in Diffusion Language Models
Bidirectional Manifold Consistency (BMC) is a geometric, training-free metric that quantifies stability of reasoning trajectories in diffusion LLMs to enable self-verification, rejection sampling, and alignment withou...
-
Collaborative and Efficient Fine-tuning: Leveraging Task Similarity
CoLoRA shares a low-rank adapter pair across users plus a small personal matrix, improving fine-tuning for similar tasks and providing a recovery guarantee.
-
Federated Multi-Task Clustering
FMTC learns personalized clustering models on clients and uses server-side tensor low-rank regularization to capture shared structure across heterogeneous clients in a privacy-preserving federated setting.
-
Fed-REACT: Federated Representation Learning for Heterogeneous and Evolving Data
Fed-REACT first trains a shared encoder, then repeatedly clusters clients by smoothed task-model weights, improving federated learning accuracy on heterogeneous, non-stationary time series.
-
A Model-agnostic Strategy to Mitigate Embedding Degradation in Personalized Federated Recommendation
PLGC combines NTK-weighted local-global item embedding mixing with a Barlow Twins-style redundancy reduction loss to lessen embedding degradation in personalized federated recommendation.
-
Flexible Personalized Split Federated Learning for On-Device Fine-Tuning of Foundation Models
FlexP-SFL fine-tunes foundation models on resource-constrained devices through personalized split learning without parameter aggregation, improving accuracy and cutting wall-clock time and communication versus federat...
-
COSMOS: Model-Agnostic Personalized Federated Learning with Clustered Server Models and Pseudo-Label-Only Communication
COSMOS personalizes federated learning across heterogeneous client models via server-side clustering and distillation using only pseudo-labels, with claimed exponential personalization risk contraction.
-
Separate Aggregation of Split Network for Personalized Federated Learning
PGFedSplit improves client-specific performance and global generalization in heterogeneous federated learning via split architectures, adaptive aggregation, and local-plus-synthetic representation mixing.
-
FIRMA: FIbonacci Ring Model Aggregation for Privacy-preserving Federated Learning
FIRMA introduces Fibonacci ring aggregation protocols for server-free federated learning that maintain private heads and achieve higher accuracy than FedAvg under label skew across multiple benchmarks and heterogeneit...
-
Fed-BAC: Federated Bandit-Guided Additive Clustering in Hierarchical Federated Learning
Fed-BAC uses contextual bandits and Thompson Sampling with additive clustering to deliver up to 35.5 percentage point accuracy gains and 1.5-4.8x faster convergence in hierarchical federated learning on non-IID data.
-
Fine-Tuning Impairs the Balancedness of Foundation Models in Long-tailed Personalized Federated Learning
Fine-tuning impairs the class balance of foundation models in long-tailed personalized federated learning, which FedPuReL addresses through gradient purification using zero-shot predictions and residual-based personal...
-
Reasoning on the Manifold: Bidirectional Consistency for Self-Verification in Diffusion Language Models
Bidirectional Manifold Consistency measures geometric stability of dLLM trajectories and is claimed to indicate reasoning correctness for diagnosis, rejection sampling, and reward-based alignment.
-
FedRio: Personalized Federated Social Bot Detection via Cooperative Reinforced Contrastive Adversarial Distillation
FedRio is a new federated framework that outperforms standard federated baselines in social bot detection accuracy and efficiency while staying competitive with centralized models under stronger privacy constraints.
-
A Survey on Foundation Models for Personalized Federated Intelligence
The survey introduces personalized federated intelligence (PFI) as a framework integrating federated learning and foundation models to support privacy-aware personalization of AI models.
-
Knowledge Distillation in Federated Learning: a Survey on Long Lasting Challenges and New Solutions
A survey organizing knowledge distillation techniques for addressing privacy, heterogeneity, communication, and personalization challenges in federated learning.
Discussion (0). Sign in to comment.