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.
By Maksim Utushkin, Andrei Ovsiannikov, Alexander D'yakonov
The paper studies candidate generation for alternative vacation rental recommendations, comparing collaborative filtering, shallow embeddings, and graph neural network (GNN) methods on a platform with over 2 million active properties. A hybrid model that combines item-based collaborative filtering with GNN-based retrieval achieves a 14.8% higher Recall@300 than the best baseline, leveraging each method’s strengths: collaborative filtering for well-interacted properties and GNNs for diverse, cold-start alternatives. The authors also show that stronger candidate pools improve downstream ranking quality, though the exact impact is intertwined with ranker training.
By Syed Mohammed Arshad Zaidi, Eric Rincon, Shayan Hassantabar
arXiv:2506. 07449v2 Announce Type: replace-cross Abstract: Recent advances in Large Language Models (LLMs) have driven their adoption in recommender systems through Retrieval-Augmented Generation (RAG) frameworks.
By Vahid Azizi, Fatemeh Koochaki
arXiv:2508.02609v3 Announce Type: replace-cross
Abstract: Graph Neural Networks (GNN) have been extensively applied to industry recommendation systems, as seen in models like GraphSage\cite{GraphSage...
By Jiayin Jin, Erika Sun, Zhimeng Pan, Yang Tang, Jiarui Feng, Kungang Li, Chongyuan Xiang, Jiacheng Li, Runze Su, Siping Ji, Han Sun, Ling Leng, Prathibha Deshikachar
CORE improves compositional reasoning in multimodal language models by distilling a cross‑attentive reranker’s fine‑grained judgments into the embedding model. It generates candidate lists across five compositional matching levels and trains with a Rank‑KL objective to replicate the reranker’s ranking. Experiments on COLA, SUGARCREPE++, and NEGBENCH show CORE‑RERANKER‑8B outperforms Jina‑Reranker by 10.7 points, while CORE‑EMBED‑8B achieves the best overall average among evaluated embeddings, with gains also transferring to the MCMR benchmark without harming COCO or Flickr30K retrieval.
By Tingyu Song, Mingxin Li, Yanzhao Zhang, Dingkun Long, Chu Liu, Pengjun Xie, Yilun Zhao, Shu Wu
The paper introduces ImbalancE, an inference‑time latent search method that mitigates degree imbalance bias in Knowledge Graph Embedding models. It targets the problematic prediction of target entities with much lower degrees than anchor entities, a common issue in recommender systems and other applications. Experiments on benchmark datasets show that ImbalancE improves predictions on the most imbalanced triples compared to conventional methods.
By Alberto Bernardi, Luca Costabello, Christophe Gueret