Yu-An Liu
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
Yu-An Liu has a total of 22 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
14 shared publications - Ruqing Zhang
State Key Laboratory of AI Safety, The Institute of Computing Technology,CAS, Beijing, Beijing, China and University of Chinese Academy of Sciences, Beijing, Beijing, China
14 shared publications - Maarten de Rijke
University of Amsterdam, Amsterdam, Netherlands
10 shared publications - Xueqi Cheng
Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing China
9 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
7 shared publications - Changjiang Zhou
State Key Laboratory of AI Safety; Institute of Computing Technology, Chinese Academy of Sciences; University of Chinese Academy of Sciences, China
2 shared publications
Latest Publications
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 3970-3975
Is a Busy Search Agent a Good One? Overthinking and Overretrieval at Scale
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 3970-3975
Open AccessIs a Busy Search Agent a Good One? Overthinking and Overretrieval at Scale
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 4145-4150
AdversarialCoT: Single-Document Retrieval Poisoning for LLM Reasoning
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 4145-4150
Open AccessAdversarialCoT: Single-Document Retrieval Poisoning for LLM Reasoning
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1983-1992
Déjà Vu of Strange Stickers! Enhancing Out-of-Distribution Robustness in Sticker Retrieval via Cross-Modal Intent Alignment
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1983-1992
Open AccessDéjà Vu of Strange Stickers! Enhancing Out-of-Distribution Robustness in Sticker Retrieval via Cross-Modal Intent Alignment
- Open Access
- 14 November 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 44 (1) , 1-48
Robust Neural Information Retrieval: An Adversarial and Out-of-Distribution Perspective
Recent advances in neural information retrieval models have significantly enhanced these models’ effectiveness across information retrieval tasks. The robustness of these models, which is essential for ensuring their reliability in practice, has also garnered significant attention. With a wide array of research on robust information retrieval being published, we believe it is the opportune moment to consolidate the current status, glean insights from existing methodologies, and lay the groundwork for future development. Robustness of information retrieval is a multifaceted concept and we emphasize the importance of robustness against performance variance, out-of-distribution scenarios, and adversarial attacks. With a focus on out-of-distribution and adversarial robustness, we dissect robustness solutions for dense retrieval models and neural ranking models, respectively, recognizing them as pivotal components of the neural information retrieval pipeline. We provide an in-depth discussion of methods, datasets, and evaluation metrics, shedding light on challenges and future directions in the era of large language models. To accompany this survey, we release three additional resources: (1) a curated list of publications related to robust information retrieval, (2) a tutorial based on this survey, and (3) a heterogeneous benchmark for robust information retrieval, BestIR, that collects all known datasets for evaluating information retrieval systems for robustness. We hope that this study provides useful clues for future research on the robustness of information retrieval models and helps to develop trustworthy IR systems.
- 14 November 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 44 (1) , 1-48
Open AccessRobust Neural Information Retrieval: An Adversarial and Out-of-Distribution Perspective
Recent advances in neural information retrieval models have significantly enhanced these models’ effectiveness across information retrieval tasks. The robustness of these models, which is essential for ensuring their reliability in practice, has also garnered significant attention. With a wide array of research on robust information retrieval being published, we believe it is the opportune moment to consolidate the current status, glean insights from existing methodologies, and lay the groundwork for future development. Robustness of information retrieval is a multifaceted concept and we emphasize the importance of robustness against performance variance, out-of-distribution scenarios, and adversarial attacks. With a focus on out-of-distribution and adversarial robustness, we dissect robustness solutions for dense retrieval models and neural ranking models, respectively, recognizing them as pivotal components of the neural information retrieval pipeline. We provide an in-depth discussion of methods, datasets, and evaluation metrics, shedding light on challenges and future directions in the era of large language models. To accompany this survey, we release three additional resources: (1) a curated list of publications related to robust information retrieval, (2) a tutorial based on this survey, and (3) a heterogeneous benchmark for robust information retrieval, BestIR, that collects all known datasets for evaluating information retrieval systems for robustness. We hope that this study provides useful clues for future research on the robustness of information retrieval models and helps to develop trustworthy IR systems.
- Open Access
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 4142-4145
Robust-IR @ SIGIR 2025: The First Workshop on Robust Information Retrieval
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 4142-4145
Open AccessRobust-IR @ SIGIR 2025: The First Workshop on Robust Information Retrieval
- Open Access
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 2351-2360
On the Scaling of Robustness and Effectiveness in Dense Retrieval
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 2351-2360
Open AccessOn the Scaling of Robustness and Effectiveness in Dense Retrieval
- 4 April 2025
- Published by Springer Nature
- p. 407-423
On the Robustness of Generative Information Retrieval Models: An Out-of-Distribution Perspective
- 4 April 2025
- Published by Springer Nature
- p. 407-423
On the Robustness of Generative Information Retrieval Models: An Out-of-Distribution Perspective
- Open Access
Robust-IR @ SIGIR 2025: The First Workshop on Robust Information Retrieval
With the advancement of information retrieval (IR) technologies, robustness is increasingly attracting attention. When deploying technology into practice, we consider not only its average performance under normal conditions but, more importantly, its ability to maintain functionality across a variety of exceptional situations. In recent years, the research on IR robustness covers theory, evaluation, methodology, and application, and all of them show a growing trend. The purpose of this workshop is to systematize the latest results of each research aspect, to foster comprehensive communication within this niche domain while also bridging robust IR research with the broader community, and to promote further future development of robust IR. To avoid the one-sided talk of mini-conferences, this workshop adopts a highly interactive format, including round-table and panel discussion sessions, to encourage active participation and meaningful exchange among attendees.
Open AccessRobust-IR @ SIGIR 2025: The First Workshop on Robust Information Retrieval
With the advancement of information retrieval (IR) technologies, robustness is increasingly attracting attention. When deploying technology into practice, we consider not only its average performance under normal conditions but, more importantly, its ability to maintain functionality across a variety of exceptional situations. In recent years, the research on IR robustness covers theory, evaluation, methodology, and application, and all of them show a growing trend. The purpose of this workshop is to systematize the latest results of each research aspect, to foster comprehensive communication within this niche domain while also bridging robust IR research with the broader community, and to promote further future development of robust IR. To avoid the one-sided talk of mini-conferences, this workshop adopts a highly interactive format, including round-table and panel discussion sessions, to encourage active participation and meaningful exchange among attendees.
- Open Access
- 10 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 1008-1011
Robust Information Retrieval
Beyond effectiveness, the robustness of an information retrieval (IR) system is increasingly attracting attention. When deployed, a critical technology such as IR should not only deliver strong performance on average but also have the ability to handle a variety of exceptional situations. In recent years, research into the robustness of IR has seen significant growth, with numerous researchers offering extensive analyses and proposing myriad strategies to address robustness challenges. In this tutorial, we first provide background information covering the basics and a taxonomy of robustness in IR. Then, we examine adversarial robustness and out-of-distribution (OOD) robustness within IR-specific contexts, extensively reviewing recent progress in methods to enhance robustness. The tutorial concludes with a discussion on the robustness of IR in the context of large language models (LLMs), highlighting ongoing challenges and promising directions for future research. This tutorial aims to generate broader attention to robustness issues in IR, facilitate an understanding of the relevant literature, and lower the barrier to entry for interested researchers and practitioners.
- 10 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 1008-1011
Open AccessRobust Information Retrieval
Beyond effectiveness, the robustness of an information retrieval (IR) system is increasingly attracting attention. When deployed, a critical technology such as IR should not only deliver strong performance on average but also have the ability to handle a variety of exceptional situations. In recent years, research into the robustness of IR has seen significant growth, with numerous researchers offering extensive analyses and proposing myriad strategies to address robustness challenges. In this tutorial, we first provide background information covering the basics and a taxonomy of robustness in IR. Then, we examine adversarial robustness and out-of-distribution (OOD) robustness within IR-specific contexts, extensively reviewing recent progress in methods to enhance robustness. The tutorial concludes with a discussion on the robustness of IR in the context of large language models (LLMs), highlighting ongoing challenges and promising directions for future research. This tutorial aims to generate broader attention to robustness issues in IR, facilitate an understanding of the relevant literature, and lower the barrier to entry for interested researchers and practitioners.
- Open Access
- 10 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1391-1400
Multi-granular Adversarial Attacks against Black-box Neural Ranking Models
Adversarial ranking attacks have gained increasing attention due to their success in probing vulnerabilities, and, hence, enhancing the robustness, of neural ranking models. Conventional attack methods employ perturbations at a single granularity, e.g., word or sentence level, to target documents. However, limiting perturbations to a single level of granularity may reduce the flexibility of adversarial examples, thereby diminishing the potential threat of the attack. Therefore, we focus on generating high-quality adversarial examples by incorporating multi-granular perturbations. Achieving this objective involves tackling a combinatorial explosion problem, which requires identifying an optimal combination of perturbations across all possible levels of granularity, positions, and textual pieces. To address this challenge, we transform the multi-granular adversarial attack into a sequential decision-making process, where perturbations in the next attack step build on the perturbed document in the current attack step. Since the attack process can only access the final state without direct intermediate signals, we use reinforcement learning to perform multi-granular attacks. During the reinforcement learning process, two agents work cooperatively to identify multi-granular vulnerabilities as attack targets and organize perturbation candidates into a final perturbation sequence. Experimental results show that our attack method surpasses prevailing baselines in both attack effectiveness and imperceptibility.
- 10 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1391-1400
Open AccessMulti-granular Adversarial Attacks against Black-box Neural Ranking Models
Adversarial ranking attacks have gained increasing attention due to their success in probing vulnerabilities, and, hence, enhancing the robustness, of neural ranking models. Conventional attack methods employ perturbations at a single granularity, e.g., word or sentence level, to target documents. However, limiting perturbations to a single level of granularity may reduce the flexibility of adversarial examples, thereby diminishing the potential threat of the attack. Therefore, we focus on generating high-quality adversarial examples by incorporating multi-granular perturbations. Achieving this objective involves tackling a combinatorial explosion problem, which requires identifying an optimal combination of perturbations across all possible levels of granularity, positions, and textual pieces. To address this challenge, we transform the multi-granular adversarial attack into a sequential decision-making process, where perturbations in the next attack step build on the perturbed document in the current attack step. Since the attack process can only access the final state without direct intermediate signals, we use reinforcement learning to perform multi-granular attacks. During the reinforcement learning process, two agents work cooperatively to identify multi-granular vulnerabilities as attack targets and organize perturbation candidates into a final perturbation sequence. Experimental results show that our attack method surpasses prevailing baselines in both attack effectiveness and imperceptibility.