VLDB 2026 Research / reviewers in the wild / expert
Ruidong Han
dblp:225/2691
· DBLP profile ↗
9ranked-venue papers in the field
2as first author
9since 2021 · last 2026
—ORCID · conflict
Domains — venue-derived; a paper can count in several
Information Retrieval & Web Search · 6 (2 first)Data Mining & Knowledge Discovery · 3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Beyond Persuasiveness: A User-Centric Evaluation Framework of Explanations for Food Recommendation
Yurou Zhao, Ruidong Han, Fei Jiang 0009, Wei Lin 0022, Jiaxin Mao |
ECIR (2) | 3 |
| 2026 | MTGenRec: An Efficient Distributed Training System for Generative Recommendation Models in MeituanabstractRecommendation is crucial for both user experience and company revenue in Meituan as a leading lifestyle company, and generative recommendation models (GRMs) are shown to produce quality recommendations recently. However, existing systems are limited by insufficient functionality support and inefficient implementations for training GRMs in industrial scenarios. As such, we introduce MTGenRec as an efficient and scalable system for GRM training. Specifically, to handle real-time insertions/deletions of sparse embeddings, MTGenRec employs dynamic hash tables to replace static ones. To improve training efficiency, MTGenRec conducts dynamic sequence balancing to address the computation load imbalances among GPUs and adopts feature ID deduplication alongside automatic table merging to accelerate embedding lookup. Extensive experiments show that MTGenRec improves training throughput by 1.6x - 2.4x while achieving good scalability when running over 100 GPUs. MTGenRec has been deployed for many applications in Meituan and is now handling hundreds of millions of requests on a daily basis. On the delivery platform, we observe a 1.22% growth in user order volume and a 1.31% enhancement in online PV_CTR. Yuxiang Wang 0013, Xiao Yan 0002, Mincong Huang, Ruidong Han, Bin Yin 0004, Shangyu Chen, Xiang Li 0067, Fei Jiang 0009, Wei Lin 0022, Haowei Han, Xiaokai Zhou, Bo Du 0001, Jiawei Jiang 0001 |
KDD (1) | 6 |
| 2025 | MTGR: Industrial-Scale Generative Recommendation Framework in MeituanabstractScaling law has recently been validated in the recommendation system, adopting generative recommendation strategies to achieve scalability. However, these generative approaches require abandoning the meticulously constructed cross features of traditional recommendation models,leading to a significant decline in model performance. To address this challenge, we propose Meituan Generative Recommendation, which is based on the HSTU architecture and is capable of retaining the original deep learning recommendation model (DLRM) features, including cross features. Additionally, MTGR achieves training and inference acceleration through user-level compression to ensure efficient scaling. We also propose Group-Layer Normalization (GLN) to enhance the performance of encoding within different semantic spaces and the dynamic masking strategy to avoid information leakage. We further optimize the training frameworks, enabling support for our models with 10 to 100 times computational complexity compared to the DLRM, without significant cost increases. MTGR achieved 65x FLOPs for single-sample forward inference compared to the DLRM model, resulting in the largest gain in nearly two years both offline and online. This breakthrough was successfully deployed on Meituan, the world's largest food delivery platform, where it has been handling the main traffic. Ruidong Han, Bin Yin 0004, Shangyu Chen, Fei Jiang 0009, Xiang Li 0067, Mincong Huang, Chunzhen Jing, Yueming Han, MengLei Zhou, Wei Lin 0022 |
CIKM | 1 |
| 2025 | A Soft-partitioned Semi-supervised Collaborative Transfer Learning Approach for Multi-Domain Recommendationabstractn industrial practice, Multi-domain Recommendation (MDR) plays a crucial role. Shared-specific architectures are widely used in industrial solutions to capture shared and unique attributes via shared and specific parameters. However, with imbalanced data across different domains, these models face two key issues: (1) Overwhelming: Dominant domain data skews model performance, neglecting non-dominant domains. (2) Overfitting: Sparse data in non-dominant domains leads to overfitting in specific parameters. To tackle these challenges, we propose Soft-partitioned Semi-supervised Collaborative Transfer Learning (SSCTL) for multi-domain recommendation. SSCTL generates dynamic parameters to address the overwhelming issue, thus shifting focus towards samples from non-dominant domains. To combat overfitting, it leverages pseudo-labels with weights from dominant domain instances to enhance non-dominant domain data. We conduct comprehensive experiments, both online and offline, to validate the efficacy of our proposed method. Online tests yielded significant improvements across various domains, with increases in GMV ranging from 0.54% to 2.90% and enhancements in CTR ranging from 0.22% to 1.69%. Yiqing Wu, Ruidong Han, Fuzhen Zhuang, Xiang Li 0067, Wei Lin 0022 |
CIKM | 3 |
| 2024 | Enhancing CTR Prediction through Sequential Recommendation Pre-training: Introducing the SRP4CTR frameworkabstractIn sequential recommendation, pre-training from user historical behaviors through self-supervised learning can better comprehend user dynamic preferences, presenting the potential for direct integration with Click-Through Rate (CTR) prediction tasks. Previous methods have integrated pre-trained models into downstream tasks with the sole purpose of extracting semantic information or well-represented user features, which are then incorporated as new features. However, these approaches tend to ignore the additional inference costs and do not consider how to transfer the effective information from the pre-trained models for specific estimated items in CTR prediction. In this paper, we propose a Sequential Recommendation Pre-training framework for CTR prediction (SRP4CTR) to tackle the above problems. Initially, we discuss the impact of introducing pre-trained models on inference costs. Subsequently, we introduced a pre-trained method to encode sequence side information concurrently. During the fine-tuning process, we incorporate a cross-attention block to establish a bridge between estimated items and the pre-trained model at a low cost. Moreover, we develop a querying transformer technique to facilitate the knowledge transfer from the pre-trained model. Offline and online experiments show that our method outperforms previous baseline models. Ruidong Han, Qianzhong Li, Rui Li 0044, Yurou Zhao, Xiang Li 0067, Wei Lin 0022 |
CIKM | 1 |
| 2024 | Aligning Explanations for Recommendation with Rating and Feature via Maximizing Mutual InformationabstractProviding natural language-based explanations to justify recommendations helps to improve users' satisfaction and gain users' trust. However, as current explanation generation methods are commonly trained with an objective to mimic existing user reviews, the generated explanations are often not aligned with the predicted ratings or some important features of the recommended items, and thus, are suboptimal in helping users make informed decision on the recommendation platform. To tackle this problem, we propose a flexible model-agnostic method named MMI (Maximizing Mutual Information) framework to enhance the alignment between the generated natural language explanations and the predicted rating/important item features. Specifically, we propose to use mutual information (MI) as a measure for the alignment and train a neural MI estimator. Then, we treat a well-trained explanation generation model as the backbone model and further fine-tune it through reinforcement learning with guidance from the MI estimator, which rewards a generated explanation that is more aligned with the predicted rating or a pre-defined feature of the recommended item. Experiments on three datasets demonstrate that our MMI framework can boost different backbone models, enabling them to outperform existing baselines in terms of alignment with predicted ratings and item features. Additionally, user studies verify that MI-enhanced explanations indeed facilitate users' decisions and are favorable compared with other baselines due to their better alignment properties. Yurou Zhao, Ruidong Han, Fei Jiang 0009, Lu Guan, Xiang Li 0067, Wei Lin 0022, Weizhi Ma, Jiaxin Mao |
CIKM | 3 |
| 2024 | Unified Dual-Intent Translation for Joint Modeling of Search and RecommendationabstractRecommendation systems, which assist users in discovering their preferred items among numerous options, have served billions of users across various online platforms. Intuitively, users' interactions with items are highly driven by their unchanging inherent intents (e.g., always preferring high-quality items) and changing demand intents (e.g., wanting a T-shirt in summer but a down jacket in winter). However, both types of intents are implicitly expressed in recommendation scenario, posing challenges in leveraging them for accurate intent-aware recommendations. Fortunately, in search scenario, often found alongside recommendation on the same online platform, users express their demand intents explicitly through their query words. Intuitively, in both scenarios, a user shares the same inherent intent and the interactions may be influenced by the same demand intent. It is therefore feasible to utilize the interaction data from both scenarios to reinforce the dual intents for joint intent-aware modeling. But the joint modeling should deal with two problems: 1) accurately modeling users' implicit demand intents in recommendation; 2) modeling the relation between the dual intents and the interactive items. To address these problems, we propose a novel model named Unified Dual-Intents Translation for joint modeling of Search and Recommendation (UDITSR). To accurately simulate users' demand intents in recommendation, we utilize real queries from search data as supervision information to guide its generation. To explicitly model the relation among the triplet , we propose a dual-intent translation propagation mechanism to learn the triplet in the same semantic space via embedding translations. Extensive experiments demonstrate that UDITSR outperforms SOTA baselines both in search and recommendation tasks. Yuting Zhang 0010, Yiqing Wu, Ruidong Han, Ying Sun 0006, Yongchun Zhu, Xiang Li 0067, Wei Lin 0022, Fuzhen Zhuang, Zhulin An, Yongjun Xu 0001 |
KDD | 3 |
| 2023 | Modeling Dual Period-Varying Preferences for Takeaway RecommendationabstractTakeaway recommender systems, which aim to accurately provide stores that offer foods meeting users' interests, have served billions of users in our daily life. Different from traditional recommendation, takeaway recommendation faces two main challenges: (1) Dual Interaction-Aware Preference Modeling. Traditional recommendation commonly focuses on users' single preferences for items while takeaway recommendation needs to comprehensively consider users' dual preferences for stores and foods. (2) Period-Varying Preference Modeling. Conventional recommendation generally models continuous changes in users' preferences from a session-level or day-level perspective. However, in practical takeaway systems, users' preferences vary significantly during the morning, noon, night, and late night periods of the day. To address these challenges, we propose a Dual Period-Varying Preference modeling (DPVP) for takeaway recommendation. Specifically, we design a dual interaction-aware module, aiming to capture users' dual preferences based on their interactions with stores and foods. Moreover, to model various preferences in different time periods of the day, we propose a time-based decomposition module as well as a time-aware gating mechanism. Extensive offline and online experiments demonstrate that our model outperforms state-of-the-art methods on real-world datasets and it is capable of modeling the dual period-varying preferences. Moreover, our model has been deployed online on Meituan Takeaway platform, leading to an average improvement in GMV (Gross Merchandise Value) of 0.70%. Yuting Zhang 0010, Yiqing Wu, Ran Le, Yongchun Zhu, Fuzhen Zhuang, Ruidong Han, Xiang Li 0067, Wei Lin 0022, Zhulin An, Yongjun Xu 0001 |
KDD | 6 |
| 2023 | CEC: Towards Learning Global Optimized Recommendation through Causality Enhanced Conversion ModelabstractMost e-commerce platforms consist of multiple entries (e.g., recommendation, search, shopping cart and etc.) for users to purchase their liked items. Among the research on the recommendation entry, most of them focus on improving the conversion volumes merely in the recommendation entry. However, such way could not ensure an increase in the global conversion volumes of the e-commerce platform. To achieve this goal by optimizing the recommendation entry only, in this paper, we focus on modeling the causality between the recommendation-entry-impression and the conversion by proposing the two-stage Causality Enhanced Conversion (CEC) model. In the first stage, we define the recommendation-entry-impression as treatment, then we estimate the conversion rate conditioned on the inclusion or exclusion of treatment respectively and calculate the corresponding individual treatment effect (ITE). In the second stage, we propose a propensity-normalization (PN) based method to transform the learned ITE to a weight term for instance weighting in the conversion loss. Extensive offline and online experiments on a large-scale food e-commerce scenario demonstrate that the CEC model could focus more on those conversed instances that can improve the global conversion volumes of the platform. Ran Le, Guoqing Jiang, Xiufeng Shu, Ruidong Han, Qianzhong Li, Xiang Li 0067, Wei Lin 0022 |
SIGIR | 4 |