Shiqi Wang 0018

dblp:314/6015 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
5since 2021 · last 2024
0000-0002-5369-884XORCID · verified

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

Databases, data management, data science and information retrieval · 2 · 2 since 2021Human-computer interaction and ubiquitous computing · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Recommender systems · 100%
Artificial intelligence
1 paper
Reinforcement learning · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems
reinforcement-learning-based recommendation
1.422024
CIRS: Bursting Filter Bubbles by Counterfactual Interactive Recommender System · ACM Trans. Inf. Syst. 2024
Alleviating Matthew Effect of Offline Reinforcement Learning in Interactive Recommendation · SIGIR 2023
Recommender systems › fairness and bias
filter bubble
0.812024
CIRS: Bursting Filter Bubbles by Counterfactual Interactive Recommender System · ACM Trans. Inf. Syst. 2024
Recommender systems
interactive recommendation
0.812024
CIRS: Bursting Filter Bubbles by Counterfactual Interactive Recommender System · ACM Trans. Inf. Syst. 2024
Recommender systems › reinforcement-learning-based recommendation
offline reinforcement learning for recommendation
0.812024
CIRS: Bursting Filter Bubbles by Counterfactual Interactive Recommender System · ACM Trans. Inf. Syst. 2024
Recommender systems
causal recommendation
0.212024
CIRS: Bursting Filter Bubbles by Counterfactual Interactive Recommender System · ACM Trans. Inf. Syst. 2024
Machine learning › Reinforcement learning
offline reinforcement learning
0.212023
Alleviating Matthew Effect of Offline Reinforcement Learning in Interactive Recommendation · SIGIR 2023

Methods — techniques the papers use, named apart from their topics

pessimism relaxation · 1.3model-based offline RL · 1.3entropy-based penalty · 1.3offline reinforcement learning · 0.8causal inference · 0.8
YearPublicationVenuePosition
2024 CIRS: Bursting Filter Bubbles by Counterfactual Interactive Recommender System
abstract
While personalization increases the utility of recommender systems, it also brings the issue offilter bubbles. e.g., if the system keeps exposing and recommending the items that the user is interested in, it may also make the user feel bored and less satisfied. Existing work studies filter bubbles in static recommendation, where the effect of overexposure is hard to capture. In contrast, we believe it is more meaningful to study the issue in interactive recommendation and optimize long-term user satisfaction. Nevertheless, it is unrealistic to train the model online due to the high cost. As such, we have to leverage offline training data and disentangle the causal effect on user satisfaction. To achieve this goal, we propose a counterfactual interactive recommender system (CIRS) that augments offline reinforcement learning (offline RL) with causal inference. The basic idea is to first learn a causal user model on historical data to capture the overexposure effect of items on user satisfaction. It then uses the learned causal user model to help the planning of the RL policy. To conduct evaluation offline, we innovatively create an authentic RL environment (KuaiEnv) based on a real-world fully observed user rating dataset. The experiments show the effectiveness of CIRS in bursting filter bubbles and achieving long-term success in interactive recommendation. The implementation of CIRS is available via https://github.com/chongminggao/ CIRS-codes.
Chongming Gao, Shiqi Wang 0018, Shijun Li 0002, Jiawei Chen 0007, Xiangnan He 0001, Wenqiang Lei, Biao Li 0002, Yuan Zhang 0024, Peng Jiang 0002
ACM Trans. Inf. Syst.2
2023 Dynamic Target User Selection Model for Market Promotion with Multiple Stakeholders
Linxin Guo, Shiqi Wang 0018, Min Gao 0001, Chongming Gao
CollaborateCom (3)2
2023 Alleviating Matthew Effect of Offline Reinforcement Learning in Interactive Recommendation
abstract
Offline reinforcement learning (RL), a technology that offline learns a policy from logged data without the need to interact with online environments, has become a favorable choice in decision-making processes like interactive recommendation. Offline RL faces the value overestimation problem. To address it, existing methods employ conservatism, e.g., by constraining the learned policy to be close to behavior policies or punishing the rarely visited state-action pairs. However, when applying such offline RL to recommendation, it will cause a severe Matthew effect, i.e., the rich get richer and the poor get poorer, by promoting popular items or categories while suppressing the less popular ones. It is a notorious issue that needs to be addressed in practical recommender systems. In this paper, we aim to alleviate the Matthew effect in offline RL-based recommendation. Through theoretical analyses, we find that the conservatism of existing methods fails in pursuing users' long-term satisfaction. It inspires us to add a penalty term to relax the pessimism on states with high entropy of the logging policy and indirectly penalizes actions leading to less diverse states. This leads to the main technical contribution of the work: Debiased model-based Offline RL (DORL) method. Experiments show that DORL not only captures user interests well but also alleviates the Matthew effect. The implementation is available via https://github.com/chongminggao/DORL-codes.
Chongming Gao, Jiawei Chen 0007, Yuan Zhang 0024, Biao Li 0002, Peng Jiang 0002, Shiqi Wang 0018, Zhong Zhang 0004, Xiangnan He 0001
SIGIR7
2023 Who are the Best Adopters? User Selection Model for Free Trial Item Promotion
abstract
With the increasingly fierce market competition, the free trial has been widely applied as an effective incentive strategy to attract users and promote products. By providing opportunities to experience goods without charge, a free trial offers adopters more direct contact with the products and thus raises their willingness to buy. However, as the key point in the promotion process, how to select proper adopters is rarely explored. Empirically winnowing users by their static demographic attributes is feasible but less effective due to the lack of consideration of personalized demands. In this work, we propose SMILE – a tailored free trial user selection model for finding the best adopters promptly. Based on the reinforcement learning (RL) technique, SMILE can consider long-run profits and rely on user-item interactions to suggest actions. Besides, since selecting adopters from the large user candidates set is time-consuming, we design a balanced tree structure that reformulates the user action space. The experimental analysis on three datasets demonstrates the proposed model's superiority and elucidates why reinforcement learning and tree structure can improve performance. Our study shows technical feasibility of constructing a more robust and intelligent user selection model and guides for investigating more marketing promotion strategies.
Shiqi Wang 0018, Chongming Gao, Min Gao 0001, Junliang Yu, Zongwei Wang 0002, Hongzhi Yin
IEEE Trans. Big Data1
2021 Fine-Grained Spatial-Temporal Representation Learning with Missing Data Completion for Traffic Flow Prediction
Shiqi Wang 0018, Min Gao 0001, Zongwei Wang 0002, Jia Wang 0055, Junhao Wen 0001
CollaborateCom (1)1