Dense image retrieval is accurate but offers limited interpretability and attribution, and it can be compute-intensive at scale. We present BM25-V, which applies Okapi BM25 scoring to sparse visual-word activations from a Sparse Auto-Encoder (SAE) on Vision Transformer patch features. Across a large gallery, visual-word document frequencies are highly imbalanced and follow a Zipfian-like distribution, making BM25's inverse document frequency (IDF) weighting well suited for suppressing ubiquitous, low-information words and emphasizing rare, discriminative ones. BM25-V retrieves high-recall candidates via sparse inverted-index operations and serves as an efficient first-stage retriever for dense reranking. Across seven benchmarks, BM25-V achieves Recall@200 ≥ 0.993, enabling a two-stage pipeline that reranks only K=200 candidates per query and recovers near-dense accuracy within 0.2% on average. An SAE trained once on ImageNet-1K transfers zero-shot to seven fine-grained benchmarks without fine-tuning, and BM25-V retrieval decisions are attributable to specific visual words with quantified IDF contributions.
Figures & tables
Text BM25
BM25-V (visual)
Document d
Image I
Term vocabulary {t}
SAE dimensions {0,…,eD−1}
Term frequency ft(d)
v[i]=∑pH~[p,i] (sum-pool)
Document length ∣d∣
∥v∥1 (L1 norm)
Document freq dft
dfi=∣{j:vj[i]>0}∣
IDFt
IDFi=ln(1+dfi+0.5N−dfi+0.5)
Table 1: The text–vision BM25 analogy is structural, not metaphorical. Sum-pooling SAE activations across all P patch tokens is mathematically equivalent to counting term occurrences across document tokens. Here H~∈RP×eD denotes the SAE activation matrix ( H~[p,i] is the activation of dimension i at patch p ), and eD is the SAE feature dimension.
CUB-200
Cars-196
Aircraft
Pets
Flowers-102
DTD
Food-101
Method
R@1
R@5
R@10
R@1
R@5
R@10
R@1
R@5
R@10
R@1
R@5
R@10
R@1
R@5
R@10
R@1
R@5
R@10
R@1
R@5
R@10
Dense †
.767
.948
.975
.922
.988
.996
.707
.915
.966
.912
.982
.990
.989
.997
.998
.762
.912
.946
.954
.987
.992
FAISS-HNSW †
.768
.948
.975
.922
.988
.996
.708
.915
.966
.912
.982
.990
.989
.997
.998
.762
.912
.946
.954
.987
.992
FAISS-IVF+PQ †
.734
.918
.947
.897
.978
.987
.715
.918
.958
.915
.957
.965
.941
.956
.958
.706
.847
.880
.941
.974
.980
BM25-V (ours)
.472
.738
.835
.715
.900
.946
.523
.765
.851
.771
.923
.962
.954
.986
.993
.747
.888
.930
.865
.947
.965
Two-stage K=100 (ours)
.744
.929
.960
.914
.983
.990
.701
.908
.960
.916
.979
.988
.990
.997
.998
.769
.919
.955
.946
.980
.986
Table 2: R@1/5/10 on cross-domain fine-grained retrieval (7 datasets). SAE trained on ImageNet-1K, zero-shot. Two-stage: BM25-V top- K candidates → dense cosine rerank. † Dense-only methods (no interpretability).
k
R@1
Index size (MB)
16
0.508
35.8
32
0.483
61.7
64
0.396
97.2
128
0.038
140.6
Table 3: Effect of sparsity k on CUB-200-2011 (R@1 and sparse index size). Low k preserves discriminative structure; k=128 collapses.
Method
Memory/vec
Compression
Query ops
Dense (exact)
4D
1×
2DN
HNSW [ 17 ]
4(D+2M)
≈1×
2D⋅ef
IVF+PQ [ 10 ]
m⋅bPQ
up to 192×
nlnpmN
BM25-V (ours)
6L0
48×
VactiveC⋅L02N†
Two-stage (ours)
4D+6L0
≈1×
VactiveC⋅L02N+KD
Table 4: Efficiency comparison. Memory is per-vector storage; query cost counts scoring operations for one query against N reference images. D : dense embedding dimension; M , ef: HNSW graph degree and search budget; m , bPQ : PQ sub-quantizers and bytes per code; np , nl : IVF probe and list counts; L0 : non-zeros per sparse vector; C : FLOPs per BM25 posting entry. Our config: D=1152 , M=32 , ef=100 , m=48 , bPQ=1 , nl=100 , np=1 , L0=16 , K=200 . †Vactive ranges from 527 to 3,240 across our benchmarks; as N grows, Vactive→Ds and cost →CL02N/Ds ( Eq. 11 ).
Figure 1: Normalized rank-frequency log-log plot for all 7 datasets. Each curve is normalized so rank-1 frequency =1 . Near-parallel lines confirm a common power-law family with α∈[1.20,2.32] ; slopes steeper than text Zipf ( α≈1 ) show that visual words are more heavy-tailed than natural language.
We propose Latent Terms, a method revealing that models trained for dense retrieval, whether single- or multi-vector, learn representations that can trivially be decomposed into retrieval-ready sparse features. When trained on frozen retrievers, Sparse Autoencoders without any retrieval-specific adjustments extract a latent vocabulary with approximately Zipfian collection statistics, directly suitable for classical sparse retrieval scoring via BM25. This approach enables sparse retrieval while requiring no learned expansion objective or sparse retrieval supervision whatsoever, and can be readily applied to any dense retriever. Latent Terms is able to match or outperform single-vector scoring methods from its own base model as well as comparable SPLADE variants. In addition, it substantially outperforms its base model on LIMIT, a task specifically designed to highlight the failures of single-vector retrieval. Overall, our results highlight that neural retrievers contain more expressive and indexable structure than their default scoring functions expose, but that other methods can nonetheless be leveraged.
Benjamin Clavié, Sean Lee, Aamir Shakir +1
Mixedbread AI · National Institute of Informatics (NII) · University of Tsukuba
As large-scale visual-document corpora such as arXiv papers and enterprise PDFs continue to grow, visual-document retrieval has gained increasing attention; yet it still lacks a deployable system that lexically indexes visual documents to serve queries without neural encoding at scale. Existing methods either achieve strong retrieval quality with VLM-based dense or multi-vector models but require neural query encoding at serving time, or avoid query encoding with OCR- or caption-based BM25 at the cost of time-consuming text extraction or generation. To fill this missing serving regime, we present V-SPLADE, an inference-free sparse retriever for visual-document retrieval. However, such inference-free multimodal learned sparse retrieval systems remain underexplored and have not yet shown dense-level effectiveness under high sparsity. We attribute this limitation to a lexical grounding problem: visual sparse representations often fail to capture the lexical content embedded in document images. To address this problem, we introduce caption-gated token supervision, a training-only signal that uses VLM-generated captions as lexical cues to activate retrieval-relevant vocabulary dimensions. With this supervision, V-SPLADE improves average NDCG@5 across six visual-document retrieval benchmarks by +13.8pp over the same-scale dense baseline and by up to +6.3pp over OCR- or caption-based BM25 baselines. On an 18.7M-document corpus, it more than doubles R@5 over the same-scale dense baseline and further improves competing retrievers through score fusion by up to +2.4pp R@5. Code will be released soon at https://github.com/naver/v-splade.
Gyu-Hwung Cho, Youngjune Lee, Kiyoon Jeong +5
NAVER Corp., Republic of Korea · Seoul National University, Republic of Korea · NAVER Corp. +6
Visual document retrieval has become essential for accessing information in visually rich documents. Existing approaches fall into two camps. Late-interaction retrievers achieve strong quality through fine-grained token-level matching but store hundreds of vectors per page, incurring large index footprints and high serving costs. By contrast, dense single-vector retrievers retain storage and latency advantages but consistently lag in quality because they compress all information into a single final-layer embedding. In this work, we first conduct a layerwise diagnostic on single-vector retrievers, revealing that retrieval-relevant signal resides in internal representations. Motivated by these findings, we propose MINER (Mining Multimodal Internal RepreseNtation for Efficient Retrieval), a lightweight plug-in module that probes and fuses internal signals across transformer layers into a single compact embedding without modifying the backbone or sacrificing single-vector efficiency. The first Retrieval-Aligned Layer Probing stage attaches a lightweight probe at each layer, surfacing which dimensions carry retrieval-relevant information. The subsequent Adaptive Sparse Multi-Layer Fusion stage applies performance-adaptive neuron-level masking to the selected layers and fuses the surviving signals into the final dense vector. Across ViDoRe V1/V2/V3, MINER outperforms existing dense single-vector retrievers on the majority of benchmarks, with up to 4.5% nDCG@5 improvement over its corresponding backbone. Compared to strong late-interaction baselines, in some settings MINER substantially narrows the nDCG@5 gap to 0.2 while preserving the storage and serving advantages of dense retrieval.
Weien Li, Rui Song, Zeyu Li +8
McGill University · MIT - Massachusetts Institute of Technology · University of Cambridge +3