EDBT 2026 Demo / reviewers in the wild / expert
Chenyi Lei
dblp:150/8550
· DBLP profile ↗
15ranked-venue papers in the field
2as first author
13since 2021 · last 2026
0000-0001-6287-3673ORCID · verified
Domains — venue-derived; a paper can count in several
Information Retrieval & Web Search · 11 (1 first)Data Mining & Knowledge Discovery · 3 (1 first)Database Systems & Data Management · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | UniDGF: A Unified Detection-to-Generation Framework for Hierarchical Object Visual RecognitionabstractAchieving visual semantic understanding requires a unified framework that simultaneously handles object detection, category prediction, and attribute recognition. However, current advanced approaches rely on global similarity and struggle to capture fine-grained category distinctions and category-specific attribute diversity, especially in large-scale e-commerce scenarios. To overcome these challenges, we introduce a detection-guided generative framework that predicts hierarchical category and attribute tokens. For each detected object, we extract refined ROI-level features and employ a BART-based generator to produce semantic tokens in a coarse-to-fine sequence covering category hierarchies and property–value pairs, with support for property-conditioned attribute recognition. Experiments on both large-scale proprietary e-commerce datasets and open-source datasets demonstrate that our approach significantly outperforms existing similarity-based pipelines and multi-stage classification systems, achieving stronger fine-grained recognition and more coherent unified inference. Xinyu Nan, Lingtao Mao, Huangyu Dai, Zexin Zheng, Zihan Liang 0001, Ben Chen 0004, Chenyi Lei |
ICMR | 8 |
| 2026 | GRADE: Personalized Multi-Task Fusion via Group-Relative Reinforcement Learning with Adaptive Dirichlet Exploration
Tingfeng Hong, Pingye Ren, Xinlong Xiao, Chao Wang 0049, Chenyi Lei, Wenwu Ou, Han Li 0005 |
WWW | 5 |
| 2026 | DiffusionGS: Generative Search with Query Conditioned Diffusion in KuaishouabstractPersonalized search ranking systems are critical for driving engagement and revenue in modern e-commerce platforms. Existing methods primarily model users' broad interests from historical behaviors but often fail to explicitly align these with real-time intent expressed in user queries. In this paper, we propose DiffusionGS, a scalable generative framework that treats user queries as explicit intent anchors to extract user interests from long-term, noisy behavior histories. Specifically, we formulate interest extraction as a conditional denoising task, where the user's query guides a conditional diffusion process to produce a robust, user intent-aware representation from their behavioral sequence. A User-aware Denoising Layer (UDL) further refines attention distribution using user-specific profiles. By reframing queries as intent priors and leveraging diffusion-based denoising, our method provides a powerful mechanism for capturing dynamic user interest shifts. Extensive offline and online experiments demonstrate the superiority of DiffusionGS over state-of-the-art methods. © 2026 Copyright held by the owner/author(s). Qinyao Li, Qihang Zhao, Ke Xu 0010, Chao Wang 0049, Chenyi Lei, Han Li 0005, Wenwu Ou |
WWW | 7 |
| 2026 | Towards Context-aware Reasoning-enhanced Generative Searching in E-commerceabstractSearch-based recommendation is one of the most critical application scenarios in e-commerce platforms. Users' complex search contexts—such as spatiotemporal factors, historical interactions, and current query's information—constitute an essential part of their decision-making, reflecting implicit preferences that complement explicit query terms. Modeling such rich contextual signals and their intricate associations with candidate items remains a key challenge. Although numerous efforts have been devoted to building more effective search methods, existing approaches still show limitations in integrating contextual information, which hinders their ability to fully capture user intent. To address these challenges, we propose a context-aware reasoning-enhanced generative search framework for better understanding the complicated context. Specifically, the framework first unifies heterogeneous user and item contexts into textual representations or text-based semantic identifiers and aligns them. To overcome the lack of explicit reasoning trajectories, we introduce a self-evolving post-training paradigm that iteratively combines supervised fine-tuning and reinforcement learning to progressively enhance the model's reasoning capability. In addition, we identify potential biases in existing RL algorithms when applied to search scenarios and present a debiased variant of GRPO to improve ranking performance. Extensive experiments on search log data collected from a real-world e-commerce platform demonstrate that our approach achieves superior performance compared with strong baselines, validating its effectiveness for search-based recommendation. Zhiding Liu, Ben Chen 0004, Mingyue Cheng 0004, Enhong Chen, Li Li 0110, Chenyi Lei, Wenwu Ou, Han Li 0005, Kun Gai |
WWW | 6 |
| 2026 | COINS: Semantic Ids Enhanced Cold Item Representation for Click-through Rate Prediction in E-commerce SearchabstractWith the rise of modern search and recommendation platforms, insufficient collaborative information of cold-start items exacerbates the Matthew effect of existing platform items, challenging platform diversity and becoming a longstanding issue. Existing methods align items' side content with collaborative information to transfer collaborative signals from high-popularity items to cold-start items. However, these methods fail to account for the asymmetry between collaboration and content, nor the fine-grained differences among items. To address these issues, we propose COINS, an item representation enhancement approach based on fused alignment of semantic IDs. Specifically, we use RQ-OPQ encoding to quantize item content and collaborative information, followed by a two-step alignment: RQ encoding transfers shared collaborative signals across items, while OPQ encoding learns items' differentiated information. Comprehensive offline experiments on large-scale industrial datasets demonstrate COINS's superiority, and rigorous online A/B tests confirm statistically significant improvements. Qihang Zhao, Siyuan Wang 0014, Zihan Liang 0001, Mingcan Peng, Ben Chen 0004, Chenyi Lei |
WWW | 9 |
| 2025 | Multi-Source Knowledge Pruning for Retrieval-Augmented Generation: A Benchmark and Empirical StudyabstractRetrieval-augmented generation (RAG) is increasingly recognized as an effective approach to mitigating the hallucination of large language models (LLMs) through the integration of external knowledge. While numerous efforts, most studies focus on a single type of external knowledge source. However, in real-world applications, most situations involve diverse knowledge from various sources, yet this area has been less explored. The main dilemma is the lack of a suitable dataset containing multiple knowledge sources and pre-exploration of the associated issues. To address these challenges, we standardize a benchmark dataset that combines structured and unstructured knowledge across diverse and complementary domains. Based on this dataset, we further develop a plug-and-play RAG framework, PruningRAG, whose main characteristic is the use of multi-granularity pruning strategies to optimize the integration of relevant information while minimizing misleading context. It consistently improves performance across various existing RAG variants, demonstrating its robustness and broad applicability. Building upon the standardized dataset and PruningRAG, we also report a series of experimental results, as well as insightful findings. Our dataset and code are publicly available. https://github.com/USTCAGI/PruningRAG, with the aim of advancing future research in the RAG community. Shuo Yu 0007, Mingyue Cheng 0004, Qi Liu 0003, Daoyu Wang, Jiqian Yang, Yucong Luo, Chenyi Lei, Enhong Chen |
CIKM | 8 |
| 2025 | H-PRM: A Pluggable Hotword Pre-Retrieval Module for Various Speech Recognition Systems
Huangyu Dai, Lingtao Mao, Ben Chen 0004, Zihan Liang 0001, Chenyi Lei, Han Li 0005 |
CIKM | 7 |
| 2025 | UniECS: Unified Multimodal E-Commerce Search Framework with Gated Cross-modal FusionabstractThe growth of e-commerce has created substantial demand for multimodal search systems that process diverse visual and textual inputs. Current e-commerce multimodal retrieval systems face two key limitations: they optimize for specific tasks with fixed modality pairings, and lack comprehensive benchmarks for evaluating unified retrieval approaches. To address these challenges, we introduce UniECS, a unified multimodal e-commerce search framework that handles all retrieval scenarios across image, text, and their combinations. Our work makes three key contributions. First, we propose a flexible architecture with a novel gated multimodal encoder that uses adaptive fusion mechanisms. This encoder integrates different modality representations while handling missing modalities. Second, we develop a comprehensive training strategy to optimize learning. It combines cross-modal alignment loss (CMAL), cohesive local alignment loss (CLAL), intra-modal contrastive loss (IMCL), and adaptive loss weighting. Third, we create M-BEER, a carefully curated multimodal benchmark containing 50K product pairs for e-commerce search evaluation. Extensive experiments demonstrate that UniECS consistently outperforms existing methods across four e-commerce benchmarks with fine-tuning or zero-shot evaluation. On our M-BEER bench, UniECS achieves substantial improvements in cross-modal tasks (up to 28% gain in R@10 for text-to-image retrieval) while maintaining parameter efficiency (0.2B parameters) compared to larger models like GME-Qwen2VL (2B) and MM-Embed (8B). Furthermore, we deploy UniECS in the e-commerce search platform of Kuaishou Inc. across two search scenarios, achieving notable improvements in Click-Through Rate (+2.74%) and Revenue (+8.33%). The comprehensive evaluation demonstrates the effectiveness of our approach in both experimental and real-world settings. Corresponding codes, models and datasets will be made publicly available at https://github.com/qzp2018/UniECS. Zihan Liang 0001, Yufei Ma 0011, Zhipeng Qian, Huangyu Dai, Ben Chen 0004, Chenyi Lei, Yuqing Ding, Han Li 0005 |
CIKM | 7 |
| 2025 | Mitigating Redundancy in Deep Recommender Systems: A Field Importance Distribution PerspectiveabstractIn the realm of recommender systems, accurately predicting Click-Through Rate (CTR) is a critical task that involves learning user-item interaction features. Many researchers propose novel models to mine interaction signals, but they neglect that redundancy itself causes high computational cost and leads to suboptimal performance. Some tried to remove redundancy by dropping useless features, or shrinking the size of embedding table. However, current feature selection methods are vulnerable to training stochasticity and data dynamics, while embedding size assignment techniques neglect the importance relationships between feature fields. The simple combination of the two optimization ways will also yield poor performance due to the inherent gap in their optimization targets. Hence, there is no effective paradigm that can optimize feature fields from the two aspects in a simultaneous and coordinated way. In this paper, we identify the core issue as the lack of a practical score to measure the contribution of feature fields, and propose a distribution-based field optimization framework that adopts importance distribution to provide a comprehensive view for both methods. We innovatively design a learner for each field to acquire the stable and comprehensive importance situation. Then, based on this, we eliminate noise features, and assign adaptive embedding sizes for different feature fields according to the similarity of importance. With this field optimization, our proposed framework has extremely low pre-training overhead, greatly reduces training and inference time, and even achieves more accurate prediction results with fewer feature fields. Xianquan Wang, Likang Wu, Zhi Li 0057, Haitao Yuan 0002, Shuanghong Shen, Huibo Xu, Yu Su 0002, Chenyi Lei |
KDD (1) | 8 |
| 2025 | Lasso: Large Language Model-based User Simulator for Cross-Domain Recommendation
Susen Yang, Chao Wang 0049, Mingyue Cheng 0004, Chenyi Lei, Han Li 0005 |
RecSys | 6 |
| 2024 | GradCraft: Elevating Multi-task Recommendations through Holistic Gradient CraftingabstractRecommender systems require the simultaneous optimization of multiple objectives to accurately model user interests, necessitating the application of multi-task learning methods. However, existing multi-task learning methods in recommendations overlook the specific characteristics of recommendation scenarios, falling short in achieving proper gradient balance. To address this challenge, we set the target of multi-task learning as attaining the appropriate magnitude balance and the global direction balance, and propose an innovative methodology named GradCraft in response. GradCraft dynamically adjusts gradient magnitudes to align with the maximum gradient norm, mitigating interference from gradient magnitudes for subsequent manipulation. It then employs projections to eliminate gradient conflicts in directions while considering all conflicting tasks simultaneously, theoretically guaranteeing the global resolution of direction conflicts. GradCraft ensures the concurrent achievement of appropriate magnitude balance and global direction balance, aligning with the inherent characteristics of recommendation scenarios. Both offline and online experiments attest to the efficacy of GradCraft in enhancing multi-task performance in recommendations. The source code for GradCraft can be accessed at https://github.com/baiyimeng/GradCraft. Yimeng Bai, Yang Zhang 0072, Fuli Feng, Xiaoxue Zang, Chenyi Lei, Yang Song 0008 |
KDD | 6 |
| 2022 | Scenario-Adaptive and Self-Supervised Model for Multi-Scenario Personalized RecommendationabstractMulti-scenario recommendation is dedicated to retrieve relevant items for users in multiple scenarios, which is ubiquitous in industrial recommendation systems. These scenarios enjoy portions of overlaps in users and items, while the distribution of different scenarios is different. The key point of multi-scenario modeling is to efficiently maximize the use of whole-scenario information and granularly generate adaptive representations both for users and items among multiple scenarios. we summarize three practical challenges which are not well solved for multi-scenario modeling: (1) Lacking of fine-grained and decoupled information transfer controls among multiple scenarios. (2) Insufficient exploitation of entire space samples. (3) Item's multi-scenario representation disentanglement problem. In this paper, we propose a Scenario-Adaptive and Self-Supervised (SASS) model to solve the three challenges mentioned above. Specifically, we design a Multi-Layer Scenario Adaptive Transfer (ML-SAT) module with scenario-adaptive gate units to select and fuse effective transfer information from whole scenario to individual scenario in a quite fine-grained and decoupled way. To sufficiently exploit the power of entire space samples, a two-stage training process including pre-training and fine-tune is introduced. The pre-training stage is based on a scenario-supervised contrastive learning task with the training samples drawn from labeled and unlabeled data spaces. The model is created symmetrically both in user side and item side, so that we can get distinguishing representations of items in different scenarios. Extensive experimental results on public and industrial datasets demonstrate the superiority of the SASS model over state-of-the-art methods. This model also achieves more than 8.0% improvement on Average Watching Time Per User in online A/B tests. SASS has been successfully deployed on multi-scenario short video recommendation platform of Taobao in Alibaba. Yuanliang Zhang, Jinxin Hu, Chenyi Lei, Fei Fang 0002 |
CIKM | 5 |
| 2021 | SEMI: A Sequential Multi-Modal Information Transfer Network for E-Commerce Micro-Video RecommendationsabstractThe micro-video recommendation system becomes an essential part of the e-commerce platform, which helps disseminate micro-videos to potentially interested users. Existing micro-video recommendation methods only focus on users' browsing behaviors on micro-videos, but ignore their purchasing intentions in the e-commerce environment. Thus, they usually achieve unsatisfied e-commerce micro-video recommendation performances. To address this problem, we design a sequential multi-modal information transfer network (SEMI), which utilizes product-domain user behaviors to assist micro-video recommendations. SEMI effectively selects relevant items (i.e., micro-videos and products) with multi-modal features in the micro-video domain and product domain to characterize users' preferences. Moreover, we also propose a cross-domain contrastive learning (CCL) algorithm to pre-train sequence encoders for modeling users' sequential behaviors in these two domains. The objective of CCL is to maximize a lower bound of the mutual information between different domains. We have performed extensive experiments on a large-scale dataset collected from Taobao, a world-leading e-commerce platform. Experimental results show that the proposed method achieves significant improvements over state-of-the-art recommendation methods. Moreover, the proposed method has also been deployed on Taobao, and the online A/B testing results further demonstrate its practical value. Chenyi Lei, Yong Liu 0020, Lingzi Zhang, Guoxin Wang 0002, Haihong Tang, Houqiang Li, Chunyan Miao |
KDD | 1 |
| 2020 | Attention with Long-Term Interval-Based Gated Recurrent Units for Modeling Sequential User Behaviors
Zhao Li 0007, Chenyi Lei, Pengcheng Zou, Donghui Ding, Shichang Hu, Zehong Hu, Shouling Ji, Jianliang Gao |
DASFAA (1) | 2 |
| 2019 | TiSSA: A Time Slice Self-Attention Approach for Modeling Sequential User BehaviorsabstractModeling user behaviors as sequences provides critical advantages in predicting future user actions, such as predicting the next product to purchase or the next song to listen to, for personalized search and recommendation. Recently, recurrent neural networks (RNNs) have been adopted to leverage their power in modeling sequences. However, most of the previous RNN-based work suffers from the complex dependency problem, which may lose the integrity of highly correlated behaviors and may introduce noises derived from unrelated behaviors. In this paper, we propose to integrate a novel Time Slice Self-Attention (TiSSA) mechanism into RNNs for better modeling sequential user behaviors, which utilizes the time-interval-based gated recurrent units to exploit the temporal dimension when encoding user actions, and has a specially designed time slice hierarchical self-attention function to characterize both local and global dependency of user actions, while the final context-aware user representations can be used for downstream applications. We have performed experiments on a huge dataset collected from one of the largest e-commerce platforms in the world. Experimental results show that the proposed TiSSA achieves significant improvement over the state-of-the-art. TiSSA is also adopted in this large e-commerce platform, and the results of online A/B test further indicate its practical value. Chenyi Lei, Shouling Ji, Zhao Li 0007 |
WWW | 1 |