Xiwei Zhao

Xiwei Zhao

Auto-generated profile, based on publicly available information

Xiwei Zhao

JD.com, Beijing, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
21 October 2023
Verified
Conference Paper
Open access
YZYinan Zhang
Yinan Zhang
PWPei Wang
Pei Wang
CLCongcong Liu
Congcong Liu
XZXiwei Zhao
Xiwei Zhao
HQHao Qi
Hao Qi
JSJingping Shao
Jingping Shao
Recently, Graph Convolutional Network (GCN) based methods have become novel state-of-the-arts for Collaborative Filtering (CF) based Recommender Systems. To obtain users' preferences over different items, it is a common practice to learn representations of users and items by performing embedding propagation on a user-item bipartite graph, and then calculate the preference scores based on the representations. However, in most existing algorithms, user/item representations are generated independently of target items/users. To address this problem, we propose a novel graph attention model named Bilateral Interactive GCN (BI-GCN), which introduces bilateral interactive guidance into each user-item pair and thus leads to target-aware representations for preference prediction. Specifically, to learn the user/item representation from its neighborhood, we assign higher attention weights to those neighbors similar to the target item/user. By this manner, we can obtain target-aware representations, i.e., the information of the target item/user is explicitly encoded in the corresponding user/item representation, for more precise matching. Extensive experiments on three benchmark datasets demonstrate the effectiveness and robustness of BI-GCN.


8 May 2025
Verified
Conference Paper
Open access
BZBinglei Zhao
Binglei Zhao
HQHouying Qi
Houying Qi
GXGuang Xu
Guang Xu
MMMian Ma
Mian Ma
XZXiwei Zhao
Xiwei Zhao
JHJinghe Hu
Jinghe Hu

30 April 2023
Verified
Conference Paper
Open access
JZJian Zhu
Jian Zhu
CLCongcong Liu
Congcong Liu
PWPei Wang
Pei Wang
XZXiwei Zhao
Xiwei Zhao
ZLZhangang Lin
Zhangang Lin
JSJingping Shao
Jingping Shao
Model evolution and data updating are two common phenomena in large-scale real-world machine learning applications, e.g. ads and recommendation systems. To adapt, the real-world system typically retrain with all available data and online learn with recently available data to update the models periodically with the goal of better serving performance. In this paper, we propose a novel framework, named Confidence Ranking, which designs the optimization objective as a ranking function with two different models. Our confidence ranking loss allows direct optimization of the logits output for different convex surrogate functions of metrics, e.g. AUC and Accuracy depending on the target task and dataset. Armed with our proposed methods, our experiments show that the introduction of confidence ranking loss can outperform all baselines on the CTR prediction tasks of public and industrial datasets. This framework has been deployed in the advertisement system of JD.com to serve the main traffic in the fine-rank stage.

13 May 2024
Verified
Conference Paper
Open access
YGYuanbo Gao
Yuanbo Gao
PLPeng Lin
Peng Lin
DWDongyue Wang
Dongyue Wang
FMFeng Mei
Feng Mei
XZXiwei Zhao
Xiwei Zhao
JHJinghe Hu
Jinghe Hu
Click-through rate (CTR) prediction is a core task in recommender systems. Existing methods (IDRec for short) rely on unique identities to represent distinct users and items that have prevailed for decades. On one hand, IDRec often faces significant performance degradation on cold-start problem; on the other hand, IDRec cannot use longer training data due to constraints imposed by iteration efficiency. Most prior studies alleviate the above problems by introducing pre-trained knowledge(e.g. pre-trained user model or multi-modal embeddings). However, the explosive growth of online latency can be attributed to the huge parameters in the pre-trained model. Therefore, most of them cannot employ the unified model of end-to-end training with IDRec in industrial recommender systems, thus limiting the potential of the pre-trained model. To this end, we propose a pre-trained plug-in CTR model, namely PPM. PPM employs multi-modal features as input and utilizes large-scale data for pre-training. Then, PPM is plugged in IDRec model to enhance unified model's performance and iteration efficiency. Upon incorporating IDRec model, certain intermediate results within the network are cached, with only a subset of the parameters participating in training and serving. Hence, our approach can successfully deploy an end-to-end model without causing huge latency increases. Comprehensive offline experiments and online A/B testing at JD E-commerce demonstrate the efficiency and effectiveness of PPM.

21 October 2023
Verified
Conference Paper
Open access
MPMao Pan
Mao Pan
TYTao Yu
Tao Yu
KZKun Zhou
Kun Zhou
ZLZheng Li
Zheng Li
DWDongyue Wang
Dongyue Wang
SXSulong Xu
Sulong Xu