Fetching the paper…
Reading the bibliography…
Sparse lexical representation learning has demonstrated much progress in improving passage retrieval effectiveness in recent models such as DeepImpact, uniCOIL, and SPLADE.
Vector-space ranking with effective early termination
V. N. Anh, O. de Kretser, and A. Moffat · 2001
Earlier work this paper cites.
Engineering efficient and effective non-metric space library
L. Boytsov and B. Naidan · 2013
Earlier work this paper cites.
Anytime ranking for impact-ordered indexes
J. Lin and A. Trotman · 2015
Earlier work this paper cites.
Efficient natural language response suggestion for Smart Reply
M. Henderson, R. Al-Rfou, B. Strope, Y.-H. Sung, L. Lukács, R. Guo, S. Kumar, B. Miklos, and R. Kurzweil · 2017
Earlier work this paper cites.
MS MARCO: A Human Generated MAchine Reading COmprehension Dataset
P. Bajaj, D. Campos, N. Craswell, L. Deng, J. Gao, X. Liu, R. Majumder, A. McNamara, B. Mitra, T. Nguyen, M. Rosenberg, X. Song, A. Stoica, S. Tiwary, and T. Wang · 2018
Earlier work this paper cites.
Anserini: Reproducible ranking baselines using Lucene
P. Yang, H. Fang, and J. Lin · 2018
Earlier work this paper cites.
From neural re-ranking to neural ranking: Learning a sparse representation for inverted indexing
H. Zamani, M. Dehghani, W. B. Croft, E. Learned-Miller, and J. Kamps · 2018
Earlier work this paper cites.
PISA: Performant indexes and search for academia
A. Mallia, M. Siedlaczek, J. Mackenzie, and T. Suel · 2019
Earlier work this paper cites.
From doc2query to docTTTTTquery, 2019
R. Nogueira and J. Lin · 2019
Earlier work this paper cites.
DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter
V. Sanh, L. Debut, J. Chaumond, and T. Wolf · 2019
Cited alongside, same era.
Micro-and macro-optimizations of SaaT search
A. Trotman and M. Crane · 2019
Cited alongside, same era.
SparTerm: Learning term-based sparse representation for fast text retrieval
Y. Bai, X. Li, G. Wang, C. Zhang, L. Shang, J. Xu, Z. Wang, F. Wang, and Q. Liu · 2020
Cited alongside, same era.
Context-aware term weighting for first stage passage retrieval
Z. Dai and J. Callan · 2020
Cited alongside, same era.
Dense passage retrieval for open-domain question answering
V. Karpukhin, B. Oguz, S. Min, P. Lewis, L. Wu, S. Edunov, D. Chen, and W.-t. Yih · 2020
Cited alongside, same era.
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.
A proposed conceptual framework for a representational approach to information retrieval
J. Lin · 2021
Closest in time.
J. Lin and X. Ma · 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.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
ColBERT: Efficient and effective passage search via contextualized late interaction over BERT
O. Khattab and M. Zaharia · 2020
Cited alongside, same era.
Minimizing FLOPs to learn efficient sparse representations
B. Paria, C.-K. Yeh, I. E. H. Yen, N. Xu, P. Ravikumar, and B. Póczos · 2020
Cited alongside, same era.
Approximate nearest neighbor negative contrastive learning for dense text retrieval
L. Xiong, C. Xiong, Y. Li, K.-F. Tang, J. Liu, P. Bennett, J. Ahmed, and A. Overwijk · 2020
Cited alongside, same era.
SimCSE: Simple contrastive learning of sentence embeddings
T. Gao, X. Yao, and D. Chen · 2021
Cited alongside, same era.
SPLADE v2: Sparse lexical and expansion model for information retrieval
T. Formal, C. Lassance, B. Piwowarski, and S. Clinchant
Cited in the paper.
SPLADE: Sparse lexical and expansion model for first stage ranking
T. Formal, B. Piwowarski, and S. Clinchant
Cited in the paper.
J. Mackenzie, A. Trotman, 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.
Efficient passage retrieval with hashing for open-domain question answering
I. Yamada, A. Asai, and H. Hajishirzi · 2021
Closest in time.
Fast passage re-ranking with contextualized exact term matching and efficient passage expansion
S. Zhuang and G. Zuccon · 2021
Closest in time.