Demo Data from VLDB 2026 / reviewers in the wild / expert
Devansh Tandon
dblp:387/0926
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Language models and text generation · 50% Graph learning · 50% | |
| Databases, data mining, and information retrieval
1 paper |
Recommender systems · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Language models and text generation › large language model › large language model adaptation
pre-trained language model fine-tuning |
1.0 | 1 | 2026 | PLUM: Adapting Pre-trained Language Models for Industrial-scale Generative Recommendations · WWW 2026 |
Machine learning › Graph learning
recommendation |
1.0 | 1 | 2026 | PLUM: Adapting Pre-trained Language Models for Industrial-scale Generative Recommendations · WWW 2026 |
Recommender systems
generative recommendation |
1.0 | 1 | 2026 | PLUM: Adapting Pre-trained Language Models for Industrial-scale Generative Recommendations · WWW 2026 |
Recommender systems
large language model-based recommendation |
1.0 | 1 | 2026 | PLUM: Adapting Pre-trained Language Models for Industrial-scale Generative Recommendations · WWW 2026 |
Methods — techniques the papers use, named apart from their topics
semantic IDs · 2.0fine-tuning · 2.0continued pretraining · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | PLUM: Adapting Pre-trained Language Models for Industrial-scale Generative RecommendationsabstractLarge Language Models (LLMs) pose a new paradigm of modeling and computation for information tasks. Recommendation systems are a critical application domain poised to benefit significantly from the sequence modeling capabilities and world knowledge inherent in these large models. In this paper, we introduce PLUM, a framework designed to adapt pre-trained LLMs for industry-scale recommendation tasks. PLUM consists of item tokenization using Semantic IDs, continued pre-training (CPT) on domain-specific data, and task-specific fine-tuning for recommendation objectives. For fine-tuning, we focus particularly on generative retrieval, where the model is directly trained to generate Semantic IDs of recommended items based on user context. We conduct comprehensive experiments on large-scale internal video recommendation datasets. Our results demonstrate that PLUM achieves substantial improvements for retrieval compared to a heavily-optimized production model built with large embedding tables. We also present a scaling study for the model's retrieval performance, our learnings about CPT, a few enhancements to Semantic IDs, along with an overview of the training and inference methods that enable launching this framework to billions of users in YouTube. Ruining He, Lukasz Heldt, Lichan Hong, Raghunandan H. Keshavan, Shifan Mao, Nikhil Mehta 0002, Zhengyang Su 0001, Alicia Tsai, Shao-Chuan Wang 0001, Xinyang Yi, Lexi Baugher, Baykal Cakici, Ed H. Chi, Cristos Goodrow, Ningren Han, Rómer Rosales, Abby Van Soest, Devansh Tandon, Su-Lin Wu, Weilong Yang, Yilin Zheng |
WWW | 20 |
| 2024 | Better Generalization with Semantic IDs: A Case Study in Ranking for RecommendationsabstractRandomly-hashed item ids are used ubiquitously in recommendation models. However, the learned representations from random hashing prevents generalization across similar items, causing problems of learning unseen and long-tail items, especially when item corpus is large, power-law distributed, and evolving dynamically. In this paper, we propose using content-derived features as a replacement for random ids. We show that simply replacing ID features with content-based embeddings can cause a drop in quality due to reduced memorization capability. To strike a good balance of memorization and generalization, we propose to use Semantic IDs [15], a compact and discrete item representation, as a replacement for random item ids. Semantic IDs are learned from frozen content embeddings using RQ-VAE and thus can capture the hierarchy of concepts in items. Similar to content embeddings, the compactness of Semantic IDs poses a problem of adaption in recommendation models. We propose novel methods for adapting Semantic IDs in industry-scale ranking models, through hashing sub-pieces of of the Semantic-ID sequences. In particular, we find that the SentencePiece model [10] that is commonly used in LLM tokenization outperforms manually crafted pieces such as N-grams. To the end, we evaluate our approaches in a real-world ranking model for YouTube recommendations. Our experiments demonstrate that Semantic IDs can replace the direct use of video IDs by improving the generalization ability on new and long-tail item slices without sacrificing overall model quality. Anima Singh, Trung Vu 0002, Nikhil Mehta 0002, Raghunandan H. Keshavan, Maheswaran Sathiamoorthy, Yilin Zheng, Lichan Hong, Lukasz Heldt, Devansh Tandon, Ed H. Chi, Xinyang Yi |
RecSys | 10 |