Far From Sight, Far From Mind: Inverse Distance Weighting for Graph Federated Recommendation
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916821112717312 |
|---|---|
| author | Khouas, Aymen Rayane Bouadjenek, Mohamed Reda Hacid, Hakim Aryal, Sunil |
| author_facet | Khouas, Aymen Rayane Bouadjenek, Mohamed Reda Hacid, Hakim Aryal, Sunil |
| contents | Graph federated recommendation systems offer a privacy-preserving alternative to traditional centralized recommendation architectures, which often raise concerns about data security. While federated learning enables personalized recommendations without exposing raw user data, existing aggregation methods overlook the unique properties of user embeddings in this setting. Indeed, traditional aggregation methods fail to account for their complexity and the critical role of user similarity in recommendation effectiveness. Moreover, evolving user interactions require adaptive aggregation while preserving the influence of high-relevance anchor users (the primary users before expansion in graph-based frameworks). To address these limitations, we introduce Dist-FedAvg, a novel distance-based aggregation method designed to enhance personalization and aggregation efficiency in graph federated learning. Our method assigns higher aggregation weights to users with similar embeddings, while ensuring that anchor users retain significant influence in local updates. Empirical evaluations on multiple datasets demonstrate that Dist-FedAvg consistently outperforms baseline aggregation techniques, improving recommendation accuracy while maintaining seamless integration into existing federated learning frameworks. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_01285 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Far From Sight, Far From Mind: Inverse Distance Weighting for Graph Federated Recommendation Khouas, Aymen Rayane Bouadjenek, Mohamed Reda Hacid, Hakim Aryal, Sunil Machine Learning Distributed, Parallel, and Cluster Computing Information Retrieval Graph federated recommendation systems offer a privacy-preserving alternative to traditional centralized recommendation architectures, which often raise concerns about data security. While federated learning enables personalized recommendations without exposing raw user data, existing aggregation methods overlook the unique properties of user embeddings in this setting. Indeed, traditional aggregation methods fail to account for their complexity and the critical role of user similarity in recommendation effectiveness. Moreover, evolving user interactions require adaptive aggregation while preserving the influence of high-relevance anchor users (the primary users before expansion in graph-based frameworks). To address these limitations, we introduce Dist-FedAvg, a novel distance-based aggregation method designed to enhance personalization and aggregation efficiency in graph federated learning. Our method assigns higher aggregation weights to users with similar embeddings, while ensuring that anchor users retain significant influence in local updates. Empirical evaluations on multiple datasets demonstrate that Dist-FedAvg consistently outperforms baseline aggregation techniques, improving recommendation accuracy while maintaining seamless integration into existing federated learning frameworks. |
| title | Far From Sight, Far From Mind: Inverse Distance Weighting for Graph Federated Recommendation |
| topic | Machine Learning Distributed, Parallel, and Cluster Computing Information Retrieval |
| url | https://arxiv.org/abs/2507.01285 |