EDBT 2026 Demo / reviewers in the wild / expert
Chengkai Huang
dblp:143/1036
· DBLP profile ↗
13ranked-venue papers in the field
4as first author
12since 2021 · last 2026
0000-0002-1630-424XORCID · corroborated
Domains — venue-derived; a paper can count in several
Information Retrieval & Web Search · 11 (4 first)Data Mining & Knowledge Discovery · 2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Federated Large Language Models: Current Progress and Future Directions
Yuhang Yao 0003, Junda Wu, Chengkai Huang, Yu Xia 0007, Tong Yu 0001, Ruiyi Zhang 0002, Sungchul Kim, Ryan Rossi, Ang Li 0005, Lina Yao 0001, Julian J. McAuley, Yiran Chen 0001, Carlee Joe-Wong |
PAKDD (4) | 4 |
| 2026 | Factorized Latent Reasoning for LLM-based RecommendationabstractLarge language models (LLMs) have recently been adopted for recommendation by framing user preference modeling as a language generation problem. However, existing latent reasoning approaches typically represent user intent with a single latent vector, which struggles to capture the inherently multi-faceted nature of user preferences. We propose Factorized Latent Reasoning (FLR), a novel framework for LLM-based sequential recommendation that decomposes latent reasoning into multiple disentangled preference factors. FLR introduces a lightweight multi-factor attention module that iteratively refines a latent thought representation, where each factor attends to distinct aspects of the user's interaction history. To encourage diversity and specialization, we design orthogonality, attention diversity, and sparsity regularization objectives, and dynamically aggregate factor contributions for the final prediction. We further integrate FLR with an efficient reinforcement learning strategy based on group-relative policy optimization, enabling stable alignment directly in the latent reasoning space. Experiments on multiple benchmarks show that FLR consistently outperforms strong baselines while improving robustness and interpretability. Our data and code are available at https://github.com/ToAdventure/FLR. Tianqi Gao, Chengkai Huang, Cao Liu, Lina Yao 0001 |
SIGIR | 2 |
| 2026 | Purifying Multimodal Retrieval: Fragment-Level Evidence Selection for RAG
Xihang Wang, Chengkai Huang, Cao Liu, Quan Z. Sheng, Lina Yao 0001 |
SIGIR | 3 |
| 2026 | MEG-RAG: Quantifying Multi-modal Evidence Grounding for Evidence Selection in RAGabstractMultimodal Retrieval-Augmented Generation (MRAG) addresses key limitations of Multimodal Large Language Models (MLLMs), such as hallucination and outdated knowledge. However, current MRAG systems struggle to distinguish whether retrieved multimodal data truly supports the semantic core of an answer or merely provides superficial relevance. Existing metrics often rely on heuristic position-based confidence, which fails to capture the informational density of multimodal entities. To address this, we propose Multi-modal Evidence Grounding (MEG), a semantic-aware metric that quantifies the contribution of retrieved evidence. Unlike standard confidence measures, MEG utilizes Semantic Certainty Anchoring, which dynamically filters out high-frequency stopwords via Inverse Document Frequency (IDF) to focus strictly on information-bearing tokens. Building on MEG, we introduce MEG-RAG, a framework that trains a multimodal reranker to align retrieved evidence with the semantic anchors of the ground truth. By prioritizing high-value content based on semantic grounding rather than token probability distributions, MEG-RAG improves the accuracy and multimodal consistency of generated outputs. Extensive experiments on the ??2RAG benchmark show that MEG-RAG consistently outperforms strong baselines and demonstrates robust generalization across different teacher models. The data and code are available at here. Xihang Wang, Chengkai Huang, Quan Z. Sheng, Lina Yao 0001 |
SIGIR | 3 |
| 2026 | Dual Conditional Diffusion for Sequential RecommendationabstractRecent advancements in diffusion models have shown promising results in sequential recommendation (SR). Existing approaches predominantly rely on implicit conditional diffusion models, which compress user behaviors into a single representation during the forward diffusion process. While effective to some extent, this oversimplification often leads to the loss of sequential and contextual information, which is critical for understanding user behavior. Moreover, explicit information, such as user-item interactions or sequential patterns, remains underutilized, despite its potential to directly guide the recommendation process and improve precision. However, combining implicit and explicit information is non-trivial, as it requires dynamically integrating these complementary signals while avoiding noise and irrelevant patterns within user behaviors. To address these challenges, we propose Dual Conditional Diffusion Models for Sequential Recommendation (DCRec), which effectively integrates implicit and explicit information by embedding dual conditions into both the forward and reverse diffusion processes. This allows the model to retain valuable sequential and contextual information while leveraging explicit user-item interactions to guide the recommendation process. Specifically, we introduce the Dual Conditional Diffusion Transformer (DCDT), which dynamically integrate both implicit and explicit signals throughout the diffusion stages, ensuring contextual understanding and minimizing the influence of irrelevant patterns. Extensive experiments on public benchmark datasets demonstrate that DCRec significantly outperforms state-of-the-art methods. Hongtao Huang, Chengkai Huang, Tong Yu 0001, Xiaojun Chang, Wen Hu 0001, Julian J. McAuley, Lina Yao 0001 |
WSDM | 2 |
| 2026 | PruneRAG: Confidence-Guided Query Decomposition Trees for Efficient Retrieval-Augmented GenerationabstractRetrieval-augmented generation (RAG) has become a powerful framework for enhancing large language models in knowledge-intensive and reasoning tasks. However, as reasoning chains deepen or search trees expand, RAG systems often face two persistent failures: evidence forgetting, where retrieved knowledge is not effectively used, and inefficiency, caused by uncontrolled query expansions and redundant retrieval. These issues reveal a critical gap between retrieval and evidence utilization in current RAG architectures. We propose PruneRAG, a confidence-guided query decomposition framework that builds a structured query decomposition tree to perform stable and efficient reasoning. PruneRAG introduces three key mechanisms: adaptive node expansion that regulates tree width and depth, confidence-guided decisions that accept reliable answers and prune uncertain branches, and fine-grained retrieval that extracts entity-level anchors to improve retrieval precision. Together, these components preserve salient evidence throughout multi-hop reasoning while significantly reducing retrieval overhead. To better analyze evidence misuse, we define the Evidence Forgetting Rate as a metric to quantify cases where golden evidence is retrieved but not correctly used. Extensive experiments across various multi-hop QA benchmarks show that PruneRAG achieves superior accuracy and efficiency over state-of-the-art baselines. The code is publicly available. Shuguang Jiao, Xinyu Xiao, Yunfan Wei, Shuhan Qi, Chengkai Huang, Quan Z. Sheng, Lina Yao 0001 |
WWW | 5 |
| 2026 | Gaussian Mixture Flow Matching with Domain Alignment for Multi-Domain Sequential RecommendationabstractUsers increasingly interact with content across multiple domains, resulting in sequential behaviors marked by frequent and complex transitions. While Cross-Domain Sequential Recommendation (CDSR) models two-domain interactions, Multi-Domain Sequential Recommendation (MDSR) introduces significantly more domain transitions, compounded by challenges such as domain heterogeneity and imbalance. Existing approaches often overlook the intricacies of domain transitions, tend to overfit to dense domains while underfitting sparse ones, and struggle to scale effectively as the number of domains increases. We propose GMFlowRec, an efficient generative framework for MDSR that models domain-aware transition trajectories via Gaussian Mixture Flow Matching. GMFlowRec integrates: (1) a unified dual-masked Transformer to disentangle domain-invariant and domain-specific intents, (2) a Gaussian Mixture flow field to capture diverse behavioral patterns, and (3) a domain-aligned prior to support frequent and sparse transitions. Extensive experiments on JD and Amazon datasets show GMFlowRec achieves up to 44% NDCG@5 improvement over state-of-the-art baselines while maintaining efficiency with a single unified backbone. Our code and data are available here. Xiaoxin Ye, Chengkai Huang, Hongtao Huang, Lina Yao 0001 |
WWW | 2 |
| 2025 | Eliminating Sentiment Bias in Recommender Systems by Counterfactual InferenceabstractSentiment bias is newly discovered in Recommender Systems (RSs). Critical users and niche items are disadvantaged by such unfair recommendations. To mitigate this bias, we propose a novel approach by counterfactual inference, which is implemented in two stages. Experiment results validate that our model achieves comparable performance in rating prediction, providing better recommendations and effectively mitigating sentiment bias. To the best of our knowledge, this is the first work to employ counterfactual inference on sentiment bias mitigation in RSs. Le Pan, Yuanjiang Cao, Chengkai Huang, Wenjie Zhang 0001, Lina Yao 0001 |
CIKM | 3 |
| 2025 | A Tutorial on Agentic LLM for Recommender Systems
Chengkai Huang, Junda Wu, Tong Yu 0001, Julian J. McAuley, Lina Yao 0001 |
RecSys | 1 |
| 2023 | Contrastive Counterfactual Learning for Causality-aware Interpretable Recommender SystemsabstractThe field of generating recommendations within the framework of causal inference has seen a recent surge.This approach enhances insights into the influence of recommendations on user behavior and helps in identifying the underlying factors. Existing research has often leveraged propensity scores to mitigate bias, albeit at the risk of introducing additional variance. Others have explored the use of unbiased data from randomized controlled trials, although this comes with assumptions that may prove challenging in practice. In this paper, we first present the causality-aware interpretation of recommendations and reveal how the underlying exposure mechanism can bias the maximum likelihood estimation (MLE) of observational feedback. Recognizing that confounders may be elusive, we propose a contrastive self-supervised learning to minimize exposure bias, employing inverse propensity scores and expanding the positive sample set. Building on this foundation, we present a novel contrastive counterfactual learning method (CCL) that incorporates three unique positive sampling strategies grounded in estimated exposure probability or random counterfactual samples. Through extensive experiments on two real-world datasets, we demonstrate that our CCL outperforms the state-of-the-art methods. Guanglin Zhou, Chengkai Huang, Xiaocong Chen, Xiwei Xu 0001, Chen Wang 0008, Liming Zhu 0001, Lina Yao 0001 |
CIKM | 2 |
| 2023 | Dual Contrastive Transformer for Hierarchical Preference Modeling in Sequential RecommendationabstractSequential recommender systems (SRSs) aim to predict the subsequent items which may interest users via comprehensively modeling users' complex preference embedded in the sequence of user-item interactions. However, most of existing SRSs often model users' single low-level preference based on item ID information while ignoring the high-level preference revealed by item attribute information, such as item category. Furthermore, they often utilize limited sequence context information to predict the next item while overlooking richer inter-item semantic relations. To this end, in this paper, we proposed a novel hierarchical preference modeling framework to substantially model the complex low- and high-level preference dynamics for accurate sequential recommendation. Specifically, in the framework, a novel dual-transformer module and a novel dual contrastive learning scheme have been designed to discriminatively learn users' low- and high-level preference and to effectively enhance both low- and high-level preference learning respectively. In addition, a novel semantics-enhanced context embedding module has been devised to generate more informative context embedding for further improving the recommendation performance. Extensive experiments on six real-world datasets have demonstrated both the superiority of our proposed method over the state-of-the-art ones and the rationality of our design. Chengkai Huang, Shoujin Wang, Xianzhi Wang 0001, Lina Yao 0001 |
SIGIR | 1 |
| 2023 | Modeling Temporal Positive and Negative Excitation for Sequential RecommendationabstractSequential recommendation aims to predict the next item which interests users via modeling their interest in items over time. Most of the existing works on sequential recommendation model users’ dynamic interest in specific items while overlooking users’ static interest revealed by some static attribute information of items, e.g., category, brand. Moreover, existing works often only consider the positive excitation of a user’s historical interactions on his/her next choice on candidate items while ignoring the commonly existing negative excitation, resulting in insufficiently modeling dynamic interest. The overlook of static interest and negative excitation will lead to incomplete interest modeling and thus impedes the recommendation performance. To this end, in this paper, we propose modeling both static interest and negative excitation for dynamic interest to further improve the recommendation performance. Accordingly, we design a novel Static-Dynamic Interest Learning (SDIL) framework featured with a novel Temporal Positive and Negative Excitation Modeling (TPNE) module for accurate sequential recommendation. TPNE is specially designed for comprehensively modeling dynamic interest based on temporal positive and negative excitation learning. Extensive experiments on three real-world datasets show that SDIL can effectively capture both static and dynamic interest and outperforms state-of-the-art baselines. Chengkai Huang, Shoujin Wang, Xianzhi Wang 0001, Lina Yao 0001 |
WWW | 1 |
| 2020 | Explore instance similarity: An instance correlation based hashing method for multi-label cross-model retrieval
Chengkai Huang, Jiajia Zhang 0001, Qing Liao 0001, Xuan Wang 0002, Zoe Lin Jiang, Shuhan Qi |
Inf. Process. Manag. | 1 |