Gosling Grows Up: Retrieval with Learned Dense and Sparse Representations Using Anserini
Open Access
- 13 July 2025
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 3223-3233
Abstract
No abstract availableAll Related Versions
Funding Information
- Natural Sciences and Engineering Research Council (NSERC) of Canada
This publication has 43 references indexed in Scilit:
- Patience in Proximity: A Simple Early Termination Strategy for HNSW Graph Traversal in Approximate k-Nearest Neighbor Search2025
- A Unified Framework for Learned Sparse Retrieval2023
- Rethink Training of BERT Rerankers in Multi-stage Retrieval Pipeline2021
- Billion-Scale Similarity Search with GPUsIEEE Transactions on Big Data, 2019
- Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World GraphsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2018
- Learning to Rank Short Text Pairs with Convolutional Deep Neural Networks2015
- Learning deep structured semantic models for web search using clickthrough data2013
- Effectiveness/efficiency tradeoffs for candidate generation in multi-stage retrieval architectures2013
- Early exit optimizations for additive machine learned ranking systems2010
- High accuracy retrieval with multiple nested ranker2006