Skip to content

Personalized Graph Sampling for Diverse Short Video Recommendation

Oct 2026 · ACM Transactions on the Web · 0 citations · 37 references
Recommender Systems and Techniques

TL;DR

This work identifies two dimensions of diversity preferences—validated by psychological theory and readily inferable from interaction data and modeled using graph neighbor sampling: user preferences for diverse content across category levels, and preferences for fine-grained diversity within broad-level interests: user preferences for diverse content across category levels and preferences for fine-grained diversity within broad-level interests.

Abstract

Efforts to improve diversity in recommendations typically come at a cost of accuracy. While several works have proposed methods to overcome this trade-off, they neglect the unique challenges of short-video platforms: extreme long-tail distributions and hierarchical category structures with multiple granularity levels. Meanwhile, graph neural networks have become the state-of-the-art for recommendation because of their ability to achieve collaborative filtering and learn higher-order relationships between users and items. We therefore aim to unlock the capabilities of GNNs for personalization to adapt diversity to individual user preferences and overcome the accuracy-diversity dilemma in short-video recommendation. In this work, we identify two dimensions of diversity preferences—validated by psychological theory and readily inferable from interaction data and modeled using graph neighbor sampling: user preferences for diverse content across category levels, and preferences for fine-grained diversity within broad-level interests. We integrate these dimensions directly into the graph propagation process through neighbor sampling, enabling the model to dynamically balance exploration of diverse categories with exploitation of user preferences during training. We also employ a curriculum training strategy that schedules exposure to items based on popularity-based hardness to determine how this scheduling improves the latent representations of long-tail items and mitigates the accuracy-diversity trade-off. Through extensive experiments against both standard graph and state-of-the-art graph-based diversified recommendation baselines, we show that our solution achieves superior balance between diversity and accuracy on datasets with extreme long-tail distributions while outperforming state-of-the-art methods at deeper levels of the category hierarchy.

Read PDF

Similar papers

Conference Sep 2026

A lightweight graph convolutional network-based session recommendation method based on multihop attention mechanism

A novel Multi-Hop Lightweight Graph Convolutional Network (MH-LGCN) conversational recommendation model based on a multi-hop attention mechanism that abandons redundant operations in traditional graph convolution and designs a lightweight information propagation mechanism that retains only neighbor feature aggregation.

Xua Li, Ru-Jun Wang · 0 citations
Open access 2026

Disentangling Multi Behaviors for Recommendation Based on Graph Contrastive Learning

Recommendation systems play a crucial role in efficiently filtering vast amounts of information, and supporting businesses across various domains such as e-commerce, social media, and online entertainment. Traditional recommendation methods, including collaborative filtering, often suffer from data sparsity issues, lim...

Fang-Yu Han, Dao-Guang Liu, Xiang Lin · 0 citations
Book Open access Sep 2026

UniTraj: Cross-Domain Long-Sequence Modeling for Commercial Recommendation

Long-sequence modeling is increasingly important in recommender systems for capturing users’ evolving and long-term interests. In advertising, however, user interaction histories are often highly sparse due to limited exposure opportunities, making ad-only behavior sequences insufficient for effective long-sequence rec...

Xian Hu, Ming Yue, Zhi-Xiang Feng et al. · 0 citations
Preprint Sep 2026

Recommender System as Slow and Fast Thinkers

Experiments on five real-world datasets show that \textsc{DS-Frame} consistently improves representative sequential recommendation backbones, with larger gains on challenging groups and effective accuracy--efficiency trade-offs, highlighting the potential of adaptive inference for more efficient and robust recommendati...

Zi-Chen Yuan, Xiao-Xuan Dong, Linkun Dai et al. · 0 citations
#graph neural networks Open access Oct 2026

Sparsity-aware social recommendation via information graph bottleneck

With the widespread adoption of online social networks, social recommender systems have become a key paradigm for mitigating data sparsity and cold-start issues in traditional collaborative filtering. However, existing graph neural network (GNN) based recommendation models face two fundamental structural bottlenecks wh...

Jia-Lei Zhu, Yun-Long Song, Hong-Yun Zhang · 0 citations

Related blog posts

Microsoft Research Blog Jul 13, 2026

Verifying Rust cryptography in SymCrypt, from standards to code

Cryptographic code supports vital protections in modern computing systems. Learn how a new method helps verify code as developers write it while preserving speed and adaptability as it gets implemented and evolves. The post Verifying Rust cryptography in SymCrypt, from standards to code appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.