Let's measure run time! Extending the IR replicability infrastructure to include performance aspects
Not on the map. Why?
Abstract (arXiv)
Establishing a docker-based replicability infrastructure offers the community a great opportunity: measuring the run time of information retrieval systems. The time required to present query results to a user is paramount to the users satisfaction. Recent advances in neural IR re-ranking models put the issue of query latency at the forefront. They bring a complex trade-off between performance and effectiveness based on a myriad of factors: the choice of encoding model, network architecture, hardware acceleration and many others. The best performing models (currently using the BERT transformer model) run orders of magnitude more slowly than simpler architectures. We aim to broaden the focus of the neural IR community to include performance considerations -- to sustain the practical applicability of our innovations. In this position paper we supply our argument with a case study exploring the performance of different neural re-ranking models. Finally, we propose to extend the OSIRRC docker-based replicability infrastructure with two performance focused benchmark scenarios.
Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). First posted on arXiv 10 Jul 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 5; 2022: 3; 2023: 0; 2024: 0; 2025: 1; 2026: 1.
10 papers.
- 2021Efficiently Teaching an Effective Dense Retriever with Balanced Topic Aware Samplingcited by 238
- 2022An Efficiency Study for SPLADE Modelscited by 26
- 2025Efficient Constant-Space Multi-Vector Retrievalcited by 12
- 2021Mitigating the Position Bias of Transformer Models in Passage Re-Rankingcited by 10
- 2022Establishing Strong Baselines for TripClick Health Retrievalcited by 4
- 2022Composite Code Sparse Autoencoders for first stage retrievalcited by 4
- 2021Multistage BiCross encoder for multilingual access to COVID-19 health informationcited by 3
- 2021Exploring Classic and Neural Lexical Translation Models for Information Retrieval: Interpretability, Effectiveness, and Efficiency Benefitscited by 3
- 2021On Single and Multiple Representations in Dense Passage Retrievalcited by 3
- 2026Static Pruning Across Sparse Retrieval Regimes: What Transfers, What Breaks, and What Still Helpscited by 0
- 2026Static Pruning Across Sparse Retrieval Regimes: What Transfers, What Breaks, and What Still Helps17 Aug 2026
- 2025Efficient Constant-Space Multi-Vector Retrieval2 Apr 2025
- 2022An Efficiency Study for SPLADE Models8 Jul 2022
- 2022Composite Code Sparse Autoencoders for first stage retrieval14 Apr 2022
- 2022Establishing Strong Baselines for TripClick Health Retrieval2 Jan 2022
- 2021On Single and Multiple Representations in Dense Passage Retrieval13 Aug 2021
- 2021Efficiently Teaching an Effective Dense Retriever with Balanced Topic Aware Sampling14 Apr 2021
- 2021Exploring Classic and Neural Lexical Translation Models for Information Retrieval: Interpretability, Effectiveness, and Efficiency Benefits12 Feb 2021
- 2021Mitigating the Position Bias of Transformer Models in Passage Re-Ranking18 Jan 2021
- 2021Multistage BiCross encoder for multilingual access to COVID-19 health information8 Jan 2021