Investigating the Scalability of Approximate Sparse Retrieval Algorithms to Massive Datasets
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909462746365952 |
|---|---|
| author | Bruch, Sebastian Nardini, Franco Maria Rulli, Cosimo Venturini, Rossano Venuta, Leonardo |
| author_facet | Bruch, Sebastian Nardini, Franco Maria Rulli, Cosimo Venturini, Rossano Venuta, Leonardo |
| contents | Learned sparse text embeddings have gained popularity due to their effectiveness in top-k retrieval and inherent interpretability. Their distributional idiosyncrasies, however, have long hindered their use in real-world retrieval systems. That changed with the recent development of approximate algorithms that leverage the distributional properties of sparse embeddings to speed up retrieval. Nonetheless, in much of the existing literature, evaluation has been limited to datasets with only a few million documents such as MSMARCO. It remains unclear how these systems behave on much larger datasets and what challenges lurk in larger scales. To bridge that gap, we investigate the behavior of state-of-the-art retrieval algorithms on massive datasets. We compare and contrast the recently-proposed Seismic and graph-based solutions adapted from dense retrieval. We extensively evaluate Splade embeddings of 138M passages from MsMarco-v2 and report indexing time and other efficiency and effectiveness metrics. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_11628 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Investigating the Scalability of Approximate Sparse Retrieval Algorithms to Massive Datasets Bruch, Sebastian Nardini, Franco Maria Rulli, Cosimo Venturini, Rossano Venuta, Leonardo Information Retrieval Learned sparse text embeddings have gained popularity due to their effectiveness in top-k retrieval and inherent interpretability. Their distributional idiosyncrasies, however, have long hindered their use in real-world retrieval systems. That changed with the recent development of approximate algorithms that leverage the distributional properties of sparse embeddings to speed up retrieval. Nonetheless, in much of the existing literature, evaluation has been limited to datasets with only a few million documents such as MSMARCO. It remains unclear how these systems behave on much larger datasets and what challenges lurk in larger scales. To bridge that gap, we investigate the behavior of state-of-the-art retrieval algorithms on massive datasets. We compare and contrast the recently-proposed Seismic and graph-based solutions adapted from dense retrieval. We extensively evaluate Splade embeddings of 138M passages from MsMarco-v2 and report indexing time and other efficiency and effectiveness metrics. |
| title | Investigating the Scalability of Approximate Sparse Retrieval Algorithms to Massive Datasets |
| topic | Information Retrieval |
| url | https://arxiv.org/abs/2501.11628 |