Set-Encoder: Permutation-Invariant Inter-Passage Attention for Listwise Passage Re-Ranking with Cross-Encoders
Ferdinand Schlatt, Maik Fröbe, Harrisen Scells, Shengyao Zhuang, Bevan Koopman, Guido Zuccon, Benno Stein, Martin Potthast, Matthias Hagen
TL;DR
The paper tackles permutation sensitivity in cross-encoder passage re-ranking by introducing the Set-Encoder, a permutation-invariant architecture with inter-passage attention implemented via dedicated [INT] interaction tokens. Each passage is processed in parallel, and the [INT] tokens enable lightweight cross-passage information exchange while keeping positional encodings independent of passage order, leading to robust and efficient ranking. Empirically, the Set-Encoder matches state-of-the-art listwise models on Cranfield-style and TIREx datasets and often outperforms them in permutation-perturbed settings, while being substantially more efficient. When fine-tuned for novelty and duplicates, the model shows improved novelty-aware rankings, illustrating that permutation-invariant interactions can be leveraged to boost performance in specific ranking objectives; overall, permutation invariance emerges as a key factor for both effectiveness and efficiency in re-ranking.
Abstract
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.
