Asyncval: A Toolkit for Asynchronously Validating Dense Retriever Checkpoints during Training
Not on the map. Why?
Abstract (arXiv)
The process of model checkpoint validation refers to the evaluation of the performance of a model checkpoint executed on a held-out portion of the training data while learning the hyperparameters of the model, and is used to avoid over-fitting and determine when the model has converged so as to stop training. A simple and efficient strategy to validate deep learning checkpoints is the addition of validation loops to execute during training. However, the validation of dense retrievers (DR) checkpoints is not as trivial -- and the addition of validation loops is not efficient. This is because, in order to accurately evaluate the performance of a DR checkpoint, the whole document corpus needs to be encoded into vectors using the current checkpoint before any actual retrieval operation for checkpoint validation can be performed. This corpus encoding process can be very time-consuming if the document corpus contains millions of documents (e.g., 8.8m for MS MARCO and 21m for Natural Questions). Thus, a naive use of validation loops during training will significantly increase training time. To address this issue, in this demo paper, we propose Asyncval: a Python-based toolkit for efficiently validating DR checkpoints during training. Instead of pausing the training loop for validating DR checkpoints, Asyncval decouples the validation loop from the training loop, uses another GPU to automatically validate new DR checkpoints and thus permits to perform validation asynchronously from training. Asyncval also implements a range of different corpus subset sampling strategies for validating DR checkpoints; these strategies allow to further speed up the validation process. We provide an investigation of these methods in terms of their impact on validation time and validation fidelity. Asyncval is made available as an open-source project at https://github.com/ielab/asyncval.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 19 of its 25 references that are in the map. First posted on arXiv 25 Feb 2022.
Builds on
19 of 25 references.
References · 19
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
- 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,605
- 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,178
- 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 849
- 2020RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answeringcited by 413
- 2020Pretrained Transformers for Text Ranking: BERT and Beyondcited by 267
- 2021Unsupervised Corpus Aware Language Model Pre-training for Dense Passage Retrievalcited by 203
- 2021RocketQAv2: A Joint Training Method for Dense Passage Retrieval and Passage Re-rankingcited by 176
- 2021Condenser: a Pre-training Architecture for Dense Retrievalcited by 162
- 2021Optimizing Dense Retrieval Model Training with Hard Negativescited by 155
- 2020Improving Efficient Neural Ranking Models with Cross-Architecture Knowledge Distillationcited by 145
- 2021PAIR: Leveraging Passage-Centric Similarity Relation for Improving Dense Passage Retrievalcited by 50
7 more
- 2021Improving Query Representations for Dense Retrieval with Pseudo Relevance Feedbackcited by 47
- 2020RepBERT: Contextualized Text Embeddings for First-Stage Retrievalcited by 46
- 2020Complementing Lexical Retrieval with Semantic Residual Embeddingcited by 27
- 2021Pseudo Relevance Feedback with Deep Language Models and Dense Retrievers: Successes and Pitfallscited by 26
- 2021A Proposed Conceptual Framework for a Representational Approach to Information Retrievalcited by 24
- 2021Dealing with Typos for BERT-based Passage Retrieval and Rankingcited by 23
- 2021Improving Query Representations for Dense Retrieval with Pseudo Relevance Feedback: A Reproducibility Studycited by 13
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 0; 2025: 1.
2 papers.