Fetching the paper…
Reading the bibliography…
Learned sparse representations form an attractive class of contextual embeddings for text retrieval.
Document Expansion by Query Prediction
Rodrigo Nogueira, Wei Yang, Jimmy Lin, and Kyunghyun Cho. 2019b · 1904
Earlier work this paper cites.
Faster Learned Sparse Retrieval with Guided Traversal. In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval (Madrid, Spain). 1901–1905
Antonio Mallia, Joel Mackenzie, Torsten Suel, and Nicola Tonellotto. 2022 · 1905
Earlier work this paper cites.
Context-Aware Document Term Weighting for Ad-Hoc Search. In Proceedings of The Web Conference (Taipei, Taiwan). 1897–1907
Zhuyun Dai and Jamie Callan. 2020a · 1907
Earlier work this paper cites.
Context-Aware Sentence/Passage Term Importance Estimation For First Stage Retrieval
Zhuyun Dai and Jamie Callan. 2019 · 1910
Earlier work this paper cites.
Faster Index Reordering with Bipartite Graph Partitioning. In Proc. SIGIR . 1910–1914
J. Mackenzie, M. Petri, and A. Moffat. 2021a · 1914
Earlier work this paper cites.
Term-weighting approaches in automatic text retrieval
Gerard Salton and Christopher Buckley. 1988 · 1988
Earlier work this paper cites.
Okapi at TREC-3.. In TREC (NIST Special Publication, Vol. 500-225) , Donna K. Harman (Ed.). National Institute of Standards and Technology (NIST), 109–126
Stephen E. Robertson, Steve Walker, Susan Jones, Micheline Hancock-Beaulieu, and Mike Gatford. 1994 · 1994
Earlier work this paper cites.
Query Evaluation: Strategies and Optimizations
Howard Turtle and James Flood. 1995 · 1995
Earlier work this paper cites.
Cumulated Gain-based Evaluation of IR Techniques
Kalervo Järvelin and Jaana Kekäläinen. 2002 · 2002
Earlier work this paper cites.
Efficient Query Evaluation Using a Two-Level Retrieval Process. In Proceedings of the 12th International Conference on Information and Knowledge Management (New Orleans, LA, USA). 426–434
Andrei Z. Broder, David Carmel, Michael Herscovici, Aya Soffer, and Jason Zien. 2003 · 2003
Earlier work this paper cites.
Finding near Neighbors through Cluster Pruning. In Proceedings of the Twenty-Sixth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (Beijing, China). 103–112
Flavio Chierichetti, Alessandro Panconesi, Prabhakar Raghavan, Mauro Sozio, Alessandro Tiberi, and Eli Upfal. 2007 · 2007
Earlier work this paper cites.
SparTerm: Learning Term-based Sparse Representation for Fast Text Retrieval
Yang Bai, Xiaoguang Li, Gang Wang, Chaoliang Zhang, Lifeng Shang, Jun Xu, Zhaowei Wang, Fangshan Wang, and Qun Liu. 2020 · 2010
Earlier work this paper cites.
Faster Top-k Document Retrieval Using Block-Max Indexes. In Proceedings of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval (Beijing, China). 993–1002
Shuai Ding and Torsten Suel. 2011 · 2011
Earlier work this paper cites.
Product Quantization for Nearest Neighbor Search
Herve Jégou, Matthijs Douze, and Cordelia Schmid. 2011 · 2011
Earlier work this paper cites.
Optimizing Top-k Document Retrieval Strategies for Block-Max Indexes. In Proceedings of the Sixth ACM International Conference on Web Search and Data Mining (Rome, Italy). 113–122
Constantinos Dimopoulos, Sergey Nepomnyachiy, and Torsten Suel. 2013 · 2013
Earlier work this paper cites.
Partitioned Elias-Fano Indexes. In Proceedings of the 37th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval . 273–282
Giuseppe Ottaviano and Rossano Venturini. 2014 · 2014
Earlier work this paper cites.
Sketching as a Tool for Numerical Linear Algebra
David P. Woodruff. 2014 · 2014
Earlier work this paper cites.
Anytime Ranking for Impact-Ordered Indexes. In Proceedings of the 2015 International Conference on The Theory of Information Retrieval (Northampton, Massachusetts, USA). 301–304
Jimmy Lin and Andrew Trotman. 2015 · 2015
Earlier work this paper cites.
MS MARCO: A Human Generated MAchine Reading COmprehension Dataset
Tri Nguyen, Mir Rosenberg, Xia Song, Jianfeng Gao, Saurabh Tiwary, Rangan Majumder, and Li Deng. 2016 · 2016
Earlier work this paper cites.
Google’s Neural Machine Translation System: Bridging the Gap between Human and Machine Translation
Yonghui Wu, Mike Schuster, Zhifeng Chen, Quoc V. Le, Mohammad Norouzi, Wolfgang Macherey, Maxim Krikun, Yuan Cao, Qin Gao, Klaus Macherey, Jeff Klingner, Apurva Shah, Melvin Johnson, Xiaobing Liu, Łukasz Kaiser, Stephan Gouws, Yoshikiyo Kato, Taku Kudo, Hideto Kazawa, Keith Stevens, George Kurian, Nishant Patil, Wei Wang, Cliff Young, Jason Smith, Jason Riesa, Alex Rudnick, Oriol Vinyals, Greg Corrado, Macduff Hughes, and Jeffrey Dean. 2016 · 2016
Cited alongside, same era.
A Comparison of Document-at-a-Time and Score-at-a-Time Query Evaluation. In Proceedings of the 10th ACM International Conference on Web Search and Data Mining (Cambridge, United Kingdom). 201–210
Matt Crane, J. Shane Culpepper, Jimmy Lin, Joel Mackenzie, and Andrew Trotman. 2017 · 2017
Cited alongside, same era.
Faster BlockMax WAND with Variable-Sized Blocks. In Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval (Shinjuku, Tokyo, Japan). 625–634
Antonio Mallia, Giuseppe Ottaviano, Elia Porciani, Nicola Tonellotto, and Rossano Venturini. 2017 · 2017
Cited alongside, same era.
Attention is All You Need. In Proceedings of the 31st International Conference on Neural Information Processing Systems (Long Beach, California, USA). 6000–6010
Techniques for Inverted Index Compression
Giulio Ermanno Pibiri and Rossano Venturini. 2021 · 2021
Later among the works it cites.
BEIR: A Heterogeneous Benchmark for Zero-shot Evaluation of Information Retrieval Models. In 35th Conference on Neural Information Processing Systems Datasets and Benchmarks Track (Round 2)
Nandan Thakur, Nils Reimers, Andreas Rücklé, Abhishek Srivastava, and Iryna Gurevych. 2021 · 2021
Later among the works it cites.
Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrieval. In International Conference on Learning Representations
Lee Xiong, Chenyan Xiong, Ye Li, Kwok-Fung Tang, Jialin Liu, Paul Bennett, Junaid Ahmed, and Arnold Overwijk. 2021 · 2021
Later among the works it cites.
SPARTA: Efficient Open-Domain Question Answering via Sparse Transformer Matching Retrieval. In Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies . 565–575
Tiancheng Zhao, Xiaopeng Lu, and Kyusong Lee. 2021 · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N. Gomez, Łukasz Kaiser, and Illia Polosukhin. 2017 · 2017
Cited alongside, same era.
Non-metric Similarity Graphs for Maximum Inner Product Search. In Advances in Neural Information Processing Systems
Stanislav Morozov and Artem Babenko. 2018 · 2018
Cited alongside, same era.
Efficient Query Processing for Scalable Web Search
Nicola Tonellotto, Craig Macdonald, and Iadh Ounis. 2018 · 2018
Cited alongside, same era.
From Neural Re-Ranking to Neural Ranking: Learning a Sparse Representation for Inverted Indexing. In Proceedings of the 27th ACM International Conference on Information and Knowledge Management (Torino, Italy). 497–506
Hamed Zamani, Mostafa Dehghani, W. Bruce Croft, Erik Learned-Miller, and Jaap Kamps. 2018 · 2018
Cited alongside, same era.
BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. In Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers) . 4171–4186
Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2019 · 2019
Cited alongside, same era.
Faster BlockMax WAND with Longer Skipping. In Advances in Information Retrieval . 771–778
Antonio Mallia and Elia Porciani. 2019 · 2019
Cited alongside, same era.
PISA: Performant Indexes and Search for Academia. In Proceedings of the Open-Source IR Replicability Challenge co-located with 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, OSIRRC@SIGIR 2019, Paris, France . 50–56
Antonio Mallia, Michal Siedlaczek, Joel Mackenzie, and Torsten Suel. 2019 · 2019
Cited alongside, same era.
From doc2query to docTTTTTquery
Rodrigo Nogueira, Jimmy Lin, and AI Epistemic. 2019a · 2019
Cited alongside, same era.
Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks. In Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing . Association for Computational Linguistics
Nils Reimers and Iryna Gurevych. 2019 · 2019
Cited alongside, same era.
From Distillation to Hard Negative Sampling: Making Sparse Neural IR Models More Effective. In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval (Madrid, Spain). 2353–2359
Thibault Formal, Carlos Lassance, Benjamin Piwowarski, and Stéphane Clinchant. 2022 · 2022
Later among the works it cites.
An Efficiency Study for SPLADE Models. In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval (Madrid, Spain). 2220–2226
Carlos Lassance and Stéphane Clinchant. 2022 · 2022
Later among the works it cites.
Document expansion baselines and learned sparse lexical representations for ms marco v1 and v2. In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval . 3187–3197
Xueguang Ma, Ronak Pradeep, Rodrigo Nogueira, and Jimmy Lin. 2022 · 2022
Later among the works it cites.
IOQP: A simple Impact-Ordered Query Processor written in Rust. In Proc. DESIRES . 22–34
J. Mackenzie, M. Petri, and L. Gallagher. 2022 · 2022
Later among the works it cites.
ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interaction. In Proceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies . 3715–3734
Keshav Santhanam, Omar Khattab, Jon Saad-Falcon, Christopher Potts, and Matei Zaharia. 2022 · 2022
Later among the works it cites.
An Analysis of Fusion Functions for Hybrid Retrieval
Sebastian Bruch, Siyu Gai, and Amir Ingber. 2023a · 2023
Later among the works it cites.
Efficient and Effective Tree-based and Neural Learning to Rank
Sebastian Bruch, Claudio Lucchese, and Franco Maria Nardini. 2023b · 2023
Later among the works it cites.
An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors
Sebastian Bruch, Franco Maria Nardini, Amir Ingber, and Edo Liberty. 2023c · 2023
Later among the works it cites.
Sampling Methods for Inner Product Sketching
Majid Daliri, Juliana Freire, Christopher Musco, Aécio Santos, and Haoxiang Zhang. 2023 · 2023
Later among the works it cites.
Towards Effective and Efficient Sparse Neural Information Retrieval
Thibault Formal, Carlos Lassance, Benjamin Piwowarski, and Stéphane Clinchant. 2023 · 2023
Later among the works it cites.
A Static Pruning Study on Sparse Neural Retrievers. In Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval (Taipei, Taiwan). 1771–1775
Carlos Lassance, Simon Lupart, Hervé Déjean, Stéphane Clinchant, and Nicola Tonellotto. 2023 · 2023
Later among the works it cites.
Efficient Document-at-a-Time and Score-at-a-Time Query Evaluation for Learned Sparse Representations
Joel Mackenzie, Andrew Trotman, and Jimmy Lin. 2023 · 2023
Later among the works it cites.
Foundations of Vector Retrieval
Sebastian Bruch. 2024 · 2024
Closest in time.
Efficient Multi-vector Dense Retrieval with Bit Vectors. In Advances in Information Retrieval . 3–17
Franco Maria Nardini, Cosimo Rulli, and Rossano Venturini. 2024 · 2024
Closest in time.