Table of Contents
Fetching ...

From Aggregation to Selection: User-Validated Distributed Social Recommendation

Jingyuan Huang, Dan Luo, Zihe Ye, Weixin Chen, Minghao Guo, Yongfeng Zhang

TL;DR

DeSocial confronts the challenge of distributed social recommendation by replacing opaque aggregation with user-driven algorithm selection and majority consensus among validators. It formulates recommendation as a graph link prediction task and introduces Acc@K to measure consensus-driven correctness, reporting improvements across four real datasets. The approach demonstrates that personalized model selection and multi-validator voting yield higher decision correctness and robustness than single-point or aggregate baselines, while also revealing a practical less-is-more principle in validator composition. The work highlights the potential of user-validated distributed recommendations for privacy-preserving, transparent, and scalable social graph inference with broader applicability to decentralized systems.

Abstract

Social recommender systems facilitate social connections by identifying potential friends for users. Each user maintains a local social network centered around themselves, resulting in a naturally distributed social structure. Recent research on distributed modeling for social recommender systems has gained increasing attention, as it naturally aligns with the user-centric structure of user interactions. Current distributed social recommender systems rely on automatically combining predictions from multiple models, often overlooking the user's active role in validating whether suggested connections are appropriate. Moreover, recommendation decisions are validated by individual users rather than derived from a single global ordering of candidates. As a result, standard ranking-based evaluation metrics make it difficult to evaluate whether a user-confirmed recommendation decision is actually correct. To address these limitations, we propose DeSocial, a distributed social recommendation framework with user-validation. DeSocial enables users to select recommendation algorithms to validate their potential connections, and the verification is processed through majority consensus among multiple independent user validators. To evaluate the distributed recommender system with user validator, we formulate this setting as a link prediction and verification task and introduce Acc@K, a consensus-based evaluation metric that measures whether user-approved recommendations are correct. Experiments on 4 real-world social networks shows that DeSocial improves decision correctness and robustness compared to single-point and distributed baselines. These findings highlight the potential of user-validated distributed recommender systems as a practical approach to social recommendation, with broader applicability to distributed and decentralized recommendations. Code: https://github.com/agiresearch/DeSocial.

From Aggregation to Selection: User-Validated Distributed Social Recommendation

TL;DR

DeSocial confronts the challenge of distributed social recommendation by replacing opaque aggregation with user-driven algorithm selection and majority consensus among validators. It formulates recommendation as a graph link prediction task and introduces Acc@K to measure consensus-driven correctness, reporting improvements across four real datasets. The approach demonstrates that personalized model selection and multi-validator voting yield higher decision correctness and robustness than single-point or aggregate baselines, while also revealing a practical less-is-more principle in validator composition. The work highlights the potential of user-validated distributed recommendations for privacy-preserving, transparent, and scalable social graph inference with broader applicability to decentralized systems.

Abstract

Social recommender systems facilitate social connections by identifying potential friends for users. Each user maintains a local social network centered around themselves, resulting in a naturally distributed social structure. Recent research on distributed modeling for social recommender systems has gained increasing attention, as it naturally aligns with the user-centric structure of user interactions. Current distributed social recommender systems rely on automatically combining predictions from multiple models, often overlooking the user's active role in validating whether suggested connections are appropriate. Moreover, recommendation decisions are validated by individual users rather than derived from a single global ordering of candidates. As a result, standard ranking-based evaluation metrics make it difficult to evaluate whether a user-confirmed recommendation decision is actually correct. To address these limitations, we propose DeSocial, a distributed social recommendation framework with user-validation. DeSocial enables users to select recommendation algorithms to validate their potential connections, and the verification is processed through majority consensus among multiple independent user validators. To evaluate the distributed recommender system with user validator, we formulate this setting as a link prediction and verification task and introduce Acc@K, a consensus-based evaluation metric that measures whether user-approved recommendations are correct. Experiments on 4 real-world social networks shows that DeSocial improves decision correctness and robustness compared to single-point and distributed baselines. These findings highlight the potential of user-validated distributed recommender systems as a practical approach to social recommendation, with broader applicability to distributed and decentralized recommendations. Code: https://github.com/agiresearch/DeSocial.

Paper Structure

This paper contains 32 sections, 9 equations, 7 figures, 3 tables, 3 algorithms.

Figures (7)

  • Figure 1: Illustration of DeSocial, consisting of the user-driven algorithm selection and user-level consensus voting in distributed social recommendation. Each user performs user-driven algorithm selection by evaluating a pool of candidate recommendation models based on its local neighborhood, and selects a personalized model $\mathcal{F}_p$. Given candidate connections in $\mathcal{G}^{t+1}$, validators independently conduct local inference using their selected models without shared parameters. Final link predictions are obtained via distributed user-level consensus voting, where binary judgments from validators are aggregated by majority voting.
  • Figure 2: Full agreement across degree node quartiles. By incorporating user validation, least active (Q1) users can achieve improved outcomes, as decisions are informed by the collective assessments of active validators rather than sparse local data.
  • Figure 3: Gains versus number of validators. We vary the validator committee size $n$ and report the corresponding average gain of Acc@2/3/5. Gains converges as $n$ increases.
  • Figure 4: Validator selection trees illustrating how different types of validator selection affect user validation on UCI. Some of the recommendation algorithm combinations can improve the performance (Acc@2) while others degrades.
  • Figure 5: Validator selection trees illustrating how different types of validator selection affect user validation on Memo-Tx. The valid type of validator selection (with Acc@2 improved) varies, depending on the datasets.
  • ...and 2 more figures

Theorems & Definitions (5)

  • definition 1: Temporal Graph
  • definition 2: User-Specific Backbone
  • definition 3: Vote
  • definition 4: Verification
  • definition 5: User-Level Distributed Learning on Temporal Graphs