Federated Consistency- and Complementarity-aware Consensus-enhanced Recommendation

• URL: http://arxiv.org/abs/2509.22659v1
• Date: Wed, 27 Aug 2025 08:47:12 GMT
• Title: Federated Consistency- and Complementarity-aware Consensus-enhanced Recommendation
• Abstract summary: We propose a textbfFederated textbfConsistency- and textbfComplementarity-aware textbfConsensus-enhanced textbfRecommendation (Fed3CR) method for personalized FedRec.<n>Experiments on four real-world datasets represent the superior performance of Fed3CR.
• Score: 35.78577182946339
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Personalized federated recommendation system (FedRec) has gained significant attention for its ability to preserve privacy in delivering tailored recommendations. To alleviate the statistical heterogeneity challenges among clients and improve personalization, decoupling item embeddings into the server and client-specific views has become a promising way. Among them, the global item embedding table serves as a consensus representation that integrates and reflects the collective patterns across all clients. However, the inherent sparsity and high uniformity of interaction data from massive-scale clients results in degraded consensus and insufficient decoupling, reducing consensus's utility. To this end, we propose a \textbf{Fed}erated \textbf{C}onsistency- and \textbf{C}omplementarity-aware \textbf{C}onsensus-enhanced \textbf{R}ecommendation (Fed3CR) method for personalized FedRec. To improve the efficiency of the utilization of consensus, we propose an \textbf{A}daptive \textbf{C}onsensus \textbf{E}nhancement (ACE) strategy to learn the relationship between global and client-specific item embeddings. It enables the client to adaptively enhance specific information in the consensus, transforming it into a form that best suits itself. To improve the quality of decoupling, we propose a \textbf{C}onsistency- and \textbf{C}omplementarity-aware \textbf{O}ptimization (C2O) strategy, which helps to learn more effective and complementary representations. Notably, our proposed Fed3CR is a plug-and-play method, which can be integrated with other FedRec methods to improve its performance. Extensive experiments on four real-world datasets represent the superior performance of Fed3CR.

Related papers

• FedUTR: Federated Recommendation with Augmented Universal Textual Representation for Sparse Interaction Scenarios [58.33672784127872]
  Federated recommendations (FRs) have emerged as an on-device privacy-preserving paradigm.<n>We propose a novel method named FedUTR, which incorporates item textual representations as a complement to interaction behaviors.<n>Our method achieves superior performance, with improvements of up to 59% across all datasets compared to the SOTA baselines.
  arXiv  Detail & Related papers  (2026-01-29T08:55:19Z)
• Towards Federated Clustering: A Client-wise Private Graph Aggregation Framework [57.04850867402913]
  Federated clustering addresses the challenge of extracting patterns from decentralized, unlabeled data.<n>We propose Structural Privacy-Preserving Federated Graph Clustering (SPP-FGC), a novel algorithm that innovatively leverages local structural graphs as the primary medium for privacy-preserving knowledge sharing.<n>Our framework achieves state-of-the-art performance, improving clustering accuracy by up to 10% (NMI) over federated baselines while maintaining provable privacy guarantees.
  arXiv  Detail & Related papers  (2025-11-14T03:05:22Z)
• CO-PFL: Contribution-Oriented Personalized Federated Learning for Heterogeneous Networks [51.43780477302533]
  Contribution-Oriented PFL (CO-PFL) is a novel algorithm that dynamically estimates each client's contribution for global aggregation.<n>CO-PFL consistently surpasses state-of-the-art methods in robustness in personalization accuracy, robustness, scalability and convergence stability.
  arXiv  Detail & Related papers  (2025-10-23T05:10:06Z)
• A Model-agnostic Strategy to Mitigate Embedding Degradation in Personalized Federated Recommendation [34.915843795521134]
  We propose a novel model-agnostic strategy for FedRec to strengthen the personalized embedding utility.<n>PLGC is the first research in federated recommendation to alleviate the dimensional collapse issue.
  arXiv  Detail & Related papers  (2025-08-27T06:03:52Z)
• Far From Sight, Far From Mind: Inverse Distance Weighting for Graph Federated Recommendation [2.8449839307925955]
  Dist-FedAvg is a novel distance-based aggregation method designed to enhance personalization and aggregation efficiency in graph federated learning.<n>Our method assigns higher aggregation weights to users with similar embeddings, while ensuring that anchor users retain significant influence in local updates.
  arXiv  Detail & Related papers  (2025-07-02T01:57:58Z)
• Client-Centric Federated Adaptive Optimization [78.30827455292827]
  Federated Learning (FL) is a distributed learning paradigm where clients collaboratively train a model while keeping their own data private.<n>We propose Federated-Centric Adaptive Optimization, which is a class of novel federated optimization approaches.
  arXiv  Detail & Related papers  (2025-01-17T04:00:50Z)
• Co-clustering for Federated Recommender System [33.70723179405055]
  Federated Recommender System (FRS) offers a solution that strikes a balance between providing high-quality recommendations and preserving user privacy. The presence of statistical heterogeneity in FRS, commonly observed due to personalized decision-making patterns, can pose challenges. We propose CoFedRec, a novel Co-clustering Federated Recommendation mechanism.
  arXiv  Detail & Related papers  (2024-11-03T21:32:07Z)
• 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)
• Personalized Federated Knowledge Graph Embedding with Client-Wise Relation Graph [49.66272783945571]
  We propose Personalized Federated knowledge graph Embedding with client-wise relation graph. PFedEG learns personalized supplementary knowledge for each client by amalgamating entity embedding from its neighboring clients. We conduct extensive experiments on four benchmark datasets to evaluate our method against state-of-the-art models.
  arXiv  Detail & Related papers  (2024-06-17T17:44:53Z)
• Beyond Similarity: Personalized Federated Recommendation with Composite Aggregation [22.359428566363945]
  Federated recommendation aims to collect global knowledge by aggregating local models from massive devices. Current methods mainly leverage aggregation functions invented by federated vision community to aggregate parameters from similar clients. We propose a personalized Federated recommendation model with Composite Aggregation (FedCA)
  arXiv  Detail & Related papers  (2024-06-06T10:17:52Z)
• APGL4SR: A Generic Framework with Adaptive and Personalized Global Collaborative Information in Sequential Recommendation [86.29366168836141]
  We propose a graph-driven framework, named Adaptive and Personalized Graph Learning for Sequential Recommendation (APGL4SR) APGL4SR incorporates adaptive and personalized global collaborative information into sequential recommendation systems. As a generic framework, APGL4SR can outperform other baselines with significant margins.
  arXiv  Detail & Related papers  (2023-11-06T01:33:24Z)
• FedRec+: Enhancing Privacy and Addressing Heterogeneity in Federated Recommendation Systems [15.463595798992621]
  FedRec+ is an ensemble framework for federated recommendation systems. It enhances privacy and reduces communication costs for edge users. Experimental results demonstrate the state-of-the-art performance of FedRec+.
  arXiv  Detail & Related papers  (2023-10-31T05:36:53Z)

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.