Found in the Middle: Permutation Self-Consistency Improves Listwise Ranking in Large Language Models
원문 초록
Large language models (LLMs) exhibit positional bias in how they use context, which especially complicates listwise ranking. To address this, we propose permutation self-consistency, a form of self-consistency over ranking list outputs of black-box LLMs. Our key idea is to marginalize out different list orders in the prompt to produce an order-independent ranking with less positional bias. First, given some input prompt, we repeatedly shuffle the list in the prompt and pass it through the LLM while holding the instructions the same. Next, we aggregate the resulting sample of rankings by computing the central ranking closest in distance to all of them, marginalizing out prompt order biases in the process. Theoretically, we prove the robustness of our method, showing convergence to the true ranking in the presence of random perturbations. Empirically, on five list-ranking datasets in sorting and passage reranking, our approach improves scores from conventional inference by up to 7-18% for GPT-3.5 and 8-16% for LLaMA v2 (70B), surpassing the previous state of the art in passage reranking. Our code is at https://github.com/castorini/perm-sc.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Rank-K: Test-Time Reasoning for Listwise Reranking
Leveraging Passage Embeddings for Efficient Listwise Reranking with Large Language Models
Passage-specific Prompt Tuning for Passage Reranking in Question Answering with Large Language Models
TWOLAR: a TWO-step LLM-Augmented distillation method for passage Reranking
InstUPR : Instruction-based Unsupervised Passage Reranking with Large Language Models
EcoRank: Budget-Constrained Text Re-ranking Using Large Language Models
토론
이 논문과 연결된 포럼 글이 아직 없습니다.