Sichun Luo

Sichun Luo

Auto-generated profile, based on publicly available information

Sichun Luo

City University of Hong Kong, Hong Kong, Hong Kong and City University of Hong Kong Shenzhen Research Institute, Shenzhen, 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
10 July 2025 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
SLSichun Luo
Sichun Luo
BHBowei He
Bowei He
HZHaohan Zhao
Haohan Zhao
WSWei Shao
Wei Shao
YQYanlin Qi
Yanlin Qi
LSLinqi Song
Linqi Song
Large language models (LLMs) have demonstrated remarkable capabilities and have been extensively deployed across various domains, including recommender systems. Prior research has employed specialized prompts to leverage the in-context learning capabilities of LLMs for recommendation purposes. More recent studies have utilized instruction tuning techniques to align LLMs with human preferences, promising more effective recommendations. However, existing methods suffer from several limitations. The full potential of LLMs is not fully elicited due to low-quality tuning data and the overlooked integration of conventional recommender signals. Furthermore, LLMs may generate inconsistent responses for different ranking tasks in the recommendation, potentially leading to unreliable results. In this article, we introduce Ranker for top- k Recommendations (RecRanker), tailored for instruction tuning LLMs to serve as the Ranker for top- k Recommendations. Specifically, we introduce importance-aware sampling, clustering-based sampling, and penalty for repetitive sampling for sampling high-quality, representative, and diverse training data. To enhance the prompt, we introduce a position shifting strategy to mitigate position bias and augment the prompt with auxiliary information from conventional recommendation models, thereby enriching the contextual understanding of the LLM. Subsequently, we utilize the sampled data to assemble an instruction-tuning dataset with the augmented prompts comprising three distinct ranking tasks: pointwise, pairwise, and listwise rankings. We further propose a hybrid ranking method to enhance the model performance by ensembling these ranking tasks. Our empirical evaluations demonstrate the effectiveness of our proposed RecRanker in both direct and sequential recommendation scenarios. 1

31 October 2024 in ACM Transactions on Intelligent Systems and Technology
Verified
Journal Article
Open access
SLSichun Luo
Sichun Luo
YXYuanzhang Xiao
Yuanzhang Xiao
XZXinyi Zhang
Xinyi Zhang
YLYang Liu
Yang Liu
Wenbo DingWenbo Ding
Wenbo Ding
LSLinqi Song
Linqi Song
Federated recommendation systems employ federated learning techniques to safeguard user privacy by transmitting model parameters instead of raw user data between user devices and the central server. Nevertheless, the current federated recommender system faces three significant challenges: (1) data heterogeneity: the heterogeneity of users’ attributes and local data necessitates the acquisition of personalized models to improve the performance of federated recommendation; (2) model performance degradation: the privacy-preserving protocol design in the federated recommendation, such as pseudo item labeling and differential privacy, would deteriorate the model performance; (3) communication bottleneck: the standard federated recommendation algorithm can have a high communication overhead. Previous studies have attempted to address these issues, but none have been able to solve them simultaneously. In this article, we propose a novel framework, named PerFedRec++ , to enhance the personalized federated recommendation with self-supervised pre-training. Specifically, we utilize the privacy-preserving mechanism of federated recommender systems to generate two augmented graph views, which are used as contrastive tasks in self-supervised graph learning to pre-train the model. Pre-training enhances the performance of federated models by improving the uniformity of representation learning. Also, by providing a better initial state for federated training, pre-training makes the overall training converge faster, thus alleviating the heavy communication burden. We then construct a collaborative graph to learn the client representation through a federated graph neural network. Based on these learned representations, we cluster users into different user groups and learn personalized models for each cluster. Each user learns a personalized model by combining the global federated model, the cluster-level federated model, and its own fine-tuned local model. Experiments on three real-world datasets show that our proposed method achieves superior performance over existing methods.

