Poly-encoders: Architectures and pre-training strategies for fast and accurate multi-sentence scoring
S. Humeau, K. Shuster, M.-A. Lachaux, and J. Weston · 2020
Later among the works it cites.
A memory efficient baseline for open domain question answering
Original
G. Izacard, F. Petroni, L. Hosseini, N. D. Cao, S. Riedel, and E. Grave · 2020
Later among the works it cites.
Which BM25 do you mean? A large-scale reproducibility study of scoring variants
C. Kamphuis, A. de Vries, L. Boytsov, and J. Lin · 2020
Later among the works it cites.
Dense passage retrieval for open-domain question answering
V. Karpukhin, B. Oğuz, S. Min, P. Lewis, L. Wu, S. Edunov, D. Chen, and W.-t. Yih · 2020
Later among the works it cites.
ColBERT: Efficient and effective passage search via contextualized late interaction over BERT
O. Khattab and M. Zaharia · 2020
Later among the works it cites.
Efficient document re-ranking for transformers by precomputing term representations
S. MacAvaney, F. M. Nardini, R. Perego, N. Tonellotto, N. Goharian, and O. Frieder · 2020
Later among the works it cites.
Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs
Y. A. Malkov and D. A. Yashunin · 2020
Later among the works it cites.
Approximate nearest neighbor search and lightweight dense vector reranking in multi-stage retrieval architectures
Z. Tu, W. Yang, Z. Fu, Y. Xie, L. Tan, K. Xiong, M. Li, and J. Lin · 2020
Later among the works it cites.
SPLADE: Sparse lexical and expansion model for first stage ranking
T. Formal, B. Piwowarski, and S. Clinchant · 2021
Closest in time.
COIL: Revisit exact lexical match in information retrieval with contextualized inverted list
L. Gao, Z. Dai, and J. Callan · 2021
Closest in time.
Complementing lexical retrieval with semantic residual embedding
L. Gao, Z. Dai, T. Chen, Z. Fan, B. V. Durme, and J. Callan · 2021
Closest in time.
Efficiently teaching an effective dense retriever with balanced topic aware sampling
S. Hofstätter, S.-C. Lin, J.-H. Yang, J. Lin, and A. Hanbury · 2021
Closest in time.
Billion-scale similarity search with GPUs
J. Johnson, M. Douze, and H. Jégou · 2021
Closest in time.
Multi-task dense retrieval via model uncertainty fusion for open-domain question answering
M. Li, M. Li, K. Xiong, and J. Lin · 2021
Closest in time.
A few brief notes on DeepImpact, COIL, and a conceptual framework for information retrieval techniques
Original
J. Lin and X. Ma · 2021
Closest in time.
On the separation of logical and physical ranking models for text retrieval applications
J. Lin, X. Ma, J. Mackenzie, and A. Mallia · 2021
Closest in time.
In-batch negatives for knowledge distillation with tightly-coupled teachers for dense retrieval
S.-C. Lin, J.-H. Yang, and J. Lin · 2021
Closest in time.
Simple and effective unsupervised redundancy elimination to compress dense vectors for passage retrieval
X. Ma, M. Li, K. Sun, J. Xin, and J. Lin · 2021
Closest in time.
Learning passage impacts for inverted indexes
A. Mallia, O. Khattab, T. Suel, and N. Tonellotto · 2021
Closest in time.
RocketQA: An optimized training approach to dense passage retrieval for open-domain question answering
Y. Qu, Y. Ding, J. Liu, K. Liu, R. Ren, W. X. Zhao, D. Dong, H. Wu, and H. Wang · 2021
Closest in time.
BEIR: A heterogenous benchmark for zero-shot evaluation of information retrieval models
Original
N. Thakur, N. Reimers, A. Rücklé, A. Srivastava, and I. Gurevych · 2021
Closest in time.
Approximate nearest neighbor negative contrastive learning for dense text retrieval
L. Xiong, C. Xiong, Y. Li, K.-F. Tang, J. Liu, P. N. Bennett, J. Ahmed, and A. Overwijk · 2021
Closest in time.
ByT5: Towards a token-free future with pre-trained byte-to-byte models
Original
L. Xue, A. Barua, N. Constant, R. Al-Rfou, S. Narang, M. Kale, A. Roberts, and C. Raffel · 2021
Closest in time.
Efficient passage retrieval with hashing for open-domain question answering
I. Yamada, A. Asai, and H. Hajishirzi · 2021
Closest in time.
Optimizing dense retrieval model training with hard negatives
J. Zhan, J. Mao, Y. Liu, J. Guo, M. Zhang, and S. Ma · 2021
Closest in time.
TILDE: Term independent likelihood moDEl for passage re-ranking
S. Zhuang and G. Zuccon · 2021
Closest in time.
Pre-trained language model based ranking in Baidu search
Original
L. Zou, S. Zhang, H. Cai, D. Ma, S. Cheng, D. Shi, S. Wang, Z. Cheng, and D. Yin · 2021
Closest in time.