Sen Mei
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Sen Mei has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Shi Yu
Tsinghua University, Beijing, China
3 shared publications - Zhenghao Liu
Northeastern University, Shenyang, China
3 shared publications - Chenyan Xiong
Carnegie Mellon University, Pittsburgh, PA, USA
2 shared publications - Ge Yu
Northeastern University, Shenyang, China
2 shared publications - Yu Gu
Northeastern University
2 shared publications - Yukun Yan
Tsinghua University, Beijing, China
2 shared publications
Latest Publications
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 9294-9303
Mitigating Visual Hallucinations via Evidence-Guided Multi-Image Reasoning in Visual Retrieval-Augmented Generation
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 9294-9303
Open AccessMitigating Visual Hallucinations via Evidence-Guided Multi-Image Reasoning in Visual Retrieval-Augmented Generation
- Open Access
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1650-1661
LISRec: Modeling User Preferences with Learned Item Shortcuts for Sequential Recommendation
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1650-1661
Open AccessLISRec: Modeling User Preferences with Learned Item Shortcuts for Sequential Recommendation
- Open Access
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 1534-1544
Text Matching Improves Sequential Recommendation by Reducing Popularity Biases
This paper proposes Text mAtching based SequenTial rEcommenda-tion model (TASTE), which maps items and users in an embedding space and recommends items by matching their text representations. TASTE verbalizes items and user-item interactions using identifiers and attributes of items. To better characterize user behaviors, TASTE additionally proposes an attention sparsity method, which enables TASTE to model longer user-item interactions by reducing the self-attention computations during encoding. Our experiments show that TASTE outperforms the state-of-the-art methods on widely used sequential recommendation datasets. TASTE alleviates the cold start problem by representing long-tail items using full-text modeling and bringing the benefits of pretrained language models to recommendation systems. Our further analyses illustrate that TASTE significantly improves the recommendation accuracy by reducing the popularity bias of previous item id based recommendation models and returning more appropriate and text-relevant items to satisfy users. All codes are available at https://github.com/OpenMatch/TASTE.
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 1534-1544
Open AccessText Matching Improves Sequential Recommendation by Reducing Popularity Biases
This paper proposes Text mAtching based SequenTial rEcommenda-tion model (TASTE), which maps items and users in an embedding space and recommends items by matching their text representations. TASTE verbalizes items and user-item interactions using identifiers and attributes of items. To better characterize user behaviors, TASTE additionally proposes an attention sparsity method, which enables TASTE to model longer user-item interactions by reducing the self-attention computations during encoding. Our experiments show that TASTE outperforms the state-of-the-art methods on widely used sequential recommendation datasets. TASTE alleviates the cold start problem by representing long-tail items using full-text modeling and bringing the benefits of pretrained language models to recommendation systems. Our further analyses illustrate that TASTE significantly improves the recommendation accuracy by reducing the popularity bias of previous item id based recommendation models and returning more appropriate and text-relevant items to satisfy users. All codes are available at https://github.com/OpenMatch/TASTE.