REVIEW 3 cited by
Set-Encoder: Permutation-Invariant Inter-Passage Attention for Listwise Passage Re-Ranking with Cross-Encoders
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original 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.
Forward citations
Cited by 3 Pith papers
-
Shapley Context Pruning: A Cooperative Game Perspective for Context Reranking and Pruning
SCP ranks and prunes context sentences using Shapley values from a learned Deep Sets value function, matching or beating baselines on several multi-hop QA datasets at 50% compression.
-
Modeling Ranking Properties with In-Context Learning
In-context examples that encode a target distribution over document attributes can steer LLM rerankers toward fairness and diversity while roughly preserving relevance on four IR benchmarks.
-
Towards a Relevance Posterior in Neural Information Access
Fusing a cached query-independent document-quality prior with BM25 or re-rankers improves TREC DL nDCG, with largest gains for RankZephyr, under a prior–likelihood view of retrieval.
Discussion (0). Continue with ORCID to comment.