Parade: Passage ranking using demonstrations with llms

A Drozdov, H Zhuang, Z Dai, Z Qin… - Findings of the …, 2023 - aclanthology.org
Findings of the Association for Computational Linguistics: EMNLP 2023, 2023aclanthology.org
Recent studies show that large language models (LLMs) can be instructed to effectively
perform zero-shot passage re-ranking, in which the results of a first stage retrieval method,
such as BM25, are rated and reordered to improve relevance. In this work, we improve LLM-
based re-ranking by algorithmically selecting few-shot demonstrations to include in the
prompt. Our analysis investigates the conditions where demonstrations are most helpful, and
shows that adding even one demonstration is significantly beneficial. We propose a novel …
Abstract
Recent studies show that large language models (LLMs) can be instructed to effectively perform zero-shot passage re-ranking, in which the results of a first stage retrieval method, such as BM25, are rated and reordered to improve relevance. In this work, we improve LLM-based re-ranking by algorithmically selecting few-shot demonstrations to include in the prompt. Our analysis investigates the conditions where demonstrations are most helpful, and shows that adding even one demonstration is significantly beneficial. We propose a novel demonstration selection strategy based on difficulty rather than the commonly used semantic similarity. Furthermore, we find that demonstrations helpful for ranking are also effective at question generation. We hope our work will spur more principled research into question generation and passage ranking.
aclanthology.org
以上显示的是最相近的搜索结果。 查看全部搜索结果