Xiaoyang Chen
Author directory2026
Beyond Polarization: The Generative Constraint of Chain-of-Thought in Pointwise Reranking
Xiaoyang Chen | Jie Liu | Haijin Liang | Haibo Shi | Jin Ma | Ben He | Yingfei Sun | Dezhi Ye
Findings of the Association for Computational Linguistics: EMNLP 2026
Xiaoyang Chen | Jie Liu | Haijin Liang | Haibo Shi | Jin Ma | Ben He | Yingfei Sun | Dezhi Ye
Findings of the Association for Computational Linguistics: EMNLP 2026
In pointwise document reranking, Chain-of-Thought models typically underperform direct scoring models. While existing diagnostics attribute this to inferior classification, score polarization, or calibration breakdown, whether targeted training can bridge this gap remains unclear. Our empirical study first confirms that this gap is stable across scales up to 32B parameters, ruling out model and data capacity confounders. We then apply stress tests utilizing reinforcement learning, fine-grained supervision, and architectural decoupling to explicitly repair these deviations. Although these interventions improve classification accuracy and absolute scores, the relative ranking gap persists. These findings suggest that, within the pointwise scoring paradigm, routing continuous relevance semantics through discrete text constrains ranking signal resolution, revealing a bottleneck that is stable and difficult to overcome under current standard methods, rather than an easily resolvable training bias.
Rank4Gen: RAG-Preference-Aligned Document Set Selection and Ranking
Yongqi Fan | Yuxiang Chu | Zhentao Xia | Xiaoyang Chen | Jie Liu | Haijin Liang | Jin Ma | Ben He | Yingfei Sun | Jie Zhai | Dezhi Ye | Tong Ruan
Findings of the Association for Computational Linguistics: EMNLP 2026
Yongqi Fan | Yuxiang Chu | Zhentao Xia | Xiaoyang Chen | Jie Liu | Haijin Liang | Jin Ma | Ben He | Yingfei Sun | Jie Zhai | Dezhi Ye | Tong Ruan
Findings of the Association for Computational Linguistics: EMNLP 2026
In the RAG paradigm, document ranking determines the evidence available to downstream generators. Through controlled analysis, we identify two phenomena underexplored by existing rankers: (i) downstream response quality depends not only on relevance but also on the composition and ordering of selected documents, and (ii) such preferences differ systematically across generators. However, existing rankers are trained purely on query–document relevance, leaving both phenomena unmodeled. To close this gap, we construct PRISM, a bilingual preference-aligned dataset built through a four-stage pipeline that compresses the combinatorial subset-and-ordering space by roughly four orders of magnitude and produces response-quality preference supervision conditioned on seven downstream generators. On a 13k-query subset of PRISM, we train Rank4Gen, a generator-aware ranker that performs joint document set selection and ordering. Experiments on five challenging RAG benchmarks show that Rank4Gen improves downstream QA quality on most evaluated generators, with per-generator F1 gains of up to +2.08 over the strongest set-selection baseline. Code is available at https://github.com/JOHNNY-fans/Rank4Gen.
2025
Match, Compare, or Select? An Investigation of Large Language Models for Entity Matching
Tianshu Wang | Xiaoyang Chen | Hongyu Lin | Xuanang Chen | Xianpei Han | Le Sun | Hao Wang | Zhenyu Zeng
Proceedings of the 31st International Conference on Computational Linguistics
Tianshu Wang | Xiaoyang Chen | Hongyu Lin | Xuanang Chen | Xianpei Han | Le Sun | Hao Wang | Zhenyu Zeng
Proceedings of the 31st International Conference on Computational Linguistics
Entity matching (EM) is a critical step in entity resolution (ER). Recently, entity matching based on large language models (LLMs) has shown great promise. However, current LLM-based entity matching approaches typically follow a binary matching paradigm that ignores the global consistency among record relationships. In this paper, we investigate various methodologies for LLM-based entity matching that incorporate record interactions from different perspectives. Specifically, we comprehensively compare three representative strategies: matching, comparing, and selecting, and analyze their respective advantages and challenges in diverse scenarios. Based on our findings, we further design a compound entity matching framework (ComEM) that leverages the composition of multiple strategies and LLMs. ComEM benefits from the advantages of different sides and achieves improvements in both effectiveness and efficiency. Experimental results on 8 ER datasets and 10 LLMs verify the superiority of incorporating record interactions through the selecting strategy, as well as the further cost-effectiveness brought by ComEM.
2024
Spiral of Silence: How is Large Language Model Killing Information Retrieval?—A Case Study on Open Domain Question Answering
Xiaoyang Chen | Ben He | Hongyu Lin | Xianpei Han | Tianshu Wang | Boxi Cao | Le Sun | Yingfei Sun
Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Xiaoyang Chen | Ben He | Hongyu Lin | Xianpei Han | Tianshu Wang | Boxi Cao | Le Sun | Yingfei Sun
Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
The practice of Retrieval-Augmented Generation (RAG), which integrates Large Language Models (LLMs) with retrieval systems, has become increasingly prevalent. However, the repercussions of LLM-derived content infiltrating the web and influencing the retrieval-generation feedback loop are largely uncharted territories. In this study, we construct and iteratively run a simulation pipeline to deeply investigate the short-term and long-term effects of LLM text on RAG systems. Taking the trending Open Domain Question Answering (ODQA) task as a point of entry, our findings reveal a potential digital “Spiral of Silence” effect, with LLM-generated text consistently outperforming human-authored content in search rankings, thereby diminishing the presence and impact of human contributions online. This trend risks creating an imbalanced information ecosystem, where the unchecked proliferation of erroneous LLM-generated content may result in the marginalization of accurate information. We urge the academic community to take heed of this potential issue, ensuring a diverse and authentic digital information landscape.
2023
Understanding Differential Search Index for Text Retrieval
Xiaoyang Chen | Yanjiang Liu | Ben He | Le Sun | Yingfei Sun
Findings of the Association for Computational Linguistics: ACL 2023
Xiaoyang Chen | Yanjiang Liu | Ben He | Le Sun | Yingfei Sun
Findings of the Association for Computational Linguistics: ACL 2023
The Differentiable Search Index (DSI) is a novel information retrieval (IR) framework that utilizes a differentiable function to generate a sorted list of document identifiers in response to a given query. However, due to the black-box nature of the end-to-end neural architecture, it remains to be understood to what extent DSI possesses the basic indexing and retrieval abilities. To mitigate this gap, in this study, we define and examine three important abilities that a functioning IR framework should possess, namely, exclusivity, completeness, and relevance ordering. Our analytical experimentation shows that while DSI demonstrates proficiency in memorizing the unidirectional mapping from pseudo queries to document identifiers, it falls short in distinguishing relevant documents from random ones, thereby negatively impacting its retrieval effectiveness. To address this issue, we propose a multi-task distillation approach to enhance the retrieval quality without altering the structure of the model and successfully endow it with improved indexing abilities. Through experiments conducted on various datasets, we demonstrate that our proposed method outperforms previous DSI baselinesThe code and data for this work can be found at https://github.com/VerdureChen/Understang_DSI.