Graph Denoising for Social Recommendation

100 concepts69 papers1 proposal

Early social recommender systems operated on a simple, intuitive premise: friends share tastes. If you follow someone on a social network, you are likely to enjoy the same music, movies, or products. This concept of social homophily promised to solve the long-standing data sparsity problem in collaborative filtering by using social links as a bridge to predict user preferences.

However, real-world data has revealed a fundamental flaw in this assumption. Empirical studies show that "preference-aware homophily"—the actual overlap in item consumption between connected users—is frequently very low (Challenging Low Homophily in Social Recommendation). Online social links form for a multitude of reasons entirely unrelated to consumer preferences: professional networking, academic relationships, social courtesy (such as reciprocal follow-backs), or simply following a celebrity or news outlet (Denoised Self-Augmented Learning for Social Recommendation; A Probabilistic Model for User Interest Propagation in Recommender Systems).

When a recommendation model treats these raw, uncurated social links as an immutable ground truth of user similarity, it introduces massive amounts of informational noise. Paradoxically, directly integrating raw social network data can degrade predictive accuracy, causing models to perform worse than simple collaborative filtering algorithms that rely solely on user-item interaction histories (Graph Bottlenecked Social Recommendation; Invariance Matters: Empowering Social Recommendation via Graph Invariant Learning). To unlock the true value of social data, modern architectures must actively denoise the social graph.

The Anatomy of Social Graph Noise

To understand why raw social graphs fail, we must look at how noise structurally distorts user representations during graph neural network (GNN) message passing.

Social Tie Coarseness

A standard social link is a binary, coarse metric. It collapses a complex relationship into a single 0 or 1. As Ghazaleh Beigi et al. argue in Similar but Different: Exploiting Users' Congruity for Recommendation Systems, friendship does not guarantee consensus; a significant portion of connected users hold opposing views on content quality. Treating explicit friendship as a direct proxy for taste propagates conflicting preference signals through the network.

Domain Averaging

When a model uses a single edge to represent a social connection, it forces an average correlation across entirely diverse domains (Modeling Users' Multifaceted Interest Correlation for Social Recommendation). For instance, two users might share an interest in video games but have completely divergent tastes in books. Propagating preferences uniformly across the entire item space introduces severe bias, forcing the model to aggregate irrelevant information from casual acquaintances or accidental clicks.

Anisotropic Clustering

Social noise isn't uniform or random (like isotropic Gaussian noise). Instead, it is highly structured and directional—or anisotropic—clustering around specific non-uniform patterns like high-profile celebrity accounts, news organizations, or automated bots (Flow Matching for Denoised Social Recommendation; The Uncertainty of Identity Toolset: Analysing Digital Traces for User Profiling). These structural hubs create massive "shortcuts" in the graph, causing distinct user profiles to bleed into one another during embedding aggregation.

How Graph Denoising Works

To fix this, graph denoising frameworks shift from treating the social graph as a static input to treating it as a noisy candidate topology that must be dynamically refined. The goal is to prune task-irrelevant edges and preserve or synthesize preference-aligned connections.

[Raw Social Graph] ---> [Preference Validation] ---> [Denoised Graph] ---> [GNN Embedding]
  (Noisy, structural)      (Compares interaction       (Pruned, preference-   (Accurate, robust
                           histories & behaviors)       aligned topology)       recommendations)

Preference-Guided Pruning and Rewiring

The most direct way to denoise a graph is to validate social links against actual interaction histories. For example, Le Wu et al. developed a preference-guided denoising mechanism in Graph Bottlenecked Social Recommendation that evaluates the interaction overlap between connected users. If the behavioral similarity between connected nodes falls below a threshold, the link is assigned a low confidence score and pruned to prevent the propagation of irrelevant social influence.

Taking this a step further, Wei Jiang et al. propose a framework called SHaRe that dynamically "rewires" the graph, cutting heterophilic links and adding synthetic edges between unconnected "taste-doubles" who share strong item-level overlap (Challenging Low Homophily in Social Recommendation).

Information Bottlenecks and Generative Denoising

Rather than relying on simple heuristics, advanced models use generative principles to isolate the true signal. The Information Bottleneck principle can be applied to compress the social graph into a minimal representation that retains only the information predictive of item preferences, discarding redundant social noise (Graph Bottlenecked Social Recommendation).

Other approaches leverage diffusion models to filter relations based on shared interactions with niche or long-tail items, prioritizing social links that represent unique shared interests over common popular ones (Balancing User Preferences by Social Networks: A Condition-Guided Social Recommendation Model for Mitigating Popularity Bias). To handle complex, anisotropic noise distributions, Yinxuan Huang leverages continuous velocity fields via Flow Matching to smooth out structural distortions in the user representation space (Flow Matching for Denoised Social Recommendation).

Disentanglement and Self-Supervised Alignment

Another powerful intuition is that a user's social behavior and their commercial behavior belong to distinct domains. Frameworks like DcRec explicitly disentangle user representations into separate "social" and "collaborative" spaces, using cross-domain contrastive learning to bridge them without letting irrelevant social signals overwhelm the primary item-preference data (Disentangled Contrastive Learning for Social Recommendation).

By adaptively aligning a user's social connections with their actual interaction patterns via self-supervised learning, Lianghao Xia demonstrates that treating social ties as candidates for influence and validating them against actual behavior achieves higher accuracy and robustness (Denoised Self-Augmented Learning for Social Recommendation).

Why Denoising Empirically Works

By removing structural noise from the social graph, these models prevent the propagation of misleading or contradictory preferences during GNN aggregation layers. Empirically, removing unreliable or noisy social links is often more impactful for model performance than adding new synthetic edges (Challenging Low Homophily in Social Recommendation).

When the model focuses strictly on high-confidence, preference-aligned social ties, it successfully mitigates popularity bias and uncovers genuine long-tail user interests. Ultimately, graph denoising transforms the social graph from a noisy liability into a powerful asset for personalized recommendation.

Key Foundational Work

On social networks and collaborative recommendation (2009) — contributed 2 concept elements to this direction.
History & citationVersion 2 · 2026-10-04

Current · Permanent link

  1. Version 2 (latest) · 2026-10-04 · 68 papers
  2. Version 1 · 2026-10-04 · 84 papers
Cite this direction

Latest version (a living page):

@misc{lacuna_social_graph_noise_2334e030,
  title = {social graph noise},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/social-graph-noise/rdr_2334e030da414c029b2b2f7969810d6e},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}

This exact version (version 2, frozen text):

@misc{lacuna_social_graph_noise_2334e030_v2,
  title = {social graph noise},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/social-graph-noise/rdr_2334e030da414c029b2b2f7969810d6e/v/2},
  note = {Version 2, frozen 2026-10-04. Accessed 2026-11-19},
}
About

These directions overlap with this one through shared papers.

See something wrong? Report a mistake