Xiuqiang He

Xiuqiang He

Auto-generated profile, based on publicly available information

Xiuqiang He

Shenzhen Technology University, Shenzhen, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
30 April 2023
Verified
Conference Paper
Open access
FLFuyuan Lyu
Fuyuan Lyu
XTXing Tang
Xing Tang
DLDugang Liu
Dugang Liu
LCLiang Chen
Liang Chen
XHXiuqiang He
Xiuqiang He
XLXue Liu
Xue Liu
Click-through prediction (CTR) models transform features into latent vectors and enumerate possible feature interactions to improve performance based on the input feature set. Therefore, when selecting an optimal feature set, we should consider the influence of both features and their interaction. However, most previous works focus on either feature field selection or only select feature interaction based on the fixed feature set to produce the feature set. The former restricts search space to the feature field, which is too coarse to determine subtle features. They also do not filter useless feature interactions, leading to higher computation costs and degraded model performance. The latter identifies useful feature interaction from all available features, resulting in many redundant features in the feature set. In this paper, we propose a novel method named OptFS to address these problems. To unify the selection of features and their interaction, we decompose the selection of each feature interaction into the selection of two correlated features. Such a decomposition makes the model end-to-end trainable given various feature interaction operations. By adopting feature-level search space, we set a learnable gate to determine whether each feature should be within the feature set. Because of the large-scale search space, we develop a learning-by-continuation training scheme to learn such gates. Hence, OptFS generates the feature set containing features that improve the final prediction results. Experimentally, we evaluate OptFS on three public datasets, demonstrating OptFS can optimize feature sets which enhance the model performance and further reduce both the storage and computational cost.

19 April 2021
Verified
Conference Paper
Open access
XDXinyi Dai
Xinyi Dai
JLJianghao Lin
Jianghao Lin
WZWeinan Zhang
Weinan Zhang
Shuai LiShuai Li
Shuai Li
WLWeiwen Liu
Weiwen Liu
YYYong Yu
Yong Yu
Modern information retrieval systems, including web search, ads placement, and recommender systems, typically rely on learning from user feedback. Click models, which study how users interact with a ranked list of items, provide a useful understanding of user feedback for learning ranking models. Constructing ”right” dependencies is the key of any successful click model. However, probabilistic graphical models (PGMs) have to rely on manually assigned dependencies, and oversimplify user behaviors. Existing neural network based methods promote PGMs by enhancing the expressive ability and allowing flexible dependencies, but still suffer from exposure bias and inferior estimation. In this paper, we propose a novel framework, Adversarial Imitation Click Model (AICM), based on imitation learning. Firstly, we explicitly learn the reward function that recovers users’ intrinsic utility and underlying intentions. Secondly, we model user interactions with a ranked list as a dynamic system instead of one-step click prediction, alleviating the exposure bias problem. Finally, we minimize the JS divergence through adversarial training and learn a stable distribution of click sequences, which makes AICM generalize well across different distributions of ranked lists. A theoretical analysis has indicated that AICM reduces the exposure bias from O(T2) to O(T). Our studies on a public web search dataset show that AICM not only outperforms state-of-the-art models in traditional click metrics but also achieves superior performance in addressing the exposure bias and recovering the underlying patterns of click sequences.

4 August 2023
Verified
Conference Paper
Open access
DLDugang Liu
Dugang Liu
XTXing Tang
Xing Tang
HGHan Gao
Han Gao
FLFuyuan Lyu
Fuyuan Lyu
XHXiuqiang He
Xiuqiang He
As a key component in online marketing, uplift modeling aims to accurately capture the degree to which different treatments motivate different users, such as coupons or discounts, also known as the estimation of individual treatment effect (ITE). In an actual business scenario, the options for treatment may be numerous and complex, and there may be correlations between different treatments. In addition, each marketing instance may also have rich user and contextual features. However, existing methods still fall short in both fully exploiting treatment information and mining features that are sensitive to a particular treatment. In this paper, we propose an explicit feature interaction-aware uplift network (EFIN) to address these two problems. Our EFIN includes four customized modules: 1) a feature encoding module encodes not only the user and contextual features, but also the treatment features; 2) a self-interaction module aims to accurately model the user's natural response with all but the treatment features; 3) a treatment-aware interaction module accurately models the degree to which a particular treatment motivates a user through interactions between the treatment features and other features, i.e., ITE; and 4) an intervention constraint module is used to balance the ITE distribution of users between the control and treatment groups so that the model would still achieve a accurate uplift ranking on data collected from a non-random intervention marketing scenario. We conduct extensive experiments on two public datasets and one product dataset to verify the effectiveness of our EFIN. In addition, our EFIN has been deployed in a credit card bill payment scenario of a large online financial platform with a significant improvement.

