Lei Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Lei Wang has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Hao Guo
Meituan
2 shared publications - Hongxiang Lin
Wangxuan Institute of Computer Technology, Peking University, Beijing, China
2 shared publications - Min Zhang
DCST, Tsinghua University, Beijing, China
2 shared publications - Shenghao Yang
DCST, Tsinghua University, Quan Cheng Laboratory, Beijing, China
2 shared publications - Weizhi Ma
AiR, Tsinghua University, Beijing, China
2 shared publications - Zhiqiang Guo
DCST, Tsinghua University, Beijing, China
2 shared publications
Latest Publications
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 5642-5652
Accumulative Modality Tokenization for Multimodal Generative Recommendation
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 5642-5652
Open AccessAccumulative Modality Tokenization for Multimodal Generative Recommendation
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (11) , 7610-7623
Mix-Attention for Multimodal Large Language Model-Enhanced Sequential Recommendation
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (11) , 7610-7623
Mix-Attention for Multimodal Large Language Model-Enhanced Sequential Recommendation
- Open Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 771-780
Twin-Flow Generative Ranking Network for Recommendation
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 771-780
Open AccessTwin-Flow Generative Ranking Network for Recommendation
- Open Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1809-1818
ConGM: Contrastive Graph Matching for Graph Self-Supervised Learning
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1809-1818
Open AccessConGM: Contrastive Graph Matching for Graph Self-Supervised Learning
- Open Access
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 4105-4109
Boosting Meta-Learning Cold-Start Recommendation with Graph Neural Network
Meta-learning methods have shown to be effective in dealing with cold-start recommendation. However, most previous methods rely on an ideal assumption that there exists a similar data distribution between source and target tasks, which are unsuitable for the scenario that only extremely limited number of new user or item interactions are available. In this paper, we propose to boost meta-learning cold-start recommendation with graph neural network (MeGNN). First, it utilizes the global neighborhood translation learning to obtain consistent potential interactions for all new user and item nodes, which can refine their representations. Second, it employs the local neighborhood translation learning to predict specific potential interactions for each node, thus guaranteeing the personalized requirement. In experiments, we combine MeGNN with two representative meta-learning models MeLU and TaNP. Extensive results on two widely-used datasets show the superiority of MeGNN in four different scenarios.
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 4105-4109
Open AccessBoosting Meta-Learning Cold-Start Recommendation with Graph Neural Network
Meta-learning methods have shown to be effective in dealing with cold-start recommendation. However, most previous methods rely on an ideal assumption that there exists a similar data distribution between source and target tasks, which are unsuitable for the scenario that only extremely limited number of new user or item interactions are available. In this paper, we propose to boost meta-learning cold-start recommendation with graph neural network (MeGNN). First, it utilizes the global neighborhood translation learning to obtain consistent potential interactions for all new user and item nodes, which can refine their representations. Second, it employs the local neighborhood translation learning to predict specific potential interactions for each node, thus guaranteeing the personalized requirement. In experiments, we combine MeGNN with two representative meta-learning models MeLU and TaNP. Extensive results on two widely-used datasets show the superiority of MeGNN in four different scenarios.