Set-Encoder: Permutation-Invariant Inter-Passage Attention for Listwise Passage Re-Ranking with Cross-Encoders

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Schlatt, Ferdinand, Fröbe, Maik, Scells, Harrisen, Zhuang, Shengyao, Koopman, Bevan, Zuccon, Guido, Stein, Benno, Potthast, Martin, Hagen, Matthias
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866916674274328576
author Schlatt, Ferdinand
Fröbe, Maik
Scells, Harrisen
Zhuang, Shengyao
Koopman, Bevan
Zuccon, Guido
Stein, Benno
Potthast, Martin
Hagen, Matthias
author_facet Schlatt, Ferdinand
Fröbe, Maik
Scells, Harrisen
Zhuang, Shengyao
Koopman, Bevan
Zuccon, Guido
Stein, Benno
Potthast, Martin
Hagen, Matthias
contents Existing cross-encoder models can be categorized as pointwise, pairwise, or listwise. Pairwise and listwise models allow passage interactions, which typically makes them more effective than pointwise models but less efficient and less robust to input passage order permutations. To enable efficient permutation-invariant passage interactions during re-ranking, we propose a new cross-encoder architecture with inter-passage attention: the Set-Encoder. In experiments on TREC Deep Learning and TIREx, the Set-Encoder is as effective as state-of-the-art listwise models while being more efficient and invariant to input passage order permutations. Compared to pointwise models, the Set-Encoder is particularly more effective when considering inter-passage information, such as novelty, and retains its advantageous properties compared to other listwise models. Our code is publicly available at https://github.com/webis-de/ECIR-25.
format Preprint
id arxiv_https___arxiv_org_abs_2404_06912
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Set-Encoder: Permutation-Invariant Inter-Passage Attention for Listwise Passage Re-Ranking with Cross-Encoders
Schlatt, Ferdinand
Fröbe, Maik
Scells, Harrisen
Zhuang, Shengyao
Koopman, Bevan
Zuccon, Guido
Stein, Benno
Potthast, Martin
Hagen, Matthias
Information Retrieval
Existing cross-encoder models can be categorized as pointwise, pairwise, or listwise. Pairwise and listwise models allow passage interactions, which typically makes them more effective than pointwise models but less efficient and less robust to input passage order permutations. To enable efficient permutation-invariant passage interactions during re-ranking, we propose a new cross-encoder architecture with inter-passage attention: the Set-Encoder. In experiments on TREC Deep Learning and TIREx, the Set-Encoder is as effective as state-of-the-art listwise models while being more efficient and invariant to input passage order permutations. Compared to pointwise models, the Set-Encoder is particularly more effective when considering inter-passage information, such as novelty, and retains its advantageous properties compared to other listwise models. Our code is publicly available at https://github.com/webis-de/ECIR-25.
title Set-Encoder: Permutation-Invariant Inter-Passage Attention for Listwise Passage Re-Ranking with Cross-Encoders
topic Information Retrieval
url https://arxiv.org/abs/2404.06912