Xin Xin 0007

dblp:35/1895-7 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2026
0000-0003-4703-7356ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 3 · 3 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
3 papers
Information retrieval · 60% Recommender systems · 26% Knowledge graphs · 13%
Artificial intelligence
1 paper
Vision and language · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › retrieval models
generative retrieval
1.922026
Model Editing for New Document Integration in Generative Information Retrieval · WWW 2026
Constrained Auto-Regressive Decoding Constrains Generative Retrieval · SIGIR 2025
Information retrieval › retrieval models › generative retrieval
document identifier generation
1.012026
Model Editing for New Document Integration in Generative Information Retrieval · WWW 2026
Knowledge graphs
constrained decoding
0.912025
Constrained Auto-Regressive Decoding Constrains Generative Retrieval · SIGIR 2025
Recommender systems › sequential recommendation › side information-enhanced sequential recommendation
multimodal sequential recommendation
0.912025
Efficient and Effective Adaptation of Multimodal Foundation Models in Sequential Recommendation · IEEE Trans. Knowl. Data Eng. 2025
Information retrieval
retrieval models
0.912025
Constrained Auto-Regressive Decoding Constrains Generative Retrieval · SIGIR 2025
Recommender systems
sequential recommendation
0.912025
Efficient and Effective Adaptation of Multimodal Foundation Models in Sequential Recommendation · IEEE Trans. Knowl. Data Eng. 2025
Computer vision › Vision and language › vision-language model
multimodal large language model
0.312025
Efficient and Effective Adaptation of Multimodal Foundation Models in Sequential Recommendation · IEEE Trans. Knowl. Data Eng. 2025
Information retrieval › retrieval models › neural retrieval
dense retrieval
0.312025
Constrained Auto-Regressive Decoding Constrains Generative Retrieval · SIGIR 2025

Methods — techniques the papers use, named apart from their topics

parameter-efficient fine-tuning · 1.7layer dropping · 1.7dimension transformation alignment · 1.7incremental training · 1.0beam search · 0.9autoregressive decoding · 0.9KL divergence analysis · 0.9
YearPublicationVenuePosition
2026 Model Editing for New Document Integration in Generative Information Retrieval
abstract
Generative retrieval (GR) reformulates the Information Retrieval (IR) task as the generation of document identifiers (docIDs). Despite its promise, existing GR models exhibit poor generalization to newly added documents, often failing to generate the correct docIDs. While incremental training offers a straightforward remedy, it is computationally expensive, resource-intensive, and prone to catastrophic forgetting, thereby limiting the scalability and practicality of GR.
Zihan Wang 0002, Xinyu Ma 0001, Shuaiqiang Wang, Dawei Yin 0001, Xin Xin 0007, Pengjie Ren, Maarten de Rijke, Zhaochun Ren
WWW6
2025 Constrained Auto-Regressive Decoding Constrains Generative Retrieval
abstract
Generative retrieval seeks to replace traditional search index data structures with a single large-scale neural network, offering the potential for improved efficiency and seamless integration with generative large language models. As an end-to-end paradigm, generative retrieval adopts a learned differentiable search index to conduct retrieval by directly generating document identifiers through corpus-specific constrained decoding. The generalization capabilities of generative retrieval on out-of-distribution corpora have gathered significant attention. Recent advances primarily focus on the problems arising from training strategies, and addressing them through various learning techniques. However, the fundamental challenges of generalization arising from constrained auto-regressive decoding still remain unexplored and systematically understudied. In this paper, we examine the inherent limitations of constrained auto-regressive generation from two essential perspectives: constraints and beam search. We begin with the Bayes-optimal setting where the generative retrieval model exactly captures the underlying relevance distribution of all possible documents. Then we apply the model to specific corpora by simply adding corpus-specific constraints. Our main findings are two-fold: (i) For the effect of constraints, we derive a lower bound of the error, in terms of the KL divergence between the ground-truth and the model-predicted step-wise marginal distributions. This error arises due to the unawareness of future constraints during generation and is shown to depend on the average Simpson diversity index of the relevance distribution. (ii) For the beam search algorithm used during generation, we reveal that the usage of marginal distributions may not be an ideal approach. Specifically, we prove that for sparse relevance distributions, beam search can achieve perfect top-1 precision but suffer from poor top-k recall performance. To support our theoretical findings, we conduct experiments on synthetic and real-world datasets, validating the existence of the error from adding constraints and the recall performance drop due to beam search. This paper aims to improve our theoretical understanding of the generalization capabilities of the auto-regressive decoding retrieval paradigm, laying a foundation for its limitations and inspiring future advancements toward more robust and generalizable generative retrieval.
Shiguang Wu 0003, Zhaochun Ren, Xin Xin 0007, Mengqi Zhang 0002, Zhumin Chen, Maarten de Rijke, Pengjie Ren
SIGIR3
2025 Efficient and Effective Adaptation of Multimodal Foundation Models in Sequential Recommendation
abstract
Multimodal foundation models (MFMs) have revolutionized sequential recommender systems through advanced representation learning. While Parameter-efficient Fine-tuning (PEFT) is commonly used to adapt these models, studies often prioritize parameter efficiency, neglecting GPU memory and training speed. To address this, we introduced the IISAN framework, significantly enhancing efficiency. However, IISAN was limited to symmetrical MFMs and identical text and image encoders, preventing the use of state-of-the-art Large Language Models. To overcome this, we developed IISAN-Versa, a versatile plug-and-play architecture compatible with both symmetrical and asymmetrical MFMs. IISAN-Versa employs a Decoupled PEFT structure and utilizes both intra- and inter-modal adaptation. It effectively handles asymmetry through a simple yet effective combination of group layer-dropping and dimension transformation alignment. Our research demonstrates that IISAN-Versa effectively adapts large text encoders, and we further identify a scaling effect where larger text encoders generally perform better. IISAN-Versa also demonstrates strong versatility in our defined multimodal scenarios, which include raw titles and captions generated from images and videos. Additionally, IISAN-Versa achieved state-of-the-art performance on the MicroLens public benchmark.
Junchen Fu, Xuri Ge, Xin Xin 0007, Alexandros Karatzoglou, Ioannis Arapakis, Kaiwen Zheng 0002, Yongxin Ni, Joemon M. Jose
IEEE Trans. Knowl. Data Eng.3