Cited by 2,103Topic ModelingDomain Adaptation and Few-Shot LearningNatural Language Processing Techniques

The DOI matches its Crossref record; 57 of the 63 references it cites were found in a registry or an index, and 6 are not checked yet; none of the 16 sources its claims cite is checked for support yet.

Don’t Stop Pretraining: Adapt Language Models to Domains and Tasks

Open access
Gururangan, Suchin, Marasović, Ana, Swayamdipta, Swabha, Lo, Kyle, Beltagy, Iz, Downey, Doug, Smith, Noah A.·2020·Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics

Abstract

Language models pretrained on text from a wide variety of sources form the foundation of today's NLP. In light of the success of these broad-coverage models, we investigate whether it is still helpful to tailor a pretrained model to the domain of a target task. We present a study across four domains (biomedical and computer science publications, news, and reviews) and eight classification tasks, showing that a second phase of pretraining in-domain (domain-adaptive pretraining) leads to performance gains, under both high- and low-resource settings. Moreover, adapting to the task's unlabeled data (task-adaptive pretraining) improves performance even after domain-adaptive pretraining. Finally, we show that adapting to a task corpus augmented using simple data selection strategies is an effective alternative, especially when resources for domain-adaptive pretraining might be unavailable. Overall, we consistently find that multi-phase adaptive pretraining offers large gains in task performance.

Checked 2026-11-10 · 6 references not checked yet

Overview

AI snapshot

Written from the paper’s full text.

TL;DR

This paper studies continued pretraining of RoBERTa on domain-specific and task-specific unlabeled text across four domains and eight classification tasks. It finds that domain-adaptive pretraining (DAPT) and task-adaptive pretraining (TAPT) both improve performance, with DAPT followed by TAPT giving the best results.

Key findings

  • DAPT improved over RoBERTa on all eight tasks, including CHEMPROT (81.9 → 84.2 microF1), ACL-ARC (63.0 → 75.4 macroF1), SCIERC (77.3 → 80.8), HYPERPARTISAN (86.6 → 88.2), and HELPFULNESS (65.1 → 66.5); AGNEWS was unchanged at 93.9.
  • TAPT consistently improved over RoBERTa for all tasks, and DAPT + TAPT achieved the best performance on all tasks, e.g. RCT 87.8, ACL-ARC 75.6, SCIERC 81.3, HYPERPARTISAN 90.0, AGNEWS 94.6, HELPFULNESS 68.7, IMDB 95.6.
  • Curated-TAPT further improved over TAPT on RCT-500 (79.8 → 83.4), HYPERPARTISAN (90.4 → 89.9), and IMDB (95.5 → 95.7); DAPT + Curated-TAPT gave the largest boosts, e.g. RCT-500 83.8 and HYPERPARTISAN 92.1.
  • Automated kNN-TAPT outperformed TAPT for all cases, with 500 NN-TAPT reaching CHEMPROT 83.3, RCT-500 81.7, and ACL-ARC 75.5; TAPT was nearly 60 times faster to train than DAPT, while DAPT storage was 5.8M times that of TAPT on RCT-500.

Methods

  • The authors continued pretraining RoBERTa on four domains: biomedical papers (7.55B tokens), CS papers (8.10B tokens), news from RealNews (6.66B tokens), and Amazon reviews (2.11B tokens), then evaluated on eight classification tasks in high- and low-resource settings.
  • DAPT trained for 12.5K steps per domain; TAPT trained on the unlabeled task training set for 100 epochs with 0.15 masking; DAPT + TAPT applied both sequentially. Classification used the final-layer [CLS] representation with a task-specific feedforward layer, reporting test macroF1 or microF1 averaged over five random seeds.
  • For automated data selection, they embedded task and domain sentences with VAMPIRE, selected k nearest neighbors from the domain corpus, and continued pretraining RoBERTa on the task data plus selected candidates.

Limitations

  • The paper states that cross-DAPT masked LM loss can be a noisy predictor of domain similarity, that domain boundaries are fuzzy, and that TAPT optimizes for single-task performance to the detriment of cross-task transfer. It also notes high variance on HYPERPARTISAN due to its very small dataset, and that degenerate seeds were discarded and resampled.
  • The paper states that BIOMED and CS used an internal version of S2ORC containing papers that cannot be released due to copyright restrictions.
  • Evident from the text: the study is limited to RoBERTa, four English-language domains, and eight classification tasks; the authors call for future work on better data selection, efficient adaptation to distant domains, and reusable adapted language models.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.18653/v1/2020.acl-main.740

