Lei Li

Lei Li

Auto-generated profile, based on publicly available information

Lei Li

College of Computer Science and Software Engineering, Shenzhen University, Shenzhen, China

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
23 March 2023 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
LLLei Li
Lei Li
Yongfeng ZhangYongfeng Zhang
Yongfeng Zhang
LCLi Chen
Li Chen
Providing user-understandable explanations to justify recommendations could help users better understand the recommended items, increase the system’s ease of use, and gain users’ trust. A typical approach to realize it is natural language generation. However, previous works mostly adopt recurrent neural networks to meet the ends, leaving the potentially more effective pre-trained Transformer models under-explored. In fact, user and item IDs, as important identifiers in recommender systems, are inherently in different semantic space as words that pre-trained models were already trained on. Thus, how to effectively fuse IDs into such models becomes a critical issue. Inspired by recent advancement in prompt learning, we come up with two solutions: find alternative words to represent IDs (called discrete prompt learning) and directly input ID vectors to a pre-trained model (termed continuous prompt learning). In the latter case, ID vectors are randomly initialized but the model is trained in advance on large corpora, so they are actually in different learning stages. To bridge the gap, we further propose two training strategies: sequential tuning and recommendation as regularization. Extensive experiments show that our continuous prompt learning approach equipped with the training strategies consistently outperforms strong baselines on three datasets of explainable recommendation.

21 October 2023
Verified
Conference Paper
Open access
LLLei Li
Lei Li
Yongfeng ZhangYongfeng Zhang
Yongfeng Zhang
LCLi Chen
Li Chen
Large language models (LLM) have manifested unparalleled modeling capability on various tasks, e.g., multi-step reasoning, but the input to these models is mostly limited to plain text, which could be very long and contain noisy information. Long text could take long time to process, and thus may not be efficient enough for recommender systems that require immediate response. In LLM-based recommendation models, user and item IDs are usually filled in a template (i.e., discrete prompt) to allow the models to understand a given task, but the models usually need extensive fine-tuning to bridge the user/item IDs and the template words and to unleash the power of LLM for recommendation. To address the problems, we propose to distill the discrete prompt for a specific task to a set of continuous prompt vectors so as to bridge IDs and words and to reduce the inference time. We also design a training strategy with an attempt to improve the efficiency of training these models. Experimental results on three real-world datasets demonstrate the effectiveness of our PrOmpt Distillation (POD) approach on both sequential recommendation and top-N recommendation tasks. Although the training efficiency can be significantly improved, the improvement of inference efficiency is limited. This finding may inspire researchers in the community to further improve the inference efficiency of LLM-based recommendation models.

25 November 2020 in Journal of Intelligent Information Systems
Verified
Journal Article
Closed access
PDF file
LLLei Li
Lei Li
LCLi Chen
Li Chen
RDRuihai Dong
Ruihai Dong

14 September 2023
Verified
Conference Paper
Open access
WHWenyue Hua
Wenyue Hua
LLLei Li
Lei Li
SXShuyuan Xu
Shuyuan Xu
LCLi Chen
Li Chen
Yongfeng ZhangYongfeng Zhang
Yongfeng Zhang
Foundation Models such as Large Language Models (LLMs) have significantly advanced many research areas. In particular, LLMs offer significant advantages for recommender systems, making them valuable tools for personalized recommendations. For example, by formulating various recommendation tasks such as rating prediction, sequential recommendation, straightforward recommendation, and explanation generation into language instructions, LLMs make it possible to build universal recommendation engines that can handle different recommendation tasks. Additionally, LLMs have a remarkable capacity for understanding natural language, enabling them to comprehend user preferences, item descriptions, and contextual information to generate more accurate and relevant recommendations, leading to improved user satisfaction and engagement. This tutorial introduces Foundation Models such as LLMs for recommendation. We will introduce how recommender system advanced from shallow models to deep models and to large models, how LLMs enable generative recommendation in contrast to traditional discriminative recommendation, and how to build LLM-based recommender systems. We will cover multiple perspectives of LLM-based recommendation, including data preparation, model design, model pre-training, fine-tuning and prompting, multi-modality and multi-task learning, as well as trustworthy perspectives of LLM-based recommender systems such as fairness and transparency.

16 February 2023 in ACM Transactions on Intelligent Systems and Technology
Verified
Journal Article
Open access
LLLei Li
Lei Li
Yongfeng ZhangYongfeng Zhang
Yongfeng Zhang
LCLi Chen
Li Chen
Explaining to users why some items are recommended is critical, as it can help users to make better decisions, increase their satisfaction, and gain their trust in recommender systems (RS). However, existing explainable RS usually consider explanation as a side output of the recommendation model, which has two problems: (1) It is difficult to evaluate the produced explanations, because they are usually model-dependent, and (2) as a result, how the explanations impact the recommendation performance is less investigated. In this article, explaining recommendations is formulated as a ranking task and learned from data, similarly to item ranking for recommendation. This makes it possible for standard evaluation of explanations via ranking metrics (e.g., Normalized Discounted Cumulative Gain). Furthermore, this article extends traditional item ranking to an item–explanation joint-ranking formalization to study if purposely selecting explanations could reach certain learning goals, e.g., improving recommendation performance. A great challenge, however, is that the sparsity issue in the user-item-explanation data would be inevitably severer than that in traditional user–item interaction data, since not every user–item pair can be associated with all explanations. To mitigate this issue, this article proposes to perform two sets of matrix factorization by considering the ternary relationship as two groups of binary relationships. Experiments on three large datasets verify the solution’s effectiveness on both explanation ranking and item recommendation.

8 October 2024
Verified
Conference Paper
Open access
ILIrene Li
Irene Li
RDRuihai Dong
Ruihai Dong
LLLei Li
Lei Li
LCLi Chen
Li Chen
This workshop aims to explore the evaluation and application of Large Language Models (LLMs) in recommendation systems (RSs), highlighting innovations, challenges, and future directions, focusing on enhancing RSs through LLM techniques such as prompting, fine-tuning, and developing conversational systems. By gathering researchers and partitioners from both academia and industry, the workshop focuses on discussing state-of-the-art techniques and addressing challenges and innovative applications in various sectors. At last, the workshop encourages research on topics including LLM integration, evaluating LLM-based RSs, transparency, and conversational RS development, aiming to set a research agenda for future RS advancements.