Zhaopeng Qiu

Zhaopeng Qiu

Auto-generated profile, based on publicly available information

Zhaopeng Qiu

Tencent, Beijing, China

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
13 May 2024
Verified
Conference Paper
Open access
ZZZhi Zheng
Zhi Zheng
WCWenShuo Chao
WenShuo Chao
ZQZhaopeng Qiu
Zhaopeng Qiu
HZHengshu Zhu
Hengshu Zhu
HXHui Xiong
Hui Xiong
Recent advances in Large Language Models (LLMs) have been changing the paradigm of Recommender Systems (RS). However, when items in the recommendation scenarios contain rich textual information, such as product descriptions in online shopping or news headlines on social media, LLMs require longer texts to comprehensively depict the historical user behavior sequence. This poses significant challenges to LLM-based recommenders, such as over-length limitations, extensive time and space overheads, and suboptimal model performance. To this end, in this paper, we design a novel framework for harnessing Large Language Models for Text-Rich Sequential Recommendation (LLM-TRSR). Specifically, we first propose to segment the user historical behaviors and subsequently employ an LLM-based summarizer for summarizing these user behavior blocks. Particularly, drawing inspiration from the successful application of Convolutional Neural Networks (CNN) and Recurrent Neural Networks (RNN) models in user modeling, we introduce two unique summarization techniques in this paper, respectively hierarchical summarization and recurrent summarization. Then, we construct a prompt text encompassing the user preference summary, recent user interactions, and candidate item information into an LLM-based recommender, which is subsequently fine-tuned using Supervised Fine-Tuning (SFT) techniques to yield our final recommendation model. We also use Low-Rank Adaptation (LoRA) for Parameter-Efficient Fine-Tuning (PEFT). We conduct experiments on two public datasets, and the results clearly demonstrate the effectiveness of our approach.

7 May 2024 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
ZZZhi Zheng
Zhi Zheng
XHXiao Hu
Xiao Hu
ZQZhaopeng Qiu
Zhaopeng Qiu
YCYuan Cheng
Yuan Cheng
SGShanshan Gao
Shanshan Gao
HXHui Xiong
Hui Xiong
Recent years have witnessed the rapid development of online recruitment platforms, which provide a convenient way for matching job seekers and recruiters. Indeed, this is a reciprocal recommendation problem which needs to consider the preferences of both job seekers and recruiters simultaneously. Existing studies mainly focus on building recommendation models based on text matching or collaborative filtering methods. However, we propose that these methods are limited and insufficient, since the abundant multi-typed bilateral behaviors among users have been largely ignored. Therefore, in this paper, we propose a novel BilAteral Multi-BehaviOr mOdeling (BAMBOO) method for reciprocal recommendation in online recruitment, which can model the multi-typed interactions from expectation perspective and competitiveness perspective . Specifically, for the expectation perspective, we propose to format the historical behaviors of different users as bilateral multi-behavior sequences, and we utilize a transformer-based model to learn the representations of what the users want to obtain. For the competitiveness perspective, we propose to construct a bilateral interaction heterogeneous graph to describe the entire recruitment market, and further utilize a heterogeneous graph transformer-based model to learn the representations of what the users can obtain. Moreover, we utilize contrastive learning methods to enhance these two modules. Furthermore, we propose to decompose the matching probability into the product of two parts, and we train our model based on a multi-task learning strategy. We conduct both offline experiments on real-world datasets and online A/B test, and the experiment results validate the effectiveness of our BAMBOO model compared with several state-of-the-art baseline methods.

26 February 2025 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
QLQidong Liu
Qidong Liu
ZQZhaopeng Qiu
Zhaopeng Qiu
XZXiangyu Zhao
Xiangyu Zhao
XWXian Wu
Xian Wu
ZZZijian Zhang
Zijian Zhang
FTFen Tian
Fen Tian
Medication recommendation is one of the most critical health-related applications, which has attracted extensive research interest recently. Most existing works focus on a single hospital with abundant medical data. However, many small hospitals only have a few records, which hinders applying existing medication recommendation works to the real world. Thus, we seek to explore a more practical setting, i.e., multi-center medication recommendation. In this setting, most hospitals have few records, but the total number of records is large. Though small hospitals may benefit from total affluent records, it is also faced with the challenge that the data distributions between various hospitals are much different. In this work, we introduce a novel Contrastive Pretrain Model with Prompt Tuning (TEMPT) for multi-center medication recommendation, which includes two stages of pretraining and finetuning. We first design two self-supervised tasks for the pretraining stage to learn general medical knowledge. They are mask prediction and contrastive tasks, which extract the intra- and inter-relationships of input diagnosis and procedures. Furthermore, we devise a novel prompt tuning method to capture the specific information of each hospital rather than adopting the common finetuning. On the one hand, the proposed prompt tuning can better learn the heterogeneity of each hospital to fit various distributions. On the other hand, it can also relieve the catastrophic forgetting problem of finetuning. To validate the proposed model, we conduct extensive experiments on the public eICU, a multi-center medical dataset. The experimental results illustrate the effectiveness of our model. The implementation code is available to ease the reproducibility. 1

13 May 2024
Verified
Conference Paper
Open access
XZXi Sheryl Zhang
Xi Sheryl Zhang
WGWeifan Guan
Weifan Guan
JLJiahao Lu
Jiahao Lu
ZQZhaopeng Qiu
Zhaopeng Qiu
JCJian Cheng
Jian Cheng
YZYefeng Zheng
Yefeng Zheng
In real clinics, the medical data are scattered over multiple hospitals. Due to security and privacy concerns, it is almost impossible to gather all the data together and train a unified model. Therefore, multi-node machine learning systems are currently the mainstream form of model training in healthcare systems. Nevertheless, distributed training relies on the exchange of gradients, which has been proved under the risk of privacy leakage. That means malicious attackers can restore the user's sensitive data by utilizing the publicly shared gradients, which is a serious problem for extremely private data such as Electronic Healthcare Records (EHRs). The performance of the previous gradient attack method will drop rapidly when the batch size of training data increases, which makes it less threatening in practice. However, in this paper, we found in the medical domain, by leveraging prior knowledge like the medical knowledge graph, the leakage risk can be significantly amplified. In particular, we present GraphLeak, which incorporates the medical knowledge graph in gradient leakage attacks. GraphLeak can improve the restoration effect of gradient attacks even under large batches of data. We conduct experimental verification on electronic healthcare record datasets, including eICU and MIMIC-III. Our method has achieved state-of-the-art attack performance compared with previous works. Code is available at https://github.com/anonymous4ai/GraphLeak.