Scaling Graph Neural Networks for Friend Recommendation: Multi-Hash User Embeddings and Temporal Neighbor Sampling
Read the original on arXiv Machine Learning →The paper presents a scalable graph neural network (GNN) system for friend recommendation on a massive social graph. It introduces two key design choices: multi-hash ID embeddings that shrink the embedding table by over 98% without hurting ranking quality, and a timestamp-sorted compressed sparse row (CSR) storage with binary search that reduces temporal neighbor sampling from linear to logarithmic time. Experiments on a 194‑million‑user, 28‑billion‑edge graph show that these techniques enable production‑grade performance, boosting friend additions by 16% and unique friend adders by 11.5% in an online A/B test.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.