Training Adaptive Computation for Open-Domain Question Answering with Computational Constraints
Not on the map. Why?
Abstract (arXiv)
Adaptive Computation (AC) has been shown to be effective in improving the efficiency of Open-Domain Question Answering (ODQA) systems. However, current AC approaches require tuning of all model parameters, and training state-of-the-art ODQA models requires significant computational resources that may not be available for most researchers. We propose Adaptive Passage Encoder, an AC method that can be applied to an existing ODQA model and can be trained efficiently on a single GPU. It keeps the parameters of the base ODQA model fixed, but it overrides the default layer-by-layer computation of the encoder with an AC policy that is trained to optimise the computational efficiency of the model. Our experimental results show that our method improves upon a state-of-the-art model on two datasets, and is also more accurate than previous AC methods due to the stronger base ODQA model. All source code and datasets are available at https://github.com/uclnlp/APE.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 23 of its 27 references that are in the map. First posted on arXiv 5 Jul 2021.
Builds on
23 of 27 references.
References · 23
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,160
- 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
- 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,895
- 2020Leveraging Passage Retrieval with Generative Models for Open Domain Question Answeringcited by 1,203
- 2017Reading Wikipedia to Answer Open-Domain Questionscited by 777
- 2019Latent Retrieval for Weakly Supervised Open Domain Question Answeringcited by 691
- 2019Passage Re-ranking with BERTcited by 629
- 2019Green AIcited by 620
- 2020AmbigQA: Answering Ambiguous Open-domain Questionscited by 385
- 2020DeeBERT: Dynamic Early Exiting for Accelerating BERT Inferencecited by 322
11 more
- 2020Distilling Knowledge from Reader to Retriever for Question Answeringcited by 226
- 2020FastBERT: a Self-distilling BERT with Adaptive Inference Timecited by 224
- 2019End-to-End Open-Domain Question Answering with BERTserinicited by 152
- 2019Learning to Retrieve Reasoning Paths over Wikipedia Graph for Question Answeringcited by 147
- 2020The Right Tool for the Job: Matching Model and Instance Complexitiescited by 125
- 2017Simple and Effective Multi-Paragraph Reading Comprehensioncited by 120
- 2019Multi-passage BERT: A Globally Normalized BERT Model for Open-domain Question Answeringcited by 96
- 2019A Discrete Hard EM Approach for Weakly Supervised Question Answeringcited by 78
- 2019Understanding the Behaviors of BERT in Rankingcited by 49
- 2021Rider: Reader-Guided Passage Reranking for Open-Domain Question Answeringcited by 28
- 2020Don't Read Too Much into It: Adaptive Computation for Open-Domain Question Answeringcited by 7
Built on by
Citing papers per year: 2022: 2; 2023: 0; 2024: 1; 2025: 0; 2026: 1.
4 papers.
- 2022An Efficient Memory-Augmented Transformer for Knowledge-Intensive NLP Taskscited by 36
- 2022A Survey for Efficient Open Domain Question Answeringcited by 20
- 2024FastFiD: Improve Inference Efficiency of Open Domain Question Answering via Sentence Selectioncited by 2
- 2026A Good Talk Does not Look Like a Summary, It Teaches You! Measuring Takeaways from Paper-to-Video Talkscited by 0
- 2026A Good Talk Does not Look Like a Summary, It Teaches You! Measuring Takeaways from Paper-to-Video Talks26 Jun 2026
- 2024FastFiD: Improve Inference Efficiency of Open Domain Question Answering via Sentence Selection12 Aug 2024
- 2022A Survey for Efficient Open Domain Question Answering15 Nov 2022
- 2022An Efficient Memory-Augmented Transformer for Knowledge-Intensive NLP Tasks30 Oct 2022