VLDB 2026 Research / reviewers in the wild / expert
Yunze Luo
dblp:389/9720
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2025
0009-0004-9668-4378ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 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.
| Databases, data mining, and information retrieval
1 paper |
Recommender systems · 100% | |
| Artificial intelligence
1 paper |
Transfer learning and domain adaptation · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Transfer learning and domain adaptation
meta-learning |
0.9 | 1 | 2025 | Online Item Cold-Start Recommendation with Popularity-Aware Meta-Learning · KDD (1) 2025 |
Recommender systems › cold-start recommendation
cold-start item recommendation |
0.9 | 1 | 2025 | Online Item Cold-Start Recommendation with Popularity-Aware Meta-Learning · KDD (1) 2025 |
Recommender systems
cold-start recommendation |
0.9 | 1 | 2025 | Online Item Cold-Start Recommendation with Popularity-Aware Meta-Learning · KDD (1) 2025 |
Recommender systems
online recommendation |
0.9 | 1 | 2025 | Online Item Cold-Start Recommendation with Popularity-Aware Meta-Learning · KDD (1) 2025 |
Methods — techniques the papers use, named apart from their topics
self-supervised loss · 1.7data augmentation · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Online Item Cold-Start Recommendation with Popularity-Aware Meta-LearningabstractWith the rise of e-commerce and short videos, online recommender systems that can capture users' interests and update new items in real-time play an increasingly important role. In both online and offline recommendation systems, the cold-start problem caused by interaction sparsity has been impacting the effectiveness of recommendations for cold-start items. Many cold-start scheme based on fine-tuning or knowledge transferring shows excellent performance on offline recommendation. Yet, these schemes are infeasible for online recommendation on streaming data pipelines due to different training method, computational overhead and time constraints. Inspired by the above questions, we propose a model-agnostic recommendation algorithm called Popularity-Aware Meta-learning (PAM), to address the item cold-start problem under streaming data settings. PAM divides the incoming data into different meta-learning tasks by predefined item popularity thresholds. The model can distinguish and reweight behavior-related and content-related features in each task based on their different roles in different popularity levels, thus adapting to recommendations for cold-start samples. These task-fixing design significantly reduces additional computation and storage costs compared to offline methods. Furthermore, PAM also introduced data augmentation and an additional self-supervised loss specifically designed for low-popularity tasks, leveraging insights from high-popularity samples. This approach effectively mitigates the issue of inadequate supervision due to the scarcity of cold-start samples. Experimental results across multiple public datasets demonstrate the superiority of our approach over other baseline methods in addressing cold-start challenges in online streaming data scenarios. Yunze Luo, Yuezihan Jiang, Yinjie Jiang, Gaode Chen, Jingchi Wang, Kaigui Bian, Peiyi Li 0008, Qi Zhang 0010 |
KDD (1) | 1 |
| 2024 | Missing Interest Modeling with Lifelong User Behavior Data for Retrieval RecommendationabstractRich user behavior data has been proven to be of great value for recommendation systems. Modeling lifelong user behavior data in the retrieval stage to explore user long-term preference and obtain comprehensive retrieval results is crucial. Existing lifelong modeling methods cannot applied to the retrieval stage because they extract target-relevant items through the coupling between the user and the target item. Moreover, the current retrieval methods fail to precisely capture user interests when the length of the user behavior sequence increases further. That leads to a gap in the ability of retrieval models to model lifelong user behavior data. In this paper, we propose the concept of missing interest, leveraging the idea of complementarity, which serves as a supplement to short-term interest based on lifelong behavior data in the retrieval stage. Specifically, we design a missing interest operator and deploy it in Kafka data stream, without incurring latency or storage costs. This operator derives categories and authors of items that the user was previously interested in but has recently missed, and uses these as triggers to output missing features to the downstream retrieval model. Our retrieval model is a complete dual-tower structure that combines short-term and missing interests on the user side to provide a comprehensive depiction of lifelong behaviors. Since 2023, the presented solution has been deployed in Kuaishou, one of the most popular short-video streaming platforms in China with hundreds of millions of active users. Gaode Chen, Yuezihan Jiang, Rui Huang 0009, Kuo Cai, Yunze Luo, Ruina Sun, Qi Zhang 0010, Han Li 0005, Kun Gai |
CIKM | 5 |