Dense retrieval embeddings can be decomposed into interpretable latent concepts that serve both as explanations and as efficient sparse indexing units for retrieval.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IR 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Decoding Dense Embeddings: Sparse Autoencoders for Interpreting and Discretizing Dense Retrieval
Dense retrieval embeddings can be decomposed into interpretable latent concepts that serve both as explanations and as efficient sparse indexing units for retrieval.