Changshuo Zhang

Changshuo Zhang

Auto-generated profile, based on publicly available information

Changshuo Zhang

Gaoling School of Artificial Intelligence, Renmin University of China, Beijing, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 August 2023
Verified
Conference Paper
Open access
SCSirui Chen
Sirui Chen
YWYuan Wang
Yuan Wang
ZWZijing Wen
Zijing Wen
ZLZhiyu Li
Zhiyu Li
CZChangshuo Zhang
Changshuo Zhang
JXJun Xu
Jun Xu
Multi-stage ranking pipelines have become widely used strategies in modern recommender systems, where the final stage aims to return a ranked list of items that balances a number of requirements such as user preference, diversity, novelty etc. Linear scalarization is arguably the most widely used technique to merge multiple requirements into one optimization objective, by summing up the requirements with certain preference weights. Existing final-stage ranking methods often adopt a static model where the preference weights are determined during offline training and kept unchanged during online serving. Whenever a modification of the preference weights is needed, the model has to be re-trained, which is time and resources inefficient. Meanwhile, the most appropriate weights may vary greatly for different groups of targeting users or at different time periods (e.g., during holiday promotions). In this paper, we propose a framework called controllable multi-objective re-ranking (CMR) which incorporates a hypernetwork to generate parameters for a re-ranking model according to different preference weights. In this way, CMR is enabled to adapt the preference weights according to the environment changes in an online manner, without retraining the models. Moreover, we classify practical business-oriented tasks into four main categories and seamlessly incorporate them in a new proposed re-ranking model based on an Actor-Evaluator framework, which serves as a reliable real-world testbed for CMR. Offline experiments based on the dataset collected from Taobao App showed that CMR improved several popular re-ranking models by using them as underlying models. Online A/B tests also demonstrated the effectiveness and trustworthiness of CMR.

10 July 2024
Verified
Conference Paper
Open access
CZChangshuo Zhang
Changshuo Zhang
SCSirui Chen
Sirui Chen
XZXiao Zhang
Xiao Zhang
SDSunhao Dai
Sunhao Dai
WYWeijie Yu
Weijie Yu
JXJun Xu
Jun Xu
Reinforcement learning (RL) has gained popularity in recommender systems for improving long-term performance by effectively exploring users' interests. However, modern recommender systems face the challenge of different user behavioral patterns among millions of items, making exploration more difficult. For example, users with varying activity levels require different exploration intensities. Unfortunately, previous studies often overlook this aspect and apply a uniform exploration strategy to all users, which ultimately hampers long-term user experiences. To tackle these challenges, we propose User-Oriented Exploration Policy (UOEP), a novel approach that enables fine-grained exploration among user groups. We first construct a distributional critic that allows policy optimization based on varying quantile levels of cumulative reward feedback from users, representing user groups with different activity levels. Using this critic as a guide, we design a population of distinct actors dedicated to effective and fine-grained exploration within their respective user groups. To simultaneously enhance diversity and stability during the exploration process, we also introduce a population-level diversity regularization term and a supervision module. Experimental results on public recommendation datasets validate the effectiveness of our approach, as it outperforms all other baselines in terms of long-term performance. Moreover, further analyses reveal the benefits of our approach, including improved performance for low-activity users and increased fairness among users.


8 October 2024
Verified
Conference Paper
Open access
YWYuan Wang
Yuan Wang
ZLZhiyu Li
Zhiyu Li
CZChangshuo Zhang
Changshuo Zhang
SCSirui Chen
Sirui Chen
XZXiao Zhang
Xiao Zhang
QLQuan Lin
Quan Lin
Recommender systems have been widely used in e-commerce, and re-ranking models are playing an increasingly significant role in the domain, which leverages the inter-item influence and determines the final recommendation lists. Online learning methods keep updating a deployed model with the latest available samples to capture the shifting of the underlying data distribution in e-commerce. However, they depend on the availability of real user feedback, which may be delayed by hours or even days, such as item purchases, leading to a lag in model enhancement. In this paper, we propose a novel extension of online learning methods for re-ranking modeling, which we term LAST, an acronym for Learning At Serving Time. It circumvents the requirement of user feedback by using a surrogate model to provide the instructional signal needed to steer model improvement. Upon receiving an online request, LAST finds and applies a model modification on the fly before generating a recommendation result for the request. The modification is request-specific and transient. It means the modification is tailored to and only to the current request to capture the specific context of the request. After a request, the modification is discarded, which helps to prevent error propagation and stabilizes the online learning procedure since the predictions of the surrogate model may be inaccurate. Most importantly, as a complement to feedback-based online learning methods, LAST can be seamlessly integrated into existing online learning systems to create a more adaptive and responsive recommendation experience. Comprehensive experiments, both offline and online, affirm that LAST outperforms state-of-the-art re-ranking models.

10 November 2025
Verified
Conference Paper
Open access
HZHaiyuan Zhao
Haiyuan Zhao
CZChangshuo Zhang
Changshuo Zhang
YWYang Wang
Yang Wang
HWHao Wang
Hao Wang
ZOZhen Ouyang
Zhen Ouyang
ZLZuotao Liu
Zuotao Liu

8 May 2025
Verified
Conference Paper
Open access
CZChangshuo Zhang
Changshuo Zhang
ZLZihan Lin
Zihan Lin
SLShukai Liu
Shukai Liu
YLYongqi Liu
Yongqi Liu
HLHan Li
Han Li