Sharpness-Aware Minimization for Generalized Embedding Learning in Federated Recommendation
- URL: http://arxiv.org/abs/2603.11503v1
- Date: Thu, 12 Mar 2026 03:43:25 GMT
- Title: Sharpness-Aware Minimization for Generalized Embedding Learning in Federated Recommendation
- Abstract summary: We propose a new federated recommendation framework, named Federated Recommendation with Generalized Embedding Learning (FedRecGEL)<n>We reformulate the federated recommendation problem from an item-centered perspective and cast it as a multi-task learning problem, aiming to learn generalized embeddings throughout the training procedure. Based on theoretical analysis, we employ sharpness-aware minimization to address the generalization problem, thereby stabilizing the training process and enhancing recommendation performance.
- Score: 22.07748662145589
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Federated recommender systems enable collaborative model training while keeping user interaction data local and sharing only essential model parameters, thereby mitigating privacy risks. However, existing methods overlook a critical issue, i.e., the stable learning of a generalized item embedding throughout the federated recommender system training process. Item embedding plays a central role in facilitating knowledge sharing across clients. Yet, under the cross-device setting, local data distributions exhibit significant heterogeneity and sparsity, exacerbating the difficulty of learning generalized embeddings. These factors make the stable learning of generalized item embeddings both indispensable for effective federated recommendation and inherently difficult to achieve. To fill this gap, we propose a new federated recommendation framework, named Federated Recommendation with Generalized Embedding Learning (FedRecGEL). We reformulate the federated recommendation problem from an item-centered perspective and cast it as a multi-task learning problem, aiming to learn generalized embeddings throughout the training procedure. Based on theoretical analysis, we employ sharpness-aware minimization to address the generalization problem, thereby stabilizing the training process and enhancing recommendation performance. Extensive experiments on four datasets demonstrate the effectiveness of FedRecGEL in significantly improving federated recommendation performance. Our code is available at https://github.com/anonymifish/FedRecGEL.
Related papers
- UniER: A Unified Benchmark for Item-level and Path-level Exercise Recommendation [53.62147575168325]
We present a Unified Benchmark for Exercise Recommendation (UniER)<n>UniER is a comprehensive evaluation framework that unifies ILER and PLER.<n>Our results reveal the systematic dominance of PLER and expose the pedagogical failure of ILER's fragmented recommendations.
arXiv Detail & Related papers (2026-05-16T02:07:58Z) - ERASE -- A Real-World Aligned Benchmark for Unlearning in Recommender Systems [53.62904488040001]
We present ERASE, a large-scale benchmark for machine unlearning in recommender systems.<n> ERASE spans three core tasks -- collaborative filtering, session-based recommendation, and next-basket recommendation.<n>It includes unlearning scenarios inspired by real-world applications, such as sequentially removing sensitive interactions or spam.
arXiv Detail & Related papers (2026-03-09T13:00:23Z) - FedRD: Reducing Divergences for Generalized Federated Learning via Heterogeneity-aware Parameter Guidance [24.601588520875023]
Heterogeneous federated learning (HFL) aims to ensure effective and privacy-preserving collaboration among different entities.<n>The problem of generalizing federated learning models to unseen clients under heterogeneous data has become progressively crucial.<n>We propose FedRD, a novel Heterogeneous Federated Learning algorithm that collaboratively utilizes parameter-guided global generalization aggregation and local debiased classification to reduce divergences.
arXiv Detail & Related papers (2026-01-28T09:03:06Z) - Efficient and Robust Regularized Federated Recommendation [52.24782464815489]
The recommender system (RSRS) addresses both user preference and privacy concerns.
We propose a novel method that incorporates non-uniform gradient descent to improve communication efficiency.
RFRecF's superior robustness compared to diverse baselines.
arXiv Detail & Related papers (2024-11-03T12:10:20Z) - FedSlate:A Federated Deep Reinforcement Learning Recommender System [18.641244204682536]
Reinforcement learning methods have been used to optimize long-term user engagement in recommendation systems.<n>One potential solution is to aggregate data from various platforms in a centralized location and use the aggregated data for training.<n>This approach raises economic and legal concerns, including increased communication costs and potential threats to user privacy.<n>We propose textbfFedSlate, a federated reinforcement learning recommendation algorithm that effectively utilizes information that is prohibited from being shared at a legal level.
arXiv Detail & Related papers (2024-09-23T10:10:24Z) - Exploring Federated Unlearning: Review, Comparison, and Insights [101.64910079905566]
federated unlearning enables the selective removal of data from models trained in federated systems.<n>This paper examines existing federated unlearning approaches, examining their algorithmic efficiency, impact on model accuracy, and effectiveness in preserving privacy.<n>We propose the OpenFederatedUnlearning framework, a unified benchmark for evaluating federated unlearning methods.
arXiv Detail & Related papers (2023-10-30T01:34:33Z) - Combating Exacerbated Heterogeneity for Robust Models in Federated
Learning [91.88122934924435]
Combination of adversarial training and federated learning can lead to the undesired robustness deterioration.
We propose a novel framework called Slack Federated Adversarial Training (SFAT)
We verify the rationality and effectiveness of SFAT on various benchmarked and real-world datasets.
arXiv Detail & Related papers (2023-03-01T06:16:15Z) - SIFU: Sequential Informed Federated Unlearning for Efficient and Provable Client Unlearning in Federated Optimization [23.064896326146386]
Machine Unlearning (MU) aims at removing the contribution of a given data point from a training procedure.
While Federated Unlearning (FU) methods proposed, we propose SIFU (Sequential Informed Unlearning) as a new method.
arXiv Detail & Related papers (2022-11-21T17:15:46Z) - Cali3F: Calibrated Fast Fair Federated Recommendation System [25.388324221293203]
We propose a personalized federated recommendation system training algorithm to improve recommendation performance fairness.
We then adopt a clustering-based aggregation method to accelerate the training process.
Cali3F is a calibrated fast and fair federated recommendation framework.
arXiv Detail & Related papers (2022-05-26T03:05:26Z) - Federated Residual Learning [53.77128418049985]
We study a new form of federated learning where the clients train personalized local models and make predictions jointly with the server-side shared model.
Using this new federated learning framework, the complexity of the central shared model can be minimized while still gaining all the performance benefits that joint training provides.
arXiv Detail & Related papers (2020-03-28T19:55:24Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.