Xingyu Lou

Xingyu Lou

Auto-generated profile, based on publicly available information

Xingyu Lou

OPPO Research Institute, Shenzhen, 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
25 August 2025 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
BWBohao Wang
Bohao Wang
FLFeng Liu
Feng Liu
CZChangwang Zhang
Changwang Zhang
JCJiawei Chen
Jiawei Chen
YWYudi Wu
Yudi Wu
CWCan Wang
Can Wang
Sequential recommenders generate recommendations based on users’ historical interaction sequences. However, in practice, these sequences are often contaminated by noisy interactions, which can arise from various factors such as clickbait, the influence of prominently positioned items, or accidental interactions. Such noise can significantly degrade recommendation performance. Accurately identifying such noisy interactions without additional information is particularly challenging due to the absence of explicit supervisory signals indicating noise. Large Language Models (LLMs), equipped with extensive open knowledge and semantic reasoning abilities, offer a promising avenue to bridge this information gap. However, employing LLMs for denoising in sequential recommendation presents notable challenges: 1) Direct application of pretrained LLMs may not be competent for the denoising task, frequently generating nonsensical responses; 2) Fine-tuning on the denoising task can partially mitigate the issue of generating nonsensical outputs. However, even after fine-tuning, the reliability of LLM outputs remains questionable, especially given the complexity of the denoising task and the inherent hallucination issue of LLMs. To tackle these challenges, we propose LLM4DSR, a tailored approach for denoising sequential recommendation using LLMs. We constructed a self-supervised fine-tuning task to activate LLMs’ capabilities to identify noisy items and suggest replacements. Furthermore, we developed an uncertainty estimation module that ensures only high-confidence responses are utilized for sequence corrections. Remarkably, LLM4DSR is model-agnostic, allowing corrected sequences to be flexibly applied across various recommendation models. To the best of our knowledge, this is the first work that employs LLMs for sequential recommendation denoising while addressing the unique challenges of adapting LLMs to this task. Extensive experiments conducted on three real-world datasets across two noise settings validate the effectiveness of LLM4DSR, demonstrating an average improvement of 12.9% in NDCG@20. The code is available at https://github.com/WANGBohaO-jpg/LLM4DSR .

13 July 2025
Verified
Conference Paper
Open access
BWBohao Wang
Bohao Wang
FLFeng Liu
Feng Liu
JCJiawei Chen
Jiawei Chen
XLXingyu Lou
Xingyu Lou
CZChangwang Zhang
Changwang Zhang
CWCan Wang
Can Wang

22 April 2025
Verified
Conference Paper
Open access
JZJiaqing Zhang
Jiaqing Zhang
MYMingjia Yin
Mingjia Yin
Hao WangHao Wang
Hao Wang
YLYawen Li
Yawen Li
YYYuyang Ye
Yuyang Ye
ECEnhong Chen
Enhong Chen

10 March 2025
Verified
Conference Paper
Open access
ZPZheng Pan
Zheng Pan
XLXingyu Lou
Xingyu Lou
XJXiao Jin
Xiao Jin
COChiye Ou
Chiye Ou
FLFeng Liu
Feng Liu
JWJun Wang
Jun Wang
Customer lifetime value (LTV) is crucial to companies who are intending to adopt personalized promoting strategies to optimize the profits. However, LTV prediction in the scenario of online App advertising usually suffers from label sparsity issue, towards which existing methods designed complex model structures but ignored the information contained in intermediate user behaviors. Moreover, previous works mainly focus on fitting the overall LTV distribution, overlooking the fact that LTV in online App advertising consists of sources with diverse data distributions and thus resulting in sub-optimal solutions. In this paper, we propose a novel Progressive Tasks guided Multi-Source Network (PTMSN) to tackle the aforementioned problems. Specifically, a Cascaded Sub-task Module (CSM) is introduced to alleviate data sparsity by modeling reliance between explicit interactions and implicit monetization. In addition, as the overall LTV is assembled from multiple sources, we propose a divide-and-conquer scheme named Multi-source Integrating Module (MIM) to disentangle the original single target into several source distributions and model in a fine-grained manner. Extensive offline experiments on real-world industrial datasets compared to state-of-the-art baseline models validate the effectiveness of our approach. PTMSN has been successfully deployed in industrial online advertising system, serving various business scenarios and acquiring 2.97% absolute ROI gains.

10 March 2025
Verified
Conference Paper
Open access
PZPengyang Zhou
Pengyang Zhou
Chaochao ChenChaochao Chen
Chaochao Chen
WLWeiming Liu
Weiming Liu
XLXinting Liao
Xinting Liao
FYFengyuan Yu
Fengyuan Yu
JWJun Wang
Jun Wang
Federated graph learning involves training graph neural networks distributively on local graphs and aggregating model parameters in a central server. However, existing methods fail to effectively capture and leverage the inherent global structures, hindering local structural modeling. To address this, we propose Federated Graph Factorization (FedGF), which enhances structural knowledge via privacy-preserving graph factorization. Specifically, FedGF includes three modules, i.e., global structure reconstruction (GSR), local structure exploration (LSE), and global-local structure alignment (GLSA). Firstly, GSR factorizes client graphs into a series of learnable graph atoms and conducts reconstruction to capture the globally shared structure. Then, LSE explores the local structure, mining potential but unrevealed connections within client subgraphs. GLSA further aligns the global and local structure to alternatively refine the graph atoms and GNN model, enhancing the overall structural modeling. Extensive experiments on six datasets consistently validate the effectiveness of \modelname.