VLDB 2026 Research / reviewers in the wild / expert
Shuaiyang Li 0001
dblp:278/3111-1
· DBLP profile ↗
7ranked-venue papers
3as first author
7since 2021 · last 2026
0000-0002-7004-7029ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 3 · 2 first-author · 3 since 2021Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Bidirectional Counterfactual Distillation for Review-Based RecommendationabstractReview-based recommendation methods typically integrate multiple behaviors, including interactions, reviews, and ratings, to model user preferences. To effectively extract preference signals from diverse behaviors, some studies train multiple student models to capture distinct behavioral patterns, and leverage online distillation to facilitate collaborative learning among them. However, we argue that these techniques suffer from bias contamination from rating distributions and feature homogenization during cross-behavior knowledge transfer: (1) Rating distribution bias, arising from non-uniform historical ratings, propagates across behaviors through distillation, contaminating the true preference representations of other behaviors. (2) Static distillation strategies often lead to homogenized behavioral features, hindering the learning of behavior-specific preferences. To address these issues, we propose a novel Bidirectional Counterfactual Distillation (BiCoD) framework for review-based recommendation. In BiCoD, we first design an adversarial counterfactual distillation module to suppress the impact of non-uniform rating distributions on distillation, thereby preventing it from contaminating the user's true preference representations across behaviors. Subsequently, we introduce a stage-aware bidirectional distillation strategy to enhance the distinctiveness of behavioral features, facilitating the effective learning of behavior-specific preferences. Extensive experiments on five real-world datasets validate the effectiveness and superiority of the proposed framework. Sheng Sang, Shujie Li 0002, Shuaiyang Li 0001, Kang Liu 0024, Wei Jia 0001, Dan Guo 0001, Feng Xue 0002 |
AAAI | 3 |
| 2026 | Cross-modal feature disentangling via bidirectional distillation for multimodal recommendation
Shuaiyang Li 0001, Kang Liu 0024, Shujie Li 0002, Dan Guo 0001, Feng Xue 0002 |
Expert Syst. Appl. | 1 |
| 2026 | ACD: Adversarial Counterfactual Distillation for Rating Prediction in RecommendationabstractRating prediction is a classic task in recommendation systems, aiming to accurately estimate user ratings for various items. Historical ratings typically exhibit a non-uniform distribution, leading recommendation models to favor predicting high-frequency ratings. We refer to the inconsistency between predicted ratings and users' true preferences caused by non-uniform rating distributions asrating bias. To mitigate this bias, existing studies capture various interaction behavior patterns and employ knowledge distillation techniques to improve the network's ability to model user preferences. However, due to the model being trained on datasets with non-uniform rating distributions, the rating bias may propagate through the knowledge distillation process across different behaviors, thereby contaminating the modeling of users' true preferences. To this end, we propose a novelAdversarial Counterfactual Distillation(ACD) framework for the rating prediction task, aimed at eliminating rating bias. Specifically, we design aCounterfactual Distillation Modulefrom a causal reasoning perspective to facilitate knowledge transfer across various interaction behaviors while concurrently mitigating bias contamination. Furthermore, we introduce anAdversarial Debiasing Moduleto dynamically adjust the debiasing strength, ensuring that the model maintains an optimal balance between effective knowledge transfer and bias mitigation. Extensive experiments demonstrate the superior performance of our proposed ACD framework. The complete code is publicly available athttps://github.com/hfutmars/ACD. Sheng Sang, Feng Xue 0002, Shuaiyang Li 0001, Kang Liu 0024, Richang Hong |
IEEE Trans. Knowl. Data Eng. | 3 |
| 2025 | REDGCN: Rating-Oriented Explicit Disentangling Graph Convolution Network for Review-Aware RecommendationabstractRating prediction is a challenging task in review-aware recommendation. Although current methods effectively combine collaborative signals with review data, they fail to differentiate user preferences across various ratings and overlook the independence between these ratings. In this article, we emphasize the importance of independence modeling among representations for different rating levels. To this end, we propose a rating-oriented explicit disentangling graph convolution network for review-aware recommendation, short for REDGCN. Specifically, we introduce a rating-oriented disentangled representation learning that segments representations and rating graph based on ratings. It also employs an explicit graph learning approach to ensure the independence of disentangled representations during information propagation, which mitigates noise from review features. Furthermore, we define and model one kind of cross-rating correlation, based on the characteristics of user rating behavior. By leveraging this approach, we introduce a cross-rating constraint as an additional task to further enhance the independence among disentangled representations and improve the stability of model training. We conduct extensive experiments on six public datasets to prove the effectiveness of REDGCN. The complete data and codes of REDGCN are available athttps://github.com/hfutmars/REDGCN. Sheng Sang, Feng Xue 0002, Kang Liu 0024, Shuaiyang Li 0001, Richang Hong |
IEEE Trans. Comput. Soc. Syst. | 5 |
| 2024 | Multimodal Hierarchical Graph Collaborative Filtering for Multimedia-Based RecommendationabstractMultimedia-based recommendation (MMRec) is a challenging task, which goes beyond the collaborative filtering (CF) schema that only captures collaborative signals from interactions and explores multimodal user preference cues hidden in complex multimedia content. Despite the significant progress of current solutions for MMRec, we argue that they are limited by multimodal noise contamination. Specifically, a considerable amount of preference-irrelevant multimodal noise (e.g., the background, layout, and brightness in the image of the product) is incorporated into the representation learning of items, which contaminates the modeling of multimodal user preferences. Moreover, most of the latest researches are based on graph convolution networks (GCNs), which means that multimodal noise contamination is further amplified because noisy information is continuously propagated over the user–item interaction graph as recursive neighbor aggregations are performed. To address this problem, instead of the common MMRec paradigm which learns user preferences in an integrated manner, we propose a hierarchical framework to separately learn collaborative signals and multimodal preferences cues, thus preventing multimodal noise from flowing into collaborative signals. Then, to alleviate the noise contamination for multimodal user preference modeling, we propose to extract semantic entities from multimodal content that are more relevant to user interests, which can model semantic-level multimodal preferences and thus remove a large fraction of noise. Furthermore, we use the full multimodal features to model content-level multimodal preferences like the existing MMRec solutions, which ensures the sufficient utilization of multimodal information. Overall, we develop a novel model, multimodal hierarchical graph CF (MHGCF), which consists of three types of GCN modules tailored to capture collaborative signals, semantic-level preferences, and content-level preferences, respectively. We conduct extensive experiments to demonstrate the effectiveness of MHGCF and its components. The complete data and codes of MHGCF are available athttps://github.com/hfutmars/MHGCF. Kang Liu 0024, Feng Xue 0002, Shuaiyang Li 0001, Sheng Sang, Richang Hong |
IEEE Trans. Comput. Soc. Syst. | 3 |
| 2024 | Multimodal Graph Causal Embedding for Multimedia-Based RecommendationabstractMultimedia-based recommendation (MMRec) models typically rely on observed user-item interactions and the multimodal content of items, such as visual images and textual descriptions, to predict user preferences. Among these, the user's preference for the displayed multimodal content of items is crucial for interacting with a particular item. We argue that users' preference behaviors (i.e., user-item interactions) for the modality content of items, beyond stemming from their real interest in the modality content, may also be influenced by their conformity to the popularity of items' modality-specific content (e.g., a user might be motivated to interact with a lipstick due to enthusiastic discussions among other users regarding textual reviews of the product). In essence, user-item interactions are jointly triggered by real interest and conformity. However, most existing MMRec models primarily concentrate on modeling users' interest preferences when capturing multimodal user preferences, neglecting the modeling of their conformity preferences, which results in sub-optimal recommendation performance. In this work, we resort to causal theory to propose a novel MMRec model, termed Multimodal Graph Causal Embedding (MGCE), revealing insights into the crucial causal relations of users' modality-specific interest and conformity in interaction behaviors within MMRec scenarios. Inspired by the colliding effect in causal inference and integrating the characteristics of real interest and conformity, we devise multimodal causal embedding learning networks to facilitate the learning of high-quality causal embeddings (multimodal interest and multimodal conformity embeddings) from both the structure-level and feature-level, yielding state-of-the-art performance. Extensive experimental results on three datasets demonstrate the effectiveness of MGCE. Shuaiyang Li 0001, Feng Xue 0002, Kang Liu 0024, Dan Guo 0001, Richang Hong |
IEEE Trans. Knowl. Data Eng. | 1 |
| 2023 | Multimodal Counterfactual Learning Network for Multimedia-based RecommendationabstractMultimedia-based recommendation (MMRec) utilizes multimodal content (images, textual descriptions, etc.) as auxiliary information on historical interactions to determine user preferences. Most MMRec approaches predict user interests by exploiting a large amount of multimodal contents of user-interacted items, ignoring the potential effect of multimodal content of user-uninteracted items. As a matter of fact, there is a small portion of user preference-irrelevant features in the multimodal content of user-interacted items, which may be a kind of spurious correlation with user preferences, thereby degrading the recommendation performance. In this work, we argue that the multimodal content of user-uninteracted items can be further exploited to identify and eliminate the user preference-irrelevant portion inside user-interacted multimodal content, for example by counterfactual inference of causal theory. Going beyond multimodal user preference modeling only using interacted items, we propose a novel model called Multimodal Counterfactual Learning Network (MCLN), in which user-uninteracted items' multimodal content is additionally exploited to further purify the representation of user preference-relevant multimodal content that better matches the user's interests, yielding state-of-the-art performance. Extensive experiments are conducted to validate the effectiveness and rationality of MCLN. We release the complete codes of MCLN at https://github.com/hfutmars/MCLN. Shuaiyang Li 0001, Dan Guo 0001, Kang Liu 0024, Richang Hong, Feng Xue 0002 |
SIGIR | 1 |