Skip to content
Preprint

EXCISE: Query-Side Exclusion for Late-Interaction Retrieval

Aug 2026 · 0 citations · 45 references
Computer Science

TL;DR

Across six collections and three backbones, EXCISE is the strongest system in all eighteen backbone-collection cells against that backbone's own frozen and fine-tuned baselines, and outperforms every fine-tuned cross-encoder, each of which loses no-harm nDCG@10.

Abstract

Late-interaction retrievers handle exclusion queries poorly. When a user asks for X but not Z, the additive MaxSim score promotes documents covering Z, a problem we call exclusion inversion. We show that no readout of the frozen vectors recovers the constraint, because the difficulty lies in identifying the excluded topic, which depends on the query alone. EXCISE operates at query time and corrects the inversion while leaving the index frozen. Two query-side modules totalling 1.5M parameters identify the topic and re-embed a 100-document shortlist, and a parameter-free rule demotes candidates matching that topic. Across six collections and three backbones, EXCISE is the strongest system in all eighteen backbone-collection cells against that backbone's own frozen and fine-tuned baselines. It raises exclusion success@10 on ExcluIR from 0.058 to 0.691 and raises Boolean NOT accuracy from 0.25-0.29 to 0.90-0.92. Pooled over 1,860 queries, it outperforms every fine-tuned cross-encoder, each of which loses no-harm nDCG@10, whereas EXCISE matches its frozen baseline on its strongest backbone. We release X-BENCH, a tiered benchmark of explicit, implicit, and compound exclusions with no-harm and Boolean controls.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

PILLAR: Private Inverted-Index Lexical Lookup for Augmented Retrieval

PILLAR is a Privacy-Preserving RAG system based on Private Information Retrieval (PIR) in which a client utilizes the k documents most similar to their query from a server-held and publicly known corpus to respond to their query, while the server learns nothing about the query, either its terms or its access pattern.

Truong Son Nguyen, D. Blackley, Ni Trieu et al. · 0 citations
Preprint Sep 2026

Top-K Is Not a Budget for Hybrid Retrieval

DiBud is presented, which takes an access budget directly as input and incrementally certifies and returns an exact prefix of the RRF ranking over the full lists, and investigates long-tailed costs for completing exact Top-20.

Chunran Zhang · 0 citations
#artificial intelligence Preprint Aug 2026

Efficient GPU Retrieval for Semantic Search

A policy-aligned retrieval framework that improves offline relevance over a matched-capacity baseline, with gains broadly distributed across facet combinations, and serves this framework with a two-stage GPU architecture.

Dhritiman Das, Chujie Zheng, Ronak Kaoshik et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.