Cites

57 of 63 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Verification

Claims the paper makes

37 Own result · 19 Own interpretation · 9 No basis given · 8 Not checked yet · 4 Own method · 1 Sources not found · 1 Check pending

Verify all 10 references — free account

Show all 44 claims

  • Probably not a substantial claim. 24
  • It may state two separate claims as one. 18
  • The quote only partly states this claim. 1
35 of 35
  • The paper relies on this without support.

    ROBERTA's pretraining sources may not be diverse enough to generalize to most of the variation in the English language.

    “Although ROBERTA's pretraining corpus is derived from multiple sources, it has not yet been established if these sources are diverse enough to generalize to most of the variation in the English language.”
  • The authors state this as an assumption.

    The training set represents aspects of the task well.

    “under the assumption that the training set represents aspects of the task well”
  • The paper relies on this without support.

    Task data is non-randomly sampled from a wider distribution within a larger target domain that is not necessarily one of the original LM pretraining domains.

    “Task data is comprised of an observable task distribution, usually non-randomly sampled from a wider distribution (light grey ellipsis) within an even larger target domain, which is not necessarily one of the domains included in the original LM pretraining domain - though overlap is possible.”
  • The paper relies on this without support.

    The larger unlabeled corpus collected for a task is expected to have a similar distribution to the task's training data.

    “The larger unlabeled corpus is thus expected to have a similar distribution to the task's training data.”
  • The paper relies on this without support.

    Such a larger unlabeled corpus is usually available.

    “Moreover, it is usually available.”
5 of 5

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

Each contradiction between two passages listed here was confirmed by an independent check.

5 of 5

Citations

Cites

Show all 62 references

Research works printed but not linked: 5

  1. Franck Dernoncourt and Ji Young Lee. 2017. Pubmed 200k RCT: a dataset for sequential sentence classification in medical abstracts. In IJCNLP . https://www.aclweb.org/anthology/I17-2052/
  2. Urvashi Khandelwal, Omer Levy, Dan Jurafsky, Luke Zettlemoyer, and Mike Lewis. 2020. Generalization through memorization: Nearest neighbor language models. In ICLR . To appear.
  3. Martin Krallinger, Obdulia Rabal, Saber Ahmad Akhondi, Mart´ ın P´ erez P´ erez, J´ es ´ us L´ opez Santamar´ ıa, Gael P´ erez Rodr´ ıguez, Georgios Tsatsaronis, Ander Intxaurrondo, Jos´ e Antonio Baso L´ opez, Umesh Nandal, E. M. van Buel, A. Poorna Chandrasekhar, Marleen Rodenburg, Astrid Lægreid, Marius A. Doornenbal, Julen Oyarz´ abal, An´ alia Lourenc ¸o, and Alfonso Valencia. 2017. Overview of the biocreative vi chemical-protein interaction track. In Proceedings of the BioCreative VI Workshop .
  4. Steffen Remus and Chris Biemann. 2016. DomainSpecific Corpus Expansion with Focused Webcrawling. In LREC .
  5. Rowan Zellers, Ari Holtzman, Hannah Rashkin, Yonatan Bisk, Ali Farhadi, Franziska Roesner, and Yejin Choi. 2019. Defending against neural fake news. In NeurIPS .

Cited by

Sorted by citations

Items 901–1,000 of 1,011

Metadata

Authors
Gururangan, S., Marasović, A., Swayamdipta, S., Lo, K., Beltagy, I., Downey, D., & Smith, N. A.
Affiliations
Allen Institute for Artificial Intelligence (US)
Venue
Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics
Published
2020
Pages
8342-8360
ISSN
0736-587X (ISSN-L)
OpenAlex
W3017961061
Cited by
2,103
References
62
Citations by year
2026: 246 · 2025: 313 · 2024: 253 · 2023: 443 · 2022: 331 · 2021: 403 · 2020: 111
FWCI
122.98
Type
conference paper
Language
en
Open access
Licence
cc-by
Locations
  • Proceedings of the conference - Association for Computational Linguistics. Meeting (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
  • Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
Keywords
domain-adaptive pretraining, language model fine-tuning, text classification, resource-limited settings, data selection, biomedical text, computer science literature

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

A language model drew the claims from the paper on 2026-11-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-11-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review