Saved in:
Bibliographic Details
Main Authors: Chen, Jundong, Zhang, Honglei, Li, Haoxuan, Zhang, Chunxu, Li, Zhiwei, Li, Yidong
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2506.09525
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916790572941312
author Chen, Jundong
Zhang, Honglei
Li, Haoxuan
Zhang, Chunxu
Li, Zhiwei
Li, Yidong
author_facet Chen, Jundong
Zhang, Honglei
Li, Haoxuan
Zhang, Chunxu
Li, Zhiwei
Li, Yidong
contents Federated recommendation (FR) is a promising paradigm to protect user privacy in recommender systems. Distinct from general federated scenarios, FR inherently needs to preserve client-specific parameters, i.e., user embeddings, for privacy and personalization. However, we empirically find that globally aggregated item embeddings can induce skew in user embeddings, resulting in suboptimal performance. To this end, we theoretically analyze the user embedding skew issue and propose Personalized Federated recommendation with Calibration via Low-Rank decomposition (PFedCLR). Specifically, PFedCLR introduces an integrated dual-function mechanism, implemented with a buffer matrix, to jointly calibrate local user embedding and personalize global item embeddings. To ensure efficiency, we employ a low-rank decomposition of the buffer matrix to reduce the model overhead. Furthermore, for privacy, we train and upload the local model before personalization, preventing the server from accessing sensitive information. Extensive experiments demonstrate that PFedCLR effectively mitigates user embedding skew and achieves a desirable trade-off among performance, efficiency, and privacy, outperforming state-of-the-art (SOTA) methods.
format Preprint
id arxiv_https___arxiv_org_abs_2506_09525
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Beyond Personalization: Federated Recommendation with Calibration via Low-rank Decomposition
Chen, Jundong
Zhang, Honglei
Li, Haoxuan
Zhang, Chunxu
Li, Zhiwei
Li, Yidong
Cryptography and Security
Federated recommendation (FR) is a promising paradigm to protect user privacy in recommender systems. Distinct from general federated scenarios, FR inherently needs to preserve client-specific parameters, i.e., user embeddings, for privacy and personalization. However, we empirically find that globally aggregated item embeddings can induce skew in user embeddings, resulting in suboptimal performance. To this end, we theoretically analyze the user embedding skew issue and propose Personalized Federated recommendation with Calibration via Low-Rank decomposition (PFedCLR). Specifically, PFedCLR introduces an integrated dual-function mechanism, implemented with a buffer matrix, to jointly calibrate local user embedding and personalize global item embeddings. To ensure efficiency, we employ a low-rank decomposition of the buffer matrix to reduce the model overhead. Furthermore, for privacy, we train and upload the local model before personalization, preventing the server from accessing sensitive information. Extensive experiments demonstrate that PFedCLR effectively mitigates user embedding skew and achieves a desirable trade-off among performance, efficiency, and privacy, outperforming state-of-the-art (SOTA) methods.
title Beyond Personalization: Federated Recommendation with Calibration via Low-rank Decomposition
topic Cryptography and Security
url https://arxiv.org/abs/2506.09525