8 April 2023 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
JQJiarui Qin
Jiarui Qin
WZWeinan Zhang
Weinan Zhang
RSRong Su
Rong Su
ZLZhirong Liu
Zhirong Liu
WLWeiwen Liu
Weiwen Liu
YYYong Yu
Yong Yu
Click-through rate (CTR) estimation plays a crucial role in modern online personalization services. It is essential to capture users’ drifting interests by modeling sequential user behaviors to build an accurate CTR estimation model. However, as the users accumulate a large amount of behavioral data on the online platforms, the current CTR models have to truncate user behavior sequences and utilize the most recent behaviors, which leads to a problem that sequential patterns such as periodicity or long-term dependency are not contained in the recent behaviors but in far back history. However, it is non-trivial to model the entire user sequence by directly using it for two reasons. Firstly, the very long input sequences will make online inference time and system load infeasible. Secondly, the very long sequences contain much noise, thus making it difficult for CTR models to capture useful patterns effectively. To tackle this issue, we consider it from the input data perspective instead of designing more sophisticated yet complex models. As the entire user behavior sequence contains much noise, it is unnecessary to input the entire sequence. Instead, we could justretrieveonly a small part of it as the input to the CTR model. In this article, we propose theUserBehaviorRetrieval (UBR) framework which aims atlearning to retrievethe most informative user behaviors according to each CTR estimation request. Retrieving only a small set of behaviors could alleviate the two problems of utilizing very long sequences (i.e., inference efficiency and noisy input). The distinguishing property of UBR is that it supportsarbitrary and learnable retrieval functionsinstead of utilizing a fixed pre-defined function, which is different from the current retrieval-based methods. Offline evaluations on three large-scale real-world datasets demonstrate the superiority and efficacy of the UBR framework. We further deploy UBR at the Huawei App Store, where it achieves 6.6% of eCPM gain in the online A/B test and now serves the main traffic in the Huawei App Store advertising scenario.

27 January 2023 in ACM Transactions on Recommender Systems
Verified
Journal Article
Open access
DLDugang Liu
Dugang Liu
PCPengxiang Cheng
Pengxiang Cheng
HZHong Zhu
Hong Zhu
ZDZhenhua Dong
Zhenhua Dong
XHXiuqiang He
Xiuqiang He
ZMZhong Ming
Zhong Ming
How to effectively mitigate the bias of feedback in recommender systems is an important research topic. In this article, we first describe the generation process of the biased and unbiased feedback in recommender systems via two respective causal diagrams, where the difference between them can be regarded as the source of system-induced biases. We then define this difference as a confounding bias and propose a new perspective on debiased representation learning to alleviate it. Specifically, for the case with biased feedback alone, we derive the conditions that need to be satisfied to obtain a debiased representation from the causal diagrams. Then, we propose a novel framework called debiased information bottleneck (DIB) to optimize these conditions and then find a tractable solution for it. The proposed framework constrains the model to learn a biased embedding vector with independent biased and unbiased components in the training phase, and uses only the unbiased component in the test phase to deliver more accurate recommendations. We further propose a variant of DIB by relaxing the independence between the biased and unbiased components. Finally, we conduct extensive experiments on a public dataset and a real product dataset to verify the effectiveness of the proposed framework.

4 March 2024
Verified
Conference Paper
Open access
DLDugang Liu
Dugang Liu
CYChaohua Yang
Chaohua Yang
XTXing Tang
Xing Tang
YWYejing Wang
Yejing Wang
FLFuyuan Lyu
Fuyuan Lyu
XZXiangyu Zhao
Xiangyu Zhao
Multi-scenario recommender systems (MSRSs) have been increasingly used in real-world industrial platforms for their excellent advantages in mitigating data sparsity and reducing maintenance costs. However, conventional MSRSs usually use all relevant features indiscriminately and ignore that different kinds of features have varying importance under different scenarios, which may cause confusion and performance degradation. In addition, existing feature selection methods for deep recommender systems may lack the exploration of scenario relations. In this paper, we propose a novel automated multi-scenario feature selection (MultiFS) framework to bridge this gap, which is able to consider scenario relations and utilize a hierarchical gating mechanism to select features for each scenario. Specifically, MultiFS first efficiently obtains feature importance across all the scenarios through a scenario-shared gate. Then, some scenario-specific gate aims to identify feature importance to individual scenarios from a subset of the former with lower importance. Subsequently, MultiFS imposes constraints on the two gates to make the learning mechanism more feasible and combines the two to select exclusive features for different scenarios. We evaluate MultiFS and demonstrate its ability to enhance the multi-scenario model performance through experiments over two public multi-scenario benchmarks.