Xueliang Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Xueliang Wang has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Shuchang Liu
Kuaishou Technology, Beijing, China
7 shared publications - Chang Meng
Kuaishou Technology, Beijing, China
4 shared publications - Kun Gai
Kuaishou Technology, Beijing, China
4 shared publications - Xiaoqiang Feng
Kuaishou Technology, Beijing, China
4 shared publications - Peng Jiang
Kuaishou Technology, Beijing, China
3 shared publications - Qingpeng Cai
Kuaishou Technology, Beijing, China
3 shared publications
Latest Publications
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 7577-7587
From Bootstrapping to Sequence Modeling: A Unified Generative Framework for Personalized Landing-Page Modeling
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 7577-7587
Open AccessFrom Bootstrapping to Sequence Modeling: A Unified Generative Framework for Personalized Landing-Page Modeling
- Open Access
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 2562-2572
Heterogeneous Multi-treatment Uplift Modeling for Trade-off Optimization in Short-Video Recommendation
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 2562-2572
Open AccessHeterogeneous Multi-treatment Uplift Modeling for Trade-off Optimization in Short-Video Recommendation
- Open Access
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 2290-2301
KLAN: Kuaishou Landing-page Adaptive Navigator
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 2290-2301
Open AccessKLAN: Kuaishou Landing-page Adaptive Navigator
- Open Access
- 22 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 82-92
Enhancing Online Video Recommendation via a Coarse-to-fine Dynamic Uplift Modeling Framework
- 22 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 82-92
Open AccessEnhancing Online Video Recommendation via a Coarse-to-fine Dynamic Uplift Modeling Framework
- Open Access
- 24 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 5905-5916
Future Impact Decomposition in Request-level Recommendations
In recommender systems, reinforcement learning solutions have shown promising results in optimizing the interaction sequence between users and the system over the long-term performance. For practical reasons, the policy's actions are typically designed as recommending a list of items to handle users' frequent and continuous browsing requests more efficiently. In this list-wise recommendation scenario, the user state is updated upon every request in the corresponding MDP formulation. However, this request-level formulation is essentially inconsistent with the user's item-level behavior. In this study, we demonstrate that an item-level optimization approach can better utilize item characteristics and optimize the policy's performance even under the request-level MDP. We support this claim by comparing the performance of standard request-level methods with the proposed item-level actor-critic framework in both simulation and online experiments. Furthermore, we show that a reward-based future decomposition strategy can better express the item-wise future impact and improve the recommendation accuracy in the long term. To achieve a more thorough understanding of the decomposition strategy, we propose a model-based re-weighting framework with adversarial learning that further boost the performance and investigate its correlation with the reward-based strategy.
- 24 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 5905-5916
Open AccessFuture Impact Decomposition in Request-level Recommendations
In recommender systems, reinforcement learning solutions have shown promising results in optimizing the interaction sequence between users and the system over the long-term performance. For practical reasons, the policy's actions are typically designed as recommending a list of items to handle users' frequent and continuous browsing requests more efficiently. In this list-wise recommendation scenario, the user state is updated upon every request in the corresponding MDP formulation. However, this request-level formulation is essentially inconsistent with the user's item-level behavior. In this study, we demonstrate that an item-level optimization approach can better utilize item characteristics and optimize the policy's performance even under the request-level MDP. We support this claim by comparing the performance of standard request-level methods with the proposed item-level actor-critic framework in both simulation and online experiments. Furthermore, we show that a reward-based future decomposition strategy can better express the item-wise future impact and improve the recommendation accuracy in the long term. To achieve a more thorough understanding of the decomposition strategy, we propose a model-based re-weighting framework with adversarial learning that further boost the performance and investigate its correlation with the reward-based strategy.
- Open Access
- 30 April 2023
- Published by Association for Computing Machinery (ACM)
- p. 865-875
Two-Stage Constrained Actor-Critic for Short Video Recommendation
The wide popularity of short videos on social media poses new opportunities and challenges to optimize recommender systems on the video-sharing platforms. Users sequentially interact with the system and provide complex and multi-faceted responses, including WatchTime and various types of interactions with multiple videos. On the one hand, the platforms aim at optimizing the users’ cumulative WatchTime (main goal) in the long term, which can be effectively optimized by Reinforcement Learning. On the other hand, the platforms also need to satisfy the constraint of accommodating the responses of multiple user interactions (auxiliary goals) such as Like, Follow, Share, etc. In this paper, we formulate the problem of short video recommendation as a Constrained Markov Decision Process (CMDP). We find that traditional constrained reinforcement learning algorithms fail to work well in this setting. We propose a novel two-stage constrained actor-critic method: At stage one, we learn individual policies to optimize each auxiliary signal. In stage two, we learn a policy to (i) optimize the main signal and (ii) stay close to policies learned in the first stage, which effectively guarantees the performance of this main policy on the auxiliaries. Through extensive offline evaluations, we demonstrate the effectiveness of our method over alternatives in both optimizing the main goal as well as balancing the others. We further show the advantage of our method in live experiments of short video recommendations, where it significantly outperforms other baselines in terms of both WatchTime and interactions. Our approach has been fully launched in the production system to optimize user experiences on the platform.
- 30 April 2023
- Published by Association for Computing Machinery (ACM)
- p. 865-875
Open AccessTwo-Stage Constrained Actor-Critic for Short Video Recommendation
The wide popularity of short videos on social media poses new opportunities and challenges to optimize recommender systems on the video-sharing platforms. Users sequentially interact with the system and provide complex and multi-faceted responses, including WatchTime and various types of interactions with multiple videos. On the one hand, the platforms aim at optimizing the users’ cumulative WatchTime (main goal) in the long term, which can be effectively optimized by Reinforcement Learning. On the other hand, the platforms also need to satisfy the constraint of accommodating the responses of multiple user interactions (auxiliary goals) such as Like, Follow, Share, etc. In this paper, we formulate the problem of short video recommendation as a Constrained Markov Decision Process (CMDP). We find that traditional constrained reinforcement learning algorithms fail to work well in this setting. We propose a novel two-stage constrained actor-critic method: At stage one, we learn individual policies to optimize each auxiliary signal. In stage two, we learn a policy to (i) optimize the main signal and (ii) stay close to policies learned in the first stage, which effectively guarantees the performance of this main policy on the auxiliaries. Through extensive offline evaluations, we demonstrate the effectiveness of our method over alternatives in both optimizing the main goal as well as balancing the others. We further show the advantage of our method in live experiments of short video recommendations, where it significantly outperforms other baselines in terms of both WatchTime and interactions. Our approach has been fully launched in the production system to optimize user experiences on the platform.
- Open Access
- 30 April 2023
- Published by Association for Computing Machinery (ACM)
- p. 421-426
Reinforcing User Retention in a Billion Scale Short Video Recommender System
Recently, short video platforms have achieved rapid user growth by recommending interesting content to users. The objective of the recommendation is to optimize user retention, thereby driving the growth of DAU (Daily Active Users). Retention is a long-term feedback after multiple interactions of users and the system, and it is hard to decompose retention reward to each item or a list of items. Thus traditional point-wise and list-wise models are not able to optimize retention. In this paper, we choose reinforcement learning methods to optimize the retention as they are designed to maximize the long-term performance. We formulate the problem as an infinite-horizon request-based Markov Decision Process, and our objective is to minimize the accumulated time interval of multiple sessions, which is equal to improving the app open frequency and user retention. However, current reinforcement learning algorithms can not be directly applied in this setting due to uncertainty, bias, and long delay time incurred by the properties of user retention. We propose a novel method, dubbed RLUR, to address the aforementioned challenges. Both offline and live experiments show that RLUR can significantly improve user retention. RLUR has been fully launched in Kuaishou app for a long time, and achieves consistent performance improvement on user retention and DAU.
- 30 April 2023
- Published by Association for Computing Machinery (ACM)
- p. 421-426
Open AccessReinforcing User Retention in a Billion Scale Short Video Recommender System
Recently, short video platforms have achieved rapid user growth by recommending interesting content to users. The objective of the recommendation is to optimize user retention, thereby driving the growth of DAU (Daily Active Users). Retention is a long-term feedback after multiple interactions of users and the system, and it is hard to decompose retention reward to each item or a list of items. Thus traditional point-wise and list-wise models are not able to optimize retention. In this paper, we choose reinforcement learning methods to optimize the retention as they are designed to maximize the long-term performance. We formulate the problem as an infinite-horizon request-based Markov Decision Process, and our objective is to minimize the accumulated time interval of multiple sessions, which is equal to improving the app open frequency and user retention. However, current reinforcement learning algorithms can not be directly applied in this setting due to uncertainty, bias, and long delay time incurred by the properties of user retention. We propose a novel method, dubbed RLUR, to address the aforementioned challenges. Both offline and live experiments show that RLUR can significantly improve user retention. RLUR has been fully launched in Kuaishou app for a long time, and achieves consistent performance improvement on user retention and DAU.