Wei Shao

Wei Shao

Auto-generated profile, based on publicly available information

Wei Shao

City University of Hong Kong, Hong Kong

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
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

1 June 2022 in Digital Signal Processing
Verified
Journal Article
Closed access
SLShuqi Liu
Shuqi Liu
WSWei Shao
Wei Shao
TLTan Li
Tan Li
WXWeitao Xu
Weitao Xu
LSLinqi Song
Linqi Song

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.

11 March 2022 in arXiv
Verified
Preprint
Open access
PDF file
HTHaochen Tan
Haochen Tan
WSWei Shao
Wei Shao
HWHan Wu
Han Wu
KYKe Yang
Ke Yang
LSLinqi Song
Linqi Song
Contrastive learning has shown great potential in unsupervised sentence embedding tasks, e.g., SimCSE. However, We find that these existing solutions are heavily affected by superficial features like the length of sentences or syntactic structures. In this paper, we propose a semantics-aware contrastive learning framework for sentence embeddings, termed Pseudo-Token BERT (PT-BERT), which is able to exploit the pseudo-token space (i.e., latent semantic space) representation of a sentence while eliminating the impact of superficial features such as sentence length and syntax. Specifically, we introduce an additional pseudo token embedding layer independent of the BERT encoder to map each sentence into a sequence of pseudo tokens in a fixed length. Leveraging these pseudo sequences, we are able to construct same-length positive and negative pairs based on the attention mechanism to perform contrastive learning. In addition, we utilize both the gradient-updating and momentum-updating encoders to encode instances while dynamically maintaining an additional queue to store the representation of sentence embeddings, enhancing the encoder's learning performance for negative examples. Experiments show that our model outperforms the state-of-the-art baselines on six standard semantic textual similarity (STS) tasks. Furthermore, experiments on alignments and uniformity losses, as well as hard examples with different sentence lengths and syntax, consistently verify the effectiveness of our method.

14 July 2026 in Computational Materials Science
Verified
Journal Article
Closed access
SMShihua Ma
Shihua Ma
WSWei Shao
Wei Shao
ZWZhenggang Wu
Zhenggang Wu
Shijun ZhaoShijun Zhao
Shijun Zhao