VLDB 2026 Research / reviewers in the wild / expert
Lei Wang 0198
dblp:181/2817-198
· DBLP profile ↗
9ranked-venue papers in the field
5as first author
6since 2021 · last 2026
0009-0002-7769-6918ORCID · conflict
Domains — venue-derived; a paper can count in several
Information Retrieval & Web Search · 9 (5 first)
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Divergence Meets Consensus: A Multi-Source Negative Sampling Framework for Sequential Recommendation
Yuanzi Li, Lingjie Wang, Zihang Tian, Lei Wang 0198, Xu Chen 0017 |
SIGIR | 6 |
| 2026 | Explainable Recommendation with Simulated Human FeedbackabstractRecent advancements in explainable recommendation have greatly bolstered user experience by elucidating the decision-making rationale. However, the existing methods actually fail to provide effective feedback signals for potentially better or worse generated explanations due to their reliance on traditional supervised learning paradigms in sparse interaction data. To address these issues, we propose a novel human-like feedback-driven optimization framework. This framework employs a dynamic interactive optimization mechanism for achieving human-centered explainable requirements without incurring high labor costs. Specifically, we propose to utilize large language models (LLMs) as human simulators to predict human-like feedback for guiding the learning process. To enable the LLMs to deeply understand the task essence and meet user’s diverse personalized requirements, we introduce a human-induced customized reward scoring method, which helps stimulate the language understanding and logical reasoning capabilities of LLMs. Furthermore, considering the potential conflicts between different perspectives of explanation quality, we introduce a principled Pareto optimization that transforms the multi-perspective quality enhancement task into a multi-objective optimization problem for improving explanation performance. At last, to achieve efficient model training, we design an off-policy optimization pipeline. By incorporating a replay buffer and addressing the data distribution biases, we can effectively improve data utilization and enhance model generality. Extensive experiments on four datasets demonstrate the superiority of our approach. Jiakai Tang, Jingsen Zhang, Zihang Tian, Xueyang Feng, Lei Wang 0198, Xu Chen 0017 |
ACM Trans. Inf. Syst. | 5 |
| 2025 | Twin-Flow Generative Ranking Network for RecommendationabstractDeep Learning Recommendation Models (DLRMs) often rely on extensive manual feature engineering to improve accuracy and user experience, which increases system complexity and limits scalability of model performance with respect to computational resources. Recently, Meta introduced a generative ranking paradigm based on HSTU block that enables end-to-end learning from raw user behavior sequences and demonstrates scaling law on large datasets that can be regarded as the state-of-the-art (SOTA). However, splitting user behaviors into interleaved item and action information significantly increases the input sequence length, which adversely affects both training and inference efficiency. To address this issue, we propose the Twin-Flow Generative Ranking Network (TFGR), that employs a Twin-flow mechanism to optimize interaction modeling, ensuring efficient training and inference through end-to-end token processing. TFGR duplicates the original user behavior sequence into a real flow and a fake flow based on the authenticity of the action information, and then defines a novel interaction method between the real flow and the fake flow within the QKV module of the self-attention mechanism. This design reduces computational overhead and improves both training efficiency and inference performance compared to Meta's HSTU-based model. Experiments on both open-source and real industrial datasets show that TFGR outperforms DLRM, which serves as the industrial online baseline with extensive feature engineering, as well as Meta's HSTU and other common recommendation models such as DIN, DCN, DIEN, and DeepFM. Furthermore, we investigate optimal parameter allocation strategies under computational constraints, establishing TFGR as an efficient and effective next-generation generative ranking paradigm. Erpeng Xue, Xiaolei Wang 0005, Lei Wang 0198, Jinpeng Wang 0001, Zeshun Li |
CIKM | 6 |
| 2025 | User Behavior Simulation with Large Language Model-based AgentsabstractSimulating high quality user behavior data has always been a fundamental yet challenging problem in human-centered applications such as recommendation systems, social networks, among many others. The major difficulty of user behavior simulation originates from the intricate mechanism of human cognitive and decision processes. Recently, substantial evidence has suggested that by learning huge amounts of web knowledge, large language models (LLMs) can achieve human-like intelligence and generalization capabilities. Inspired by such capabilities, in this article, we take an initial step to study the potential of using LLMs for user behavior simulation in the recommendation domain. To make LLMs act like humans, we design profile, memory and action modules to equip them, building LLM-based agents to simulate real users. To enable interactions between different agents and observe their behavior patterns, we design a sandbox environment, where each agent can interact with the recommendation system, and different agents can converse with their friends via one-to-one chatting or one-to-many social broadcasting. In the experiments, we first demonstrate the believability of the agent-generated behaviors based on both subjective and objective evaluations. Then, to show the potential applications of our method, we simulate and study two social phenomena including (1) information cocoons and (2) user conformity behaviors. We find that controlling the personalization degree of recommendation algorithms and improving the heterogeneity of user social relations can be two effective strategies for alleviating the problem of information cocoon, and the conformity behaviors can be highly influenced by the amount of user social relations. To advance this direction, we have released our project at https://github.com/RUC-GSAI/YuLan-Rec . Lei Wang 0198, Jingsen Zhang, Hao Yang 0045, Jiakai Tang, Zeyu Zhang 0007, Xu Chen 0017, Yankai Lin 0001, Hao Sun 0002, Ruihua Song, Wayne Xin Zhao, Jun Xu 0001, Zhicheng Dou, Jun Wang 0012, Ji-Rong Wen |
ACM Trans. Inf. Syst. | 1 |
| 2024 | Causally Debiased Time-aware Recommendation
Lei Wang 0198, Chen Ma 0001, Xian Wu 0001, Zhaopeng Qiu, Yefeng Zheng 0001, Xu Chen 0017 |
WWW | 1 |
| 2023 | Towards a More User-Friendly and Easy-to-Use Benchmark Library for Recommender SystemsabstractIn recent years, the reproducibility of recommendation models has become a severe concern in recommender systems. In light of this challenge, we have previously released a unified, comprehensive and efficient recommendation library called RecBole, attracting much attention from the research community. With the increasing number of users, we have received a number of suggestions and update requests. This motivates us to make further improvements on our library, so as to meet the user requirements and contribute to the research community. In this paper, we present a significant update of RecBole, making it more user-friendly and easy-to-use as a comprehensive benchmark library for recommendation. More specifically, the highlights of this update are summarized as: (1) we include more benchmark models and datasets, improve the benchmark framework in terms of data processing, training and evaluation, and release reproducible configurations to benchmark the recommendation models; (2) we upgrade the user friendliness of our library by providing more detailed documentation and well-organized frequently asked questions, and (3) we propose several development guidelines for the open-source library developers. These extensions make it much easier to reproduce the benchmark results and stay up-to-date with the recent advances on recommender systems. Our update is released at the link: https://github.com/RUCAIBox/RecBole. Lanling Xu, Zhen Tian 0001, Junjie Zhang 0009, Lei Wang 0198, Bowen Zheng 0005, Yifan Li 0009, Jiakai Tang, Zeyu Zhang 0007, Yupeng Hou, Xingyu Pan, Wayne Xin Zhao, Xu Chen 0017, Ji-Rong Wen |
SIGIR | 5 |
| 2012 | Improving bag-of-visual-words model with spatial-temporal correlation for video retrievalabstractMost of the state-of-art approaches to Query-by-Example (QBE) video retrieval are based on the Bag-of-visual-Words (BovW) representation of visual content. It, however, ignores the spatial-temporal information, which is important for similarity measurement between videos. Direct incorporation of such information into the video data representation for a large scale data set is computationally expensive in terms of storage and similarity measurement. It is also static regardless of the change of discriminative power of visual words for different queries. To tackle these limitations, in this paper, we propose to discover Spatial-Temporal Correlations (STC) imposed by the query example to improve the BovW model for video retrieval. The STC, in terms of spatial proximity and relative motion coherence between different visual words, is crucial to identify the discriminative power of the visual words. We develop a novel technique to emphasize the most discriminative visual words for similarity measurement, and incorporate this STC-based approach into the standard inverted index architecture. Our approach is evaluated on the TRECVID2002 and CC\_WEB\_VIDEO datasets for two typical QBE video retrieval tasks respectively. The experimental results demonstrate that it substantially improves the BovW model as well as a state of the art method that also utilizes spatial-temporal information for QBE video retrieval. Lei Wang 0198, Dawei Song 0001, Eyad Elyan |
CIKM | 1 |
| 2011 | Video Retrieval Based on Words-of-Interest Selection
Lei Wang 0198, Dawei Song 0001, Eyad Elyan |
ECIR | 1 |
| 2011 | Words-of-interest selection based on temporal motion coherence for video retrievalabstractThe "Bag of Visual Words" (BoW) framework has been widely used in query-by-example video retrieval to model the visual content by a set of quantized local feature descriptors. In this paper, we propose a novel technique to enhance BoW by the selection of Word-of-Interest (WoI) that utilizes the quantified temporal motion coherence of the visual words between the adjacent frames in the query example. Experiments carried out using TRECVID datasets show that our technique improves the retrieval performance of the classical BoW-based approach. Lei Wang 0198, Dawei Song 0001, Eyad Elyan |
SIGIR | 1 |