Yansen Zhang

dblp:308/7346 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
7since 2021 · last 2025
0000-0001-8426-8837ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 5 · 2 first-author · 5 since 2021Artificial intelligence and machine learning · 4 · 4 first-author · 4 since 2021
YearPublicationVenuePosition
2025 Decision Information Meets Large Language Models: The Future of Explainable Operations Research
abstract
Operations Research (OR) is vital for decision-making in many industries. While recent OR methods have seen significant improvements in automation and efficiency through integrating Large Language Models (LLMs), they still struggle to produce meaningful explanations. This lack of clarity raises concerns about transparency and trustworthiness in OR applications. To address these challenges, we propose a comprehensive framework, Explainable Operations Research (EOR), emphasizing actionable and understandable explanations accompanying optimization. The core of EOR is the concept of Decision Information, which emerges from what-if analysis and focuses on evaluating the impact of complex constraints (or parameters) changes on decision-making. Specifically, we utilize bipartite graphs to quantify the changes in the OR model and adopt LLMs to improve the explanation capabilities. Additionally, we introduce the first industrial benchmark to rigorously evaluate the effectiveness of explanations and analyses in OR, establishing a new standard for transparency and clarity in the field.
Yansen Zhang, Qingcan Kang, Wing Yin Yu, Hailei Gong, Xiaojin Fu, Xiongwei Han, Tao Zhong 0004, Chen Ma 0001
ICLR1
2025 Shapley Value-driven Data Pruning for Recommender Systems
abstract
Recommender systems often suffer from noisy interactions like accidental clicks or popularity bias. Existing denoising methods typically identify users' intent in their interactions, and filter out noisy interactions that deviate from the assumed intent. However, they ignore that interactions deemed noisy could still aid model training, while some ''clean'' interactions offer little learning value. To bridge this gap, we propose Shapley Value-driven Valuation (SVV), a framework that evaluates interactions based on their objective impact on model training rather than subjective intent assumptions. In SVV, a real-time Shapley value estimation method is devised to quantify each interaction's value based on its contribution to reducing training loss. Afterward, SVV highlights the interactions with high values while downplaying low ones to achieve effective data pruning for recommender systems. In addition, we develop a simulated noise protocol to examine the performance of various denoising approaches systematically. Experiments on four real-world datasets show that SVV outperforms existing denoising methods in both accuracy and robustness. Further analysis also demonstrates that our SVV can preserve training-critical interactions and offer interpretable noise assessment. This work shifts denoising from heuristic filtering to principled, model-driven interaction valuation.
Yansen Zhang, Xiaokun Zhang 0001, Ziqiang Cui, Chen Ma 0001
KDD (2)1
2025 Counterfactual Multi-player Bandits for Explainable Recommendation Diversification
Yansen Zhang, Bowei He, Xiaokun Zhang 0001, Haolun Wu, Zexu Sun, Chen Ma 0001
ECML/PKDD (6)1
2025 Hierarchical Gating Network for Cross-Domain Sequential Recommendation
abstract
Cross-domain sequential recommendation (CDSR) utilizes data from multiple domains to recommend the user’s next interaction based on his latest interaction sequence. Currently, many cross-domain sequential recommendation algorithms have been proven to achieve good recommendation performance. However, these algorithms overlook the influence of users’ long-term behavioral patterns and general interests when extracting their current preferences. In this article, we propose a Hierarchical Gating Network for Cross-Domain Sequential Recommendation (HGNCDSR). Specifically, we simultaneously train single-domain and cross-domain interaction sequences, utilizing a hierarchical gating network to capture user interest representations in single-domain and cross-domain, respectively. A feature gating and an instance gating are applied respectively to extract user interests at item feature level and instance level. While learning current preferences from behavior sequences, user representations that reflect behavioral patterns and general interests are simultaneously learned and strengthened. Additionally, we employ the item–item product to model the relationships between candidate items and those in the interaction sequence. Both current interests and item relevance are considered simultaneously, integrating single-domain and cross-domain user preferences to predict the user’s next interaction. We design extensive experiments to show that HGNCDSR has better recommendation performance than other state-of-the-art models.
Shuliang Wang 0001, Jiabao Zhu, Yi Wang 0132, Chen Ma 0001, Wayne Xin Zhao, Yansen Zhang, Ziqiang Yuan, Sijie Ruan
ACM Trans. Inf. Syst.6
2024 Result Diversification in Search and Recommendation: A Survey
abstract
Diversifying return results is an important research topic in retrieval systems in order to satisfy both the various interests of customers and the equal market exposure of providers. There has been growing attention on diversity-aware research during recent years, accompanied by a proliferation of literature on methods to promote diversity in search and recommendation. However, diversity-aware studies in retrieval systems lack a systematic organization and are rather fragmented. In this survey, we are the first to propose a unified taxonomy for classifying the metrics and approaches of diversification in both search and recommendation, which are two of the most extensively researched fields of retrieval systems. We begin the survey with a brief discussion of why diversity is important in retrieval systems, followed by a summary of the various diversity concerns in search and recommendation, highlighting their relationship and differences. For the survey's main body, we present a unified taxonomy of diversification metrics and approaches in retrieval systems, from both the search and recommendation perspectives. In the later part of the survey, we discuss the open research questions of diversity-aware research in search and recommendation in an effort to inspire future innovations and encourage the implementation of diversity in real-world systems.
Haolun Wu, Yansen Zhang, Chen Ma 0001, Fuyuan Lyu, Bowei He, Bhaskar Mitra 0001, Xue (Steve) Liu
IEEE Trans. Knowl. Data Eng.2
2022 Learning to Infer User Implicit Preference in Conversational Recommendation
abstract
Conversational recommender systems (CRS) enable traditional recommender systems to interact with users by asking questions about attributes and recommending items. The attribute-level and item-level feedback of users can be utilized to estimate users' preferences. However, existing works do not fully exploit the advantage of explicit item feedback --- they only use the item feedback in rather implicit ways such as updating the latent user and item representation. Since CRS has multiple chances to interact with users, leveraging the context in the conversation may help infer users' implicit feedback (e.g., some specific attributes) when recommendations get rejected. To address the limitations of existing methods, we propose a new CRS framework called Conversational Recommender with Implicit Feedback (CRIF). CRIF formulates the conversational recommendation scheme as a four-phase process consisting of offline representation learning, tracking, decision, and inference. In the inference module, by fully utilizing the relation between users' attribute-level and item-level feedback, our method can explicitly deduce users' implicit preferences. Therefore, CRIF is able to achieve more accurate user preference estimation. Besides, in the decision module, to better utilize the attribute-level and item-level feedback, we adopt inverse reinforcement learning to learn a flexible decision strategy that selects the suitable action at each conversation turn. Through extensive experiments on four benchmark CRS datasets, we validate the effectiveness of our approach, which significantly outperforms the state-of-the-art CRS methods.
Chenhao Hu, Shuhua Huang, Yansen Zhang
SIGIR3
2021 Self-adaptive Graph Neural Networks for Personalized Sequential Recommendation
Yansen Zhang, Chenhao Hu, Genan Dai, Weiyang Kong
ICONIP (2)1