FedHUR: Learning Hierarchical Utility-Guided Client Relations for Personalized Federated Recommendation

• URL: http://arxiv.org/abs/2609.11632v1
• Date: Thu, 10 Sep 2026 14:42:24 GMT
• Title: FedHUR: Learning Hierarchical Utility-Guided Client Relations for Personalized Federated Recommendation
• Abstract summary: Federated recommendation enables collaborative model training while keeping user interaction data on local clients.<n>FedHUR is a framework for learning hierarchical utility-guided client relations.<n>Experiments on five real-world datasets show that FedHUR consistently outperforms existing federated recommendation baselines.
• Score: 44.13013639783267
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Federated recommendation enables collaborative model training while keeping user interaction data on local clients. A central problem in federated recommendation is how to aggregate useful information across clients for personalized recommendation. Existing personalized aggregation methods usually construct client relations from predefined parameter-based assumptions, such as parameter similarity or complementarity, and use these relations to determine aggregation weights. However, such methods construct a single global relation, which is insufficient to capture the hierarchical and multi-granularity nature of user relations in recommendation. Moreover, these predefined relations cannot directly reflect whether the related clients can improve prediction performance after aggregation. To address these limitations, we propose FedHUR, a federated recommendation framework for learning hierarchical utility-guided client relations. FedHUR takes item-item filters as the object for relation construction and aggregation. Specifically, it first aggregates and clusters each client's local information to obtain global hierarchical information. Each client computes hierarchical utility signals based on its local information and the global hierarchical information, indicating which collaborative information is useful for improving its prediction. The server uses these utility signals to retrieve clients that are useful to that client for further personalized aggregation. Extensive experiments on five real-world datasets show that FedHUR consistently outperforms existing federated recommendation baselines, demonstrating the effectiveness of hierarchical utility-guided client relation learning. Code is available at https://github.com/Mingzhe-Han/FedHUR.

Related papers

• Federated Learning with Energy-Based Structured Probabilistic Inference [7.122698354756618]
  Federated learning typically aggregates client updates using fixed or weighting rules.<n>We propose a framework that refines client aggregation weights using Conditional Random Fields (CRFs)<n>Our method defines unary potentials for individual clients and pairwise potentials for all client pairs, allowing the server to model both client-specific reliability and interactions between clients.
  arXiv  Detail & Related papers  (2026-06-29T11:38:46Z)
• Learning to Collaborate via Structures: Cluster-Guided Item Alignment for Federated Recommendation [20.406834399432544]
  Federated recommendation facilitates collaborative model training across distributed clients while keeping sensitive user interaction data local.<n>We propose Cluster-Guided FedRec framework (CGFedRec), a framework that transforms uploaded embeddings into compact cluster labels.
  arXiv  Detail & Related papers  (2026-02-25T14:39:47Z)
• 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)
• 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)
• FedCIA: Federated Collaborative Information Aggregation for Privacy-Preserving Recommendation [28.8047308546416]
  We introduce the federated collaborative information aggregation (FedCIA) method for privacy-preserving recommendation.<n>FedCIA allows clients to align their local models without constraining embeddings to a unified vector space.<n>It mitigates information loss caused by direct summation, preserves the personalized embedding distributions of individual clients, and supports the aggregation of parameter-free models.
  arXiv  Detail & Related papers  (2025-04-19T06:59:34Z)
• 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)
• On the Convergence of Clustered Federated Learning [57.934295064030636]
  In a federated learning system, the clients, e.g. mobile devices and organization participants, usually have different personal preferences or behavior patterns. This paper proposes a novel weighted client-based clustered FL algorithm to leverage the client's group and each client in a unified optimization framework.
  arXiv  Detail & Related papers  (2022-02-13T02:39:19Z)
• Personalized Federated Learning with First Order Model Optimization [76.81546598985159]
  We propose an alternative to federated learning, where each client federates with other relevant clients to obtain a stronger model per client-specific objectives. We do not assume knowledge of underlying data distributions or client similarities, and allow each client to optimize for arbitrary target distributions of interest. Our method outperforms existing alternatives, while also enabling new features for personalized FL such as transfer outside of local data distributions.
  arXiv  Detail & Related papers  (2020-12-15T19:30:29Z)

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.