16 January 2026 in IEEE Journal of Selected Topics in Signal Processing
Verified
Journal Article
Closed access
SLSichun Luo
Sichun Luo
YYYuxuan Yao
Yuxuan Yao
BHBowei He
Bowei He
WSWei Shao
Wei Shao
JXJian Xu
Jian Xu
LSLinqi Song
Linqi Song
Conventional recommender systems and Large Language Model (LLM)-based recommender systems each have their strengths and weaknesses. While conventional recommendation methods excel at mining collaborative information and modeling sequential behavior, they struggle with data sparsity and the long-tail problem. LLM, on the other hand, is proficient at utilizing rich textual contexts but faces challenges in mining collaborative or sequential information. Despite their individual successes, there is a significant gap in leveraging their ensemble potential to enhance recommendation performance. In this paper, we introduce a general and model-agnostic framework known as Large language models with mutual augmentation and adaptive aggregation for Recommendation (Llama4Rec), aiming to bridge this gap via explicitly ensemble LLM and conventional recommendation model for more effective recommendation. We propose data augmentation and prompt augmentation strategies tailored to enhance the conventional recommendation model and LLM respectively. An adaptive aggregation module is adopted to combine the predictions of both kinds of models to refine the final recommendation results. Empirical studies on three datasets validate the superiority of Llama4Rec, demonstrating significant improvements in recommendation performance.

21 October 2023
Verified
Conference Paper
Open access
SLSichun Luo
Sichun Luo
CMChen Ma
Chen Ma
YXYuanzhang Xiao
Yuanzhang Xiao
LSLinqi Song
Linqi Song
The ubiquitous long-tail distribution of inherent user behaviors results in worse recommendation performance for the items with fewer user records (i.e., tail items) than those with richer ones (i.e., head items). Graph-based recommendation methods (e.g., using graph neural networks) have recently emerged as a powerful tool for recommender systems, often outperforming traditional methods. However, existing techniques for alleviating the long-tail problem mainly focus on traditional methods. There is a lack of graph-based methods that can efficiently deal with the long-tail problem. In this paper, we propose a novel approach, Graph Augmentation for Long-tail Recommendation (GALORE), which can be plugged into any graph-based recommendation models to improve the performance for tail items. GALORE incorporates an edge addition module that enriches the graph's connectivity for tail items by injecting additional item-to-item edges. To further balance the graph structure, GALORE utilizes a degree-aware edge dropping strategy, preserving the more valuable edges from the tail items while selectively discarding less informative edges from the head items. Beyond structural augmentation, we synthesize new data samples, thereby addressing the data scarcity issue for tail items. We further introduce a two-stage training strategy to facilitate the learning for both head and tail items. Comprehensive empirical studies conducted on four datasets show that GALORE outperforms existing methods in terms of the performance for tail items as well as the overall performance.

3 April 2024 in IEEE Journal of Selected Topics in Signal Processing
Verified
Journal Article
Closed access
SLSichun Luo
Sichun Luo
YYYuxuan Yao
Yuxuan Yao
HZHaohan Zhao
Haohan Zhao
LSLinqi Song
Linqi Song
Accurate address resolution plays a vital role in UAV delivery systems. Existing address resolution systems heavily rely on user-provided Point of Interest (POI) information. However, such information often lacks precision, making it challenging to obtain fine-grained details for further processing. In this paper, we present an end-to-end L anguage M odel-based fine-grained A ddress R esolution framework ( LMAR ). Instead of solely relying on POI information, we introduce a language model to process the user input text information. Specifically, we start by collecting data and constructing two datasets, which are then used to fine-tune a pre-trained language model. Additionally, our pipeline incorporates pre-processing and post-processing modules to handle data processing and regularization. We combine the output of the language model with the POI information to perform a database match and derive the final outcome. To evaluate our proposed LMAR, we conduct offline and online experiments. In both offline and online testing, our proposed model achieves an overall performance of over 90% accuracy, while in the online pressure test, it achieves satisfactory performance, demonstrating its effectiveness and practicality. The proposed LMAR has passed the internal test and will be deployed into the Meituan UAV delivery system in the near future.

29 August 2025 in Expert Systems with Applications
Verified
Journal Article
Closed access
SLSichun Luo
Sichun Luo
JXJian Xu
Jian Xu
XZXiaojie Zhang
Xiaojie Zhang
LWLinrong Wang
Linrong Wang
SLSicong Liu
Sicong Liu
LSLinqi Song
Linqi Song