Yinqiong Cai
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yinqiong Cai has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Jiafeng Guo
School of Computer Science and Technology, University of Chinese Academy of Sciences, Beijing, China
4 shared publications - Keping Bi
State Key Laboratory of AI Safety, Beijing, China, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China, and University of Chinese Academy of Sciences, Beijing, China
4 shared publications - Wei Chen
China University of Mining and Technology
3 shared publications - Xueqi Cheng
Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing China
3 shared publications - Yixing Fan
State Key Laboratory of AI Safety; Institute of Computing Technology, Chinese Academy of Sciences; University of Chinese Academy of Sciences, China
2 shared publications - Da Li
State Key Laboratory of AI Safety, Beijing, China, Chinese Academy of Sciences, Institute of Computing Technology, Beijing, China, and University of Chinese Academy of Sciences, Beijing, China
1 shared publication
Latest Publications
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 156-166
Reconstructing Content with Collaborative Attention for Universal Multimodal Representation Learning
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 156-166
Open AccessReconstructing Content with Collaborative Attention for Universal Multimodal Representation Learning
- Open Access
- 21 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 238-248
How Do LLM-Generated Texts Impact Term-Based Retrieval Models?
- 21 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 238-248
Open AccessHow Do LLM-Generated Texts Impact Term-Based Retrieval Models?
- Open Access
- 16 January 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 43 (2) , 1-25
CAME: Competitively Learning a Mixture-of-Experts Model for First-stage Retrieval
The first-stage retrieval aims to retrieve a subset of candidate documents from a huge collection both effectively and efficiently. Since various matching patterns can exist between queries and relevant documents, previous work tries to combine multiple retrieval models to find as many relevant results as possible. The constructed ensembles, whether learned independently or jointly, do not care which component model is more suitable to an instance during training. Thus, they cannot fully exploit the capabilities of different types of retrieval models in identifying diverse relevance patterns. Motivated by this observation, in this article, we propose a Mixture-of-Experts (MoE) model consisting of representative matching experts and a novel competitive learning mechanism to let the experts develop and enhance their expertise during training. Specifically, our MoE model shares the bottom layers to learn common semantic representations and uses differently structured upper layers to represent various types of retrieval experts. Our competitive learning mechanism has two stages: (1) a standardized learning stage to train the experts equally to develop their capabilities to conduct relevance matching; (2) a specialized learning stage where the experts compete with each other on every training instance and get rewards and updates according to their performance to enhance their expertise on certain types of samples. Experimental results on retrieval benchmark datasets show that our method significantly outperforms the state-of-the-art baselines in the in-domain and out-of-domain settings.
- 16 January 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 43 (2) , 1-25
Open AccessCAME: Competitively Learning a Mixture-of-Experts Model for First-stage Retrieval
The first-stage retrieval aims to retrieve a subset of candidate documents from a huge collection both effectively and efficiently. Since various matching patterns can exist between queries and relevant documents, previous work tries to combine multiple retrieval models to find as many relevant results as possible. The constructed ensembles, whether learned independently or jointly, do not care which component model is more suitable to an instance during training. Thus, they cannot fully exploit the capabilities of different types of retrieval models in identifying diverse relevance patterns. Motivated by this observation, in this article, we propose a Mixture-of-Experts (MoE) model consisting of representative matching experts and a novel competitive learning mechanism to let the experts develop and enhance their expertise during training. Specifically, our MoE model shares the bottom layers to learn common semantic representations and uses differently structured upper layers to represent various types of retrieval experts. Our competitive learning mechanism has two stages: (1) a standardized learning stage to train the experts equally to develop their capabilities to conduct relevance matching; (2) a specialized learning stage where the experts compete with each other on every training instance and get rewards and updates according to their performance to enhance their expertise on certain types of samples. Experimental results on retrieval benchmark datasets show that our method significantly outperforms the state-of-the-art baselines in the in-domain and out-of-domain settings.
- Open Access
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 183-192
L2R: Lifelong Learning for First-stage Retrieval with Backward-Compatible Representations
First-stage retrieval is a critical task that aims to retrieve relevant document candidates from a large-scale collection. While existing retrieval models have achieved impressive performance, they are mostly studied on static data sets, ignoring that in the real-world, the data on the Web is continuously growing with potential distribution drift. Consequently, retrievers trained on static old data may not suit new-coming data well and inevitably produce sub-optimal results. In this work, we study lifelong learning for first-stage retrieval, especially focusing on the setting where the emerging documents are unlabeled since relevance annotation is expensive and may not keep up with data emergence. Under this setting, we aim to develop model updating with two goals: (1) to effectively adapt to the evolving distribution with the unlabeled new-coming data, and (2) to avoid re-inferring all embeddings of old documents to efficiently update the index each time the model is updated. We first formalize the task and then propose a novel Lifelong Learning method for the first-stage Retrieval, namely L2R. L2R adopts the typical memory mechanism for lifelong learning, and incorporates two crucial components: (1) selecting diverse support negatives for model training and memory updating for effective model adaptation, and (2) a ranking alignment objective to ensure the backward-compatibility of representations to save the cost of index rebuilding without hurting the model performance. For evaluation, we construct two new benchmarks from LoTTE and Multi-CPR datasets to simulate the document distribution drift in realistic retrieval scenarios. Extensive experiments show that L^2R significantly outperforms competitive lifelong learning baselines.
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 183-192
Open AccessL2R: Lifelong Learning for First-stage Retrieval with Backward-Compatible Representations
First-stage retrieval is a critical task that aims to retrieve relevant document candidates from a large-scale collection. While existing retrieval models have achieved impressive performance, they are mostly studied on static data sets, ignoring that in the real-world, the data on the Web is continuously growing with potential distribution drift. Consequently, retrievers trained on static old data may not suit new-coming data well and inevitably produce sub-optimal results. In this work, we study lifelong learning for first-stage retrieval, especially focusing on the setting where the emerging documents are unlabeled since relevance annotation is expensive and may not keep up with data emergence. Under this setting, we aim to develop model updating with two goals: (1) to effectively adapt to the evolving distribution with the unlabeled new-coming data, and (2) to avoid re-inferring all embeddings of old documents to efficiently update the index each time the model is updated. We first formalize the task and then propose a novel Lifelong Learning method for the first-stage Retrieval, namely L2R. L2R adopts the typical memory mechanism for lifelong learning, and incorporates two crucial components: (1) selecting diverse support negatives for model training and memory updating for effective model adaptation, and (2) a ranking alignment objective to ensure the backward-compatibility of representations to save the cost of index rebuilding without hurting the model performance. For evaluation, we construct two new benchmarks from LoTTE and Multi-CPR datasets to simulate the document distribution drift in realistic retrieval scenarios. Extensive experiments show that L^2R significantly outperforms competitive lifelong learning baselines.