mlsanityData to 14 Oct 2026

Continuous Active Learning Using Pretrained Transformers

arXiv 2208.06955 ↗First posted 15 Aug 2022cs.IR cs.AI cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

Pre-trained and fine-tuned transformer models like BERT and T5 have improved the state of the art in ad-hoc retrieval and question-answering, but not as yet in high-recall information retrieval, where the objective is to retrieve substantially all relevant documents. We investigate whether the use of transformer-based models for reranking and/or featurization can improve the Baseline Model Implementation of the TREC Total Recall Track, which represents the current state of the art for high-recall information retrieval. We also introduce CALBERT, a model that can be used to continuously fine-tune a BERT-based model based on relevance feedback.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 10 of its 14 references that are in the map. First posted on arXiv 15 Aug 2022.

Builds on

10 of 14 references.

References · 10

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  3. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
  4. 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,605
  5. 2020MPNet: Masked and Permuted Pre-training for Language Understandingcited by 981
  6. 2020Pretrained Transformers for Text Ranking: BERT and Beyondcited by 267
  7. 2021Efficiently Teaching an Effective Dense Retriever with Balanced Topic Aware Samplingcited by 238
  8. 2019Multi-Stage Document Ranking with BERTcited by 201
  9. 2021The Expando-Mono-Duo Design Pattern for Text Ranking with Pretrained Sequence-to-Sequence Modelscited by 81
  10. 2021Goldilocks: Just-Right Tuning of BERT for Technology-Assisted Reviewcited by 12

Built on by

Cited by year

Citing papers per year: 2023: 3.

3 papers.