arXiv Computation and Language
FLINT: Fixed-budget Late Interaction
Read the original on arXiv Computation and Language →The Flow has not summarised this story yet — read it at arXiv Computation and Language.
Related stories
arXiv AI
Aug 19
DEPT: Document Embedding Preservation Tuning for Unified Query Expansion and Retrieval
The paper introduces DEPT, a method that trains a single decoder-only large language model to both expand queries and encode documents for retrieval. By preserving document embeddings close to their initial cached values while allowing gradients to flow through the generator, DEPT stabilizes retrieval targets and enables efficient index reuse and online hard‑negative mining. Experiments on the BEIR benchmark with Qwen3‑4B‑Instruct‑2507 and LLaMA‑3.2‑3B‑Instruct show that DEPT outperforms training‑free, independently trained, and staged unified baselines, with ablations confirming the benefits of preservation, whitening, end‑to‑end expansion training, and online negatives.
Hugging Face Trending Papers
Jul 21
PLAID-PRF: Pseudo-Relevance Feedback with Centroid-like Tokens in PLAID
Multi-vector dense retrieval models, such as ColBERT, achieve strong retrieval effectiveness by modelling fine-grained token-level interactions between queries and documents. Methods such as PLAID use centroid-based quantisation of each token's vector to reduce the index size and speed up retrieval while maintaining strong effectiveness.
arXiv Computation and Language
Oct 12
Lychee-Reranker: Fast but Not Late Interaction for Compressed Document Reranking
Lychee‑Reranker is a fast, not‑late‑interaction reranker that decouples query and passage computation while preserving expressive relevance modeling. It uses an encoder–decoder architecture: passages are pre‑encoded with Matryoshka embedding pooling, and the decoder jointly processes system/user instructions and query intent, with cross‑attention capturing fine‑grained relevance. The design yields four benefits—offline passage encoding for efficiency, cross‑attention expressiveness, compact Matryoshka pooling, and adjustable test‑time compute—and is available in Nano, Small, and Large sizes (0.27B, 1B, and 4B activated parameters).
arXiv AI
Sep 10
Query-Aware Token Budgeting for Efficient Late-Interaction Visual Document Retrieval
arXiv:2609.07262v1 Announce Type: cross Abstract: Late-interaction visual document retrievers preserve fine-grained page evidence by storing many token embeddings per page, but the resulting storage...
Hugging Face Trending Papers
Jun 22
KaLM-Reranker-V1: Fast but Not Late Interaction for Compressed Document Reranking
As retrieval systems scale, high-quality reranking becomes increasingly important. However, most existing rerankers, whether encoder-based or decoder-based, jointly encode the query and passage, tightly coupling their computation and limiting deployment efficiency as well as flexibility.
arXiv AI
Oct 5
Query-aware routing for Cross-lingual performance gains in Encoders
The paper presents a method for improving cross‑lingual retrieval in multilingual encoders by adding a query‑only low‑rank adapter and deterministic routing based on language. The adapter, trained against frozen document embeddings, is used for cross‑lingual queries while the original encoder handles same‑language queries, preserving existing performance. Using the SampoTron LoRA adapter with the Nemotron‑3‑Embed‑1B model, the authors report a 20.9% relative gain in nDCG@10 across six English, Finnish, and Swedish directions on a financial benchmark, with all cross‑lingual directions improving and same‑language performance maintained.