Denoising Social Graphs for Preference Aware Recommendation

You are reading version 1 of this direction, frozen 2026-10-04. The latest version is version 2.

Version 1 of 284 papers113 conceptsfrozen 2026-10-04

The foundational assumption of social recommendation is simple: you probably like what your friends like. In machine learning terms, this is social homophily—the tendency for similar people to connect. For years, researchers like Ioannis Konstas and Joemon M. Jose demonstrated that treating social networks as structural graphs could outperform traditional collaborative filtering by tapping into "social knowledge" (On social networks and collaborative recommendation).

However, a growing body of evidence suggests this assumption is often dangerously wrong. Your LinkedIn connections, your high school classmates, and the celebrities you follow on Twitter rarely share your specific taste in niche cinema or specialized software. When recommendation engines treat these "noisy" social links as ground truth, the results often degrade, sometimes performing worse than models that ignore social data entirely.

The Homophily Paradox

The core problem is that social links are semantically ambiguous. As Menghan Wang and Xiaolin Zheng point out, social ties form for myriad reasons—professional networking, geographic proximity, or even social obligation—that have nothing to do with consumer taste (Collaborative Filtering with Social Exposure).

Empirical analysis by Dezhao Yang and Jianghong Ma reveals a staggering disconnect: in some datasets, over 80% of social links lack any common item interactions (IDVT: Interest-aware Denoising and View-guided Tuning for Social Recommendation). This creates a "performance paradox" where adding more social data introduces enough noise to lead the model away from accurate user-item patterns (Graph Bottlenecked Social Recommendation).

From Raw Graphs to Preference-Aligned Structures

To solve this, the research direction has shifted from using social graphs to denoising them. The goal is to transform a raw social network into a "preference-aware" graph that only retains links with predictive value.

1. Pruning and Rewiring

One approach is to treat the social graph as a noisy draft. Frameworks like GDMSR, developed by Jingtao Ding and Yong Li, explicitly prune redundant or irrelevant ties. By removing 10-40% of original social relations based on user preference signals, these models achieve higher accuracy and better computational efficiency (Robust Preference-Guided Denoising for Graph based Social Recommendation). Similarly, the SHaRe framework by Wei Jiang dynamically "rewires" the graph, cutting heterophilic links and adding new ones between users who share interests but aren't yet connected (Challenging Low Homophily in Social Recommendation).

2. Learning Latent Dependencies

Rather than just cleaning an existing graph, some researchers argue we should learn the "optimal" social structure from scratch. Peilin Zhao and Yong Liu introduced Probabilistic Relational Matrix Factorization (PRMF) to discover hidden social influences that explicit graphs miss (Learning Optimal Social Dependency for Recommendation). This moves the model away from trusting "friendship" and toward trusting "influence."

3. Social Exposure vs. Preference

A subtle but powerful shift in framing involves treating social links not as indicators of what a user likes, but what they have been exposed to. Menghan Wang argues that social circles dictate the items we see in our feeds, which creates a selection bias. By modeling social connections as an exposure strategy rather than a preference proxy, models like SERec and REST can perform counterfactual reasoning to debias recommendations (REST: Debiased Social Recommendation via Reconstructing Exposure Strategies).

Invariant and Bottlenecked Learning

The most recent frontier involves using information theory and invariant learning to find the "signal" in the social "noise."

By acknowledging that social networks are cluttered with "social obligation" links and "celebrity noise," this research direction has moved the field toward a more robust, data-centric view of human influence. The result is a generation of recommenders that understand that while you might follow your boss, you probably don't want to buy their shoes.

Papers in this version

Showing 60 of 84 papers.

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 1, frozen text):

@misc{lacuna_denoising_social_graphs_for_preference_a_2334e030_v1,
  title = {Denoising Social Graphs for Preference Aware Recommendation},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/denoising-social-graphs-for-preference-aware-recommendation/rdr_2334e030da414c029b2b2f7969810d6e/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}