PulseAugur
EN
LIVE 02:07:38

GNNs scaled for friend recommendations with multi-hash embeddings and temporal sampling

Researchers have developed a scalable Graph Neural Network (GNN) system for friend recommendation on large social graphs, addressing challenges in production environments. The system utilizes multi-hash ID embeddings to significantly reduce embedding table size by over 98% while maintaining ranking quality. Additionally, it implements temporal neighbor sampling with timestamp-sorted CSR storage and binary search, drastically cutting down sampling costs. An online A/B test demonstrated a 16% increase in friend additions from recommendations and an 11.5% rise in unique friend adders compared to existing systems. AI

IMPACT This research offers a scalable solution for friend recommendation systems, potentially improving user engagement on social platforms.

RANK_REASON The cluster contains a research paper detailing a new method for scaling graph neural networks for friend recommendation.

Read on arXiv cs.IR (Information Retrieval) →

AI-generated summary · Google Gemini · from 2 sources. How we write summaries →

GNNs scaled for friend recommendations with multi-hash embeddings and temporal sampling

How we ranked this

Signal score
0 / 100
Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket
Research
The cluster contains a research paper detailing a new method for scaling graph neural networks for friend recommendation.
Source corroboration
2 independent sources
Multiple independent publishers reporting the same story raises confidence that it's real and newsworthy.
Topics
paper, infra, product
Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance
High
Clearly on-topic for AI-industry coverage.
Story freshness
75 days old
Aged out of breaking-news scoring windows; ranking reflects the durable signal from the full source set.

Full methodology in our editorial standards.

COVERAGE [2]

  1. arXiv cs.LG TIER_1 English(EN) · Maksim Utushkin, Andrei Ovsiannikov, Alexander D'yakonov ·

    Scaling Graph Neural Networks for Friend Recommendation: Multi-Hash User Embeddings and Temporal Neighbor Sampling

    arXiv:2608.27413v1 Announce Type: cross Abstract: Friend recommendation is inherently graph-structured: the relevance of a potential connection depends on multi-hop social context rather than user attributes alone. However, deploying message-passing GNNs on a production-scale soc…

  2. arXiv cs.IR (Information Retrieval) TIER_1 English(EN) · Alexander D'yakonov ·

    Scaling Graph Neural Networks for Friend Recommendation: Multi-Hash User Embeddings and Temporal Neighbor Sampling

    Friend recommendation is inherently graph-structured: the relevance of a potential connection depends on multi-hop social context rather than user attributes alone. However, deploying message-passing GNNs on a production-scale social graph with hundreds of millions of users and t…