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 accessAbstract
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
Cites
Statistics
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
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We find that TAPT provides a large performance boost for ROBERTA, with or without domain-adaptive pretraining.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We observe that the cross-domain masked-LM loss mostly follows our intuition and insights from the paper, i.e. ROBERTA's pretraining corpus and NEWS are closer, and BIOMED to CS (relative to other domains).”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“However, ROBERTA that is adapted to REVIEWS results in the highest loss for a NEWS sample.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“However, there are two tasks (SCIERC and ACL-ARC) in which ¬ DAPT marginally improves performance over ROBERTA.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“TAPT consistently improves the ROBERTA baseline for all tasks across domains.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Automatic methods such as k NN-TAPT are much cheaper than DAPT.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“For each task, DAPT significantly outperforms adapting to an irrelevant domain, suggesting the importance of pretraining on domain-relevant data.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Results in Table 8 show that k NN-TAPT outperforms TAPT for all cases.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We observe that the cross-domain masked-LM loss mostly follows our intuition and insights from the paper, i.e. ROBERTA's pretraining corpus and NEWS are closer, and BIOMED to CS (relative to other domains).”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Applying Curated-TAPT after adapting to the domain results in the largest boost in performance on all tasks”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Probably not a substantial claim. 24
- It may state two separate claims as one. 18
- The quote only partly states this claim. 1
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“This is the case for all domains.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As we increase k , k NN-TAPT performance steadily increases, and approaches that of DAPT.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In Table 20 we display additional examples that highlight the overlap between IMDB reviews and REALNEWS articles, relevant for analysis in § 3.1.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“RAND-TAPT is generally worse than k NN-TAPT, but within a standard deviation arising from 5 seeds for RCT and ACLARC.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“However, the gradations in Figure 2 suggest that the boundaries between domains are in some sense fuzzy; for example, 40% of unigrams are shared between REVIEWS and NEWS.”
hedgedcorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“One of the properties that distinguishes REVIEWS from all other domains is that its documents are significantly shorter.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Our baseline establishes the first benchmark for the HELPFULNESS dataset.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“AMAZON reviews contain more documents, but each is shorter.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We observe that masked LM loss decreases in all domains except NEWS after DAPT, where we observe a marginal increase.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“On average, ROBERTA is not drastically behind the state of the art (details in Appendix § A.2), and serves as a good baseline since it provides a single LM to adapt to different domains.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“For BIOMED, CS, and REVIEWS, we see consistent improvements over ROBERTA, demonstrating the benefit of DAPT when the target domain is more distant from ROBERTA's source domain.”
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“TAPT is nearly 60 times faster to train than DAPT on a single v3-8 TPU and storage requirements for DAPT on this task are 5.8M times that of TAPT.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We observe that ROBERTA's pretraining domain has strong vocabulary overlap with NEWS and REVIEWS, while CS and BIOMED are far more dissimilar to the other domains.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“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 indomain ( domain-adaptive pretraining ) leads to performance gains, under both high- and low-resource settings.”
- Also stated in: § 3.2 Experiments · p. 3 · plain
“We observe that DAPT improves over ROBERTA in all domains.”
- Also stated in: § 3.2 Experiments · p. 3 · plain
“The pattern is consistent across high- and low- resource settings.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one. The quote only partly states this claim.
- Also stated in: § 3.2 Experiments · p. 3 · plain
What the paper did — it cites no source for this, so there is none to check. The quote shows it is in the paper.
In the paper
“We report averages across five random seeds, with standard deviations as subscripts.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“which suggests a spectra of domains defined around tasks at various levels of granularity (e.g., Amazon reviews for a specific product, all Amazon reviews, all reviews on the web, the web).”
hedgedcorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: fails — It may be too vague to check against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. It may be too vague to check against evidence. The paper’s conclusions may not depend on it.
None of the sources cited for this claim have been checked yet.
In the paper
“ROBERTA was trained on data from BOOKCORPUS (Zhu et al., 2015), 6 WIKIPEDIA, 7 a portion of the CCNEWS dataset (Nagel, 2016), 8 OPENWEBTEXT corpus of Web content extracted from URLs shared on Reddit (Gokaslan and Cohen, 2019), 9 and a subset of CommonCrawl that it is said to resemble the 'story-like' style of WINOGRAD schemas (STORIES; Trinh and Le, 2018).”
What the sources say
- Not checked yetcites Zhu et al., 2015 source
Checked before — its earlier verdict is held back until a new check runs.
- Not matchedcites Nagel, 2016
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Not matchedcites Gokaslan and Cohen, 2019
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not checked yet
In the paper
“Adhering to the standards suggested by Dodge et al. (2019) for replication, we report our development set results in Tables 15, 17, and 18.”
What the sources say
- Not checked yetcites Dodge et al. (2019) source
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We observe a high variance in performance between random seeds when fine-tuning ROBERTA to HYPERPARTISAN, because the dataset is extremely small.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
None of the sources cited for this claim have been checked yet.
In the paper
“Prior work has shown the benefit of continued pretraining in domain (Alsentzer et al., 2019; Chakrabarty et al., 2019; Lee et al., 2019).”
What the sources say
- Not checked — no full text of the sourcecites Alsentzer et al., 2019 source
- Not checked yetcites Chakrabarty et al., 2019 source
Checked before — its earlier verdict is held back until a new check runs.
- Not matchedcites Lee et al., 2019
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim.
In the paper
“This may suggest that in some cases, continued pretraining on any additional data is useful, as noted in Baevski et al. (2019).”
What the sources say
- Not checked yetcites Baevski et al. (2019) source
hedgedconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Further, this could also explain why adapting only to a broad domain is not sufficient, and why TAPT after DAPT is effective.”
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“State-of-the-art results we can compare to: CHEMPROT (84.6), RCT (92.9), ACL-ARC (71.0), SCIERC (81.8), HYPERPARTISAN (94.8), AGNEWS (95.5), IMDB (96.2); references in § A.2.”
What the sources say
- Not matchedcites § A.2
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. It may state two separate claims as one.
- Not matched
In the paper
“ROBERTA attains better performance on an assortment of tasks than its predecessors, making it our baseline of choice.”
What the sources say
- Not checked yetcites Liu et al., 2019 source
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
A check of a cited source is scheduled, or we don’t hold its full text yet; the claim is checked once it runs.
In the paper
“Continued pretraining of a LM on the unlabeled data of a given task (TAPT) has been show to be beneficial for endtask performance (e.g. in Howard and Ruder, 2018; Phang et al., 2018; Sun et al., 2019).”
What the sources say
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim.
What the paper did — it cites no source for this, so there is none to check. The quote shows it is in the paper.
In the paper
“Mean test set microF 1 (for CHEMPROT and RCT) and macroF 1 (for ACL-ARC), across five random seeds, with standard deviations as subscripts, comparing RAND-TAPT (with 50 candidates) and k NNTAPT selection.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“While our results demonstrate how these approaches can improve ROBERTA, a powerful LM, the approaches we studied are general enough to be applied to any pretrained LM.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In contrast, our work explores multiple domains, and is arguably more cost effective, since we continue pretraining an already powerful LM.”
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
What the paper did — it cites no source for this, so there is none to check. The quote shows it is in the paper.
In the paper
“We focused on matching all the domain dataset sizes (see Table 1) such that each domain is exposed to the same amount of data as for 12.5K steps it is trained for.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“Reported results are development macroF 1 , except for CHEMPROT and RCT, for which we report microF 1 , following Beltagy et al. (2019).”
What the sources say
- Not checked yetcites Beltagy et al. (2019) source
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
What the paper did — it cites no source for this, so there is none to check. The quote shows it is in the paper.
In the paper
“To produce final results on this task, we discard and resample degenerate seeds.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“ULMFIT is pretrained on English Wikipedia; ULMFIT † on English tweets; ELMO on the 1BWORDBENCHMARK (newswire; Chelba et al., 2014); GPT on BOOKCORPUS; BERT on English Wikipedia and BOOKCORPUS.”
What the sources say
- Not checked yetcites Chelba et al., 2014 source
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“Task-adaptive pretraining has been shown effective (Howard and Ruder, 2018), but is not typically used with the most recent models.”
- Also stated in: § 4 Task-Adaptive Pretraining · p. 5 · plain
“prior work has shown its effectiveness (e.g. Howard and Ruder, 2018).”
What the sources say
- Not checked yetcites Howard and Ruder, 2018 source
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim.
- Also stated in: § 4 Task-Adaptive Pretraining · p. 5 · plain
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Compared to domainadaptive pretraining (DAPT; § 3), the task-adaptive approach strikes a different trade-off: it uses a far smaller pretraining corpus, but one that is much more task-relevant (under the assumption that the training set represents aspects of the task well).”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- The authors state this as an assumption: The training set represents aspects of the task well.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“However, our analysis in § 3.1 illustrates that REVIEWS and NEWS also have some similarities.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
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.”
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?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Domain adaptation studies [23] show that task performance varies across domains, with general-purpose LLMs exhibiting stronger capabilities in well-represented areas such as Computer Vision than in specialized fields such as Quantum Computing, due to differences in pretraining corpus composition.”
From Abstention vs. Hallucination: Benchmarking LLM Source Attribution for Scientific Citations (2024) · cites this paper as [23]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Continued pre-training on domainspecific data has been shown to be effective for improving performance in a specific domain (Gururangan et al., 2020).”
From The Llama 3 Herd of Models (2024) · cites this paper as Gururangan et al., 2020
The cited source says what the claim attributes to it.
In the citing paper
“Further pre-training has been shown to increase scores when adapting a model to a specific domain or task (Gururangan et al., 2020;Lee et al., 2020).”
From QueryNER: Segmentation of E-commerce Queries (2024) · cites this paper as Gururangan et al., 2020
In the citing paper
“Task adaptive pre-training (TAPT) and domain adaptive pre-training (DAPT) have been proposed by Gururangan et al. [37]. TAPT continues to train it on the target task's training dataset, after pre-training RoBERTa on large-scale corpora. DAPT is still pre-training RoBERTa on datasets with minor domain differences from datasets in target tasks.”
From Self-supervised learning: A succinct review (2023) · cites this paper as [37]
In the citing paper
“The method relies on a comparison of gridbox-scale trends in observational datasets for temperature (HadCRUT4 version 4.6 54 ) and precipitation (GPCC v2018, obtainable from https://psl.noaa.gov/data/gridded/data.gpcc.html),with those produced in climate model runs from CMIP6 55 .”
From Machine-learning-based evidence and attribution mapping of 100,000 climate impact studies (2021) · cites this paper as [54]
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.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ F k -Nearest Neighbors Data Selection · p. 18
“Table 19: Mean development set macroF 1 (for HYP. and IMDB) and microF 1 (for RCT), across five random seeds, with standard deviations as subscripts, comparing RAND-TAPT (with 50 candidates) and k NN-TAPT selection.”
§ F k -Nearest Neighbors Data Selection · p. 18
“| | CHEMPROT | RCT-500 | ACL-ARC |”
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ 5.3 Computational Requirements · p. 8
“storage requirements for DAPT on this task are 5.8M times that of TAPT.”
§ 5.3 Computational Requirements · p. 8
“| TAPT | 0.2K | 500 | 80KB | 79.8 1 . 4 | | 50 NN-TAPT | 1.1K | 24K | 3MB | 80.8 0 . 6 | | 150 NN-TAPT | 3.2K | 66K | 8MB | 81.2 0 . 8 | | 500 NN-TAPT | 9.0K | 185K | 24MB | 81.7 0 . 4 | | Curated-TAPT | 8.8K | 180K | 27MB | 83.4 0 . 3 | | DAPT | 12.5K | 25M | 47GB | 82.5 0 . 5 |”
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ 5.1 Human Curated-TAPT · p. 7
“Curated-TAPT further improves our prior results from § 4 across all three datasets.”
§ 5 Augmenting Training Data for Task-Adaptive Pretraining · p. 7
“| TAPT | 79.8 1 . 4 | 90.4 5 . 2 | 95.5 0 . 1 | | DAPT + TAPT | 83.0 0 . 3 | 90.0 6 . 6 | 95.6 0 . 1 | | Curated-TAPT | 83.4 0 . 3 | 89.9 9 . 5 | 95.7 0 . 1 |”
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ 5.1 Human Curated-TAPT · p. 7
“We simulate a low-resource setting RCT500, by downsampling the training data of the RCT dataset to 500 examples (out of 180K available), and treat the rest of the training data as unlabeled.”
§ 3.2 Experiments · p. 4
“| BIOMED | CHEMPROT † RCT | relation classification abstract sent. roles | 4169 18040 | - - | 2427 30212 | 3469 30135 | 13 5 |”
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ 5.2 Automated Data Selection for TAPT · p. 8
“As we increase k , k NN-TAPT performance steadily increases, and approaches that of DAPT.”
§ 5.1 Human Curated-TAPT · p. 7
“| 50 NN-TAPT | 83.3 0 . 7 | 80.8 0 . 6 | 70.7 2 . 8 | | 150 NN-TAPT | 83.2 0 . 6 | 81.2 0 . 8 | 73.3 2 . 7 | | 500 NN-TAPT | 83.3 0 . 7 | 81.7 0 . 4 | 75.5 1 . 9 |”
Citations
Cites
Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A. N., Kaiser, L., & Polosukhin, I. (2017) · arXiv · doi:10.48550/arxiv.1706.03762 · Cited by 120,404
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding
Devlin, J., Chang, M.-W., Lee, K., & Toutanova, K. (2019) · Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers) · doi:10.18653/v1/n19-1423 · Cited by 54,325
RoBERTa: A Robustly Optimized BERT Pretraining Approach
Liu, Y., Ott, M., Goyal, N., Du, J., Joshi, M., Chen, D., Levy, O., Lewis, M., Zettlemoyer, L., & Stoyanov, V. (2019) · arXiv · doi:10.48550/arxiv.1907.11692 · Cited by 16,515
Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer
Raffel, C., Shazeer, N., Roberts, A., Lee, K., Narang, S., Matena, M., Zhou, Y., Li, W., & Liu, P. J. (2019) · arXiv · doi:10.48550/arxiv.1910.10683 · Cited by 10,929
BioBERT: a pre-trained biomedical language representation model for biomedical text mining
Lee, J., Yoon, W., Kim, S., Kim, D., Kim, S., So, C. H., & Kang, J. (2020) · Bioinformatics · doi:10.1093/bioinformatics/btz682 · Cited by 7,218
XLNet: Generalized Autoregressive Pretraining for Language Understanding
Yang, Z., Dai, Z., Yang, Y., Carbonell, J., Salakhutdinov, R., & Le, Q. V. (2019) · arXiv · doi:10.48550/arxiv.1906.08237 · Cited by 6,687
Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translation
Wu, Y., Schuster, M., Chen, Z., Le, Q. V., Norouzi, M., Macherey, W., Krikun, M., Cao, Y., Gao, Q., Macherey, K., et al. (2016) · arXiv · doi:10.48550/arxiv.1609.08144 · Cited by 5,319
DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter
Sanh, V., Debut, L., Chaumond, J., & Wolf, T. (2019) · arXiv · doi:10.48550/arxiv.1910.01108 · Cited by 4,653
Character-level Convolutional Networks for Text ClassificationPreprint
Zhang, X., Zhao, J., & LeCun, Y. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1509.01626 · Cited by 4,481
Research works printed but not linked: 5
- 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/
- Urvashi Khandelwal, Omer Levy, Dan Jurafsky, Luke Zettlemoyer, and Mike Lewis. 2020. Generalization through memorization: Nearest neighbor language models. In ICLR . To appear.
- 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 .
- Steffen Remus and Chris Biemann. 2016. DomainSpecific Corpus Expansion with Focused Webcrawling. In LREC .
- 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 101–200 of 1,011
Understanding tables with intermediate pre-training
Eisenschlos, J. M., Krichene, S., & Müller, T. (2020) · Findings of the Association for Computational Linguistics: EMNLP (Findings of EMNLP) · doi:10.18653/v1/2020.findings-emnlp.27 · Cited by 103
Automating Research Synthesis with Domain-Specific Large Language Model Fine-Tuning
Sušnjak, T., Hwang, P., Reyes, N. H., Barczak, A. L. C., McIntosh, T. R., & Ranathunga, S. (2025) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3715964 · Cited by 118
Mind the Gap: Assessing Temporal Generalization in Neural Language Models
Lazaridou, A., Kuncoro, A., Gribovskaya, E., Agrawal, D., Liska, A., Terzi, T., Gimenez, M., d'Autume, C. D. M., Kocisky, T., Ruder, S., et al. (2021) · arXiv · doi:10.48550/arxiv.2102.01951 · Cited by 90
Improving Passage Retrieval with Zero-Shot Question Generation
Sachan, D., Lewis, M., Joshi, M., Aghajanyan, A., Yih, W.-T., Pineau, J., & Zettlemoyer, L. (2022) · Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/2022.emnlp-main.249 · Cited by 90
Process for Adapting Language Models to Society (PALMS) with Values-Targeted Datasets
Solaiman, I., & Dennison, C. (2021) · arXiv · doi:10.48550/arxiv.2106.10328 · Cited by 90
Multi-Modal Relational Graph for Cross-Modal Video Moment Retrieval
YaWen, Z., Cao, D., Wei, X., Liu, M., Zhao, Z., & Qin, Z. (2021) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr46437.2021.00225 · Cited by 92
Kotei, E., & Thirunavukarasu, R. (2023) · Information · doi:10.3390/info14030187 · Cited by 89
Data Contamination: From Memorization to Exploitation
Magar, I., & Schwartz, R. (2022) · Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers) · doi:10.18653/v1/2022.acl-short.18 · Cited by 88
Task-Specific Transformer-Based Language Models in Health Care: Scoping Review
Cho, H. N., Jun, T. J., Kim, Y., Kang, H. J., Ahn, I., Gwon, H., Kim, Y., Seo, H., Choi, H., Kim, M., et al. (2024) · JMIR Medical Informatics · doi:10.2196/49724 · Cited by 85
GNN-RAG: Graph Neural Retrieval for Efficient Large Language Model Reasoning on Knowledge Graphs
Mavromatis, C., & Karypis, G. (2025) · Findings of the Association for Computational Linguistics: ACL (Findings of ACL) · doi:10.18653/v1/2025.findings-acl.856 · Cited by 87
LogME: Practical Assessment of Pre-trained Models for Transfer LearningPreprint
You, K., Liu, Y., Wang, J., & Long, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.11005 · Cited by 92
What does BERT know about books, movies and music? Probing BERT for Conversational Recommendation
Penha, G., & Hauff, C. (2020) · ACM Conference on Recommender Systems (RecSys) · doi:10.1145/3383313.3412249 · Cited by 91
Unmasking Contextual Stereotypes: Measuring and Mitigating BERT's Gender Bias
Bartl, M., Nissim, M., & Gatt, A. (2020) · arXiv · doi:10.48550/arxiv.2010.14534 · Cited by 84
GPL: Generative Pseudo Labeling for Unsupervised Domain Adaptation of Dense Retrieval
Wang, K., Thakur, N., Reimers, N., & Gurevych, I. (2022) · Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT) · doi:10.18653/v1/2022.naacl-main.168 · Cited by 83
Bereczki, Z., Benczik, B., Balogh, O. M., Marton, S., Puhl, E., Pétervári, M., Váczy‐Földi, M., Papp, Z. T., Makkos, A., Glass, K., et al. (2024) · British Journal of Pharmacology · doi:10.1111/bph.17302 · Cited by 86
Detoxifying Language Models Risks Marginalizing Minority Voices
Xu, A., Pathak, E., Wallace, E., Gururangan, S., Sap, M., & Klein, D. (2021) · Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT) · doi:10.18653/v1/2021.naacl-main.190 · Cited by 131
Self-citationDoes the magic of BERT apply to medical code assignment? A quantitative study
Ji, S., Hölttä, M., & Marttinen, P. (2021) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2021.104998 · Cited by 85
Good Examples Make A Faster Learner: Simple Demonstration-based Learning for Low-resource NER
Lee, D., Kadakia, A., Tan, K., Agarwal, M., Feng, X., Shibuya, T., Mitani, R., Sekiya, T., Pujara, J., & Ren, X. (2022) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.18653/v1/2022.acl-long.192 · Cited by 84
What to Pre-Train on? Efficient Intermediate Task Selection
Poth, C., Pfeiffer, J., Rücklé, A., & Gurevych, I. (2021) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2021.emnlp-main.827 · Cited by 92
Heinzerling, B., & Inui, K. (2021) · Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume · doi:10.18653/v1/2021.eacl-main.153 · Cited by 78
Counterfactual Inference for Text Classification Debiasing
Chen, Q., Feng, F., Wen, L., Ma, C., & Xie, P. (2021) · doi:10.18653/v1/2021.acl-long.422 · Cited by 80
Revisiting Transformer-based Models for Long Document Classification
Dai, X., Chalkidis, I., Darkner, S., & Elliott, D. (2022) · Findings of the Association for Computational Linguistics: EMNLP (Findings of EMNLP) · doi:10.18653/v1/2022.findings-emnlp.534 · Cited by 91
Multimodality Representation Learning: A Survey on Evolution, Pretraining and Its Applications
Manzoor, M. A., Albarri, S., Xian, Z., Meng, Z., Nakov, P., & Liang, S. (2023) · ACM Transactions on Multimedia Computing Communications and Applications · doi:10.1145/3617833 · Cited by 86
Qiu, C., Zhang, X., Tong, X., Guan, N., Yi, X., Yang, K., Zhu, J., & Yu, A. (2024) · ISPRS Journal of Photogrammetry and Remote Sensing · doi:10.1016/j.isprsjprs.2024.02.005 · Cited by 86
AdaptSum: Towards Low-Resource Domain Adaptation for Abstractive Summarization
Yu, T., Liu, Z., & Fung, P. (2021) · Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT) · doi:10.18653/v1/2021.naacl-main.471 · Cited by 78
When FLUE Meets FLANG: Benchmarks and Large Pretrained Language Model for Financial Domain
Shah, R., Chawla, K., Eidnani, D., Shah, A., Du, W., Chava, S., Raman, N., Smiley, C., Chen, J., & Yang, D. (2022) · Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/2022.emnlp-main.148 · Cited by 74
An Empirical Study of Pre-trained Transformers for Arabic Information Extraction
Lan, W., Yang, C., Xu, W. H., & Ritter, A. (2020) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2020.emnlp-main.382 · Cited by 81
SemEval 2021 Task 7: HaHackathon, Detecting and Rating Humor and Offense
Meaney, J. A., Wilson, S. R., Chiruzzo, L., Lopez, A., & Magdy, W. (2021) · International Workshop on Semantic Evaluation (SemEval) · doi:10.18653/v1/2021.semeval-1.9 · Cited by 80
Assessing the Impact of Contextual Information in Hate Speech Detection
Pérez, J. M., Luque, F. M., Zayat, D., Kondratzky, M., Moro, A., Serrati, P. S., Zajac, J., Miguel, P., Debandi, N., Gravano, A., et al. (2023) · IEEE Access · doi:10.1109/access.2023.3258973 · Cited by 88
The Moral Integrity Corpus: A Benchmark for Ethical Dialogue Systems
Ziems, C., Yu, J., Wang, Y., Halevy, A. Y., & Yang, D. (2022) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.18653/v1/2022.acl-long.261 · Cited by 107
ChestXRayBERT: A Pretrained Language Model for Chest Radiology Report Summarization
Cai, X., Liu, S., Han, J., Yang, L., Liu, Z., & Liu, T. (2023) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2021.3132724 · Cited by 72
On Transferability of Prompt Tuning for Natural Language Processing
Su, Y., Wang, X., Qin, Y., Chan, C.-M., Lin, Y., Wang, H., Wen, K., Liu, Z., Li, P., Li, J., et al. (2022) · Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT) · doi:10.18653/v1/2022.naacl-main.290 · Cited by 98
Henning, S., Beluch, W., Fraser, A., & Friedrich, A. (2023) · Conference of the European Chapter of the Association for Computational Linguistics · doi:10.18653/v1/2023.eacl-main.38 · Cited by 72
TelecomGPT: A Framework to Build Telecom-Specific Large Language Models
Zou, H., Zhao, Q., Tian, Y., Bariah, L., Bader, F., Lestable, T., & Debbah, M. A. (2025) · IEEE Transactions on Machine Learning in Communications and Networking · doi:10.1109/tmlcn.2025.3593184 · Cited by 109
Large language models for life cycle assessments: Opportunities, challenges, and risks
Preuss, N., Alshehri, A. S., & You, F. (2024) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2024.142824 · Cited by 71
T-NER: An All-Round Python Library for Transformer-based Named Entity Recognition
Ushio, A., & Camacho-Collados, J. (2021) · Conference of the European Chapter of the Association for Computational Linguistics · doi:10.18653/v1/2021.eacl-demos.7 · Cited by 81
Learning Rich Representation of Keyphrases from Text
Kulkarni, M., Mahata, D., Arora, R., & Bhowmik, R. (2022) · Findings of the Association for Computational Linguistics: NAACL · doi:10.18653/v1/2022.findings-naacl.67 · Cited by 80
Greco, C. M., & Tagarelli, A. (2023) · Artificial Intelligence and Law · doi:10.1007/s10506-023-09374-7 · Cited by 87
CySecBERT : A Domain-Adapted Language Model for the Cybersecurity Domain
Bayer, M., Kuehn, P., Shanehsaz, R., & Reuter, C. (2024) · ACM Transactions on Privacy and Security · doi:10.1145/3652594 · Cited by 82
AI and the Future of Collaborative Work: Group Ideation with an LLM in a Virtual Canvas
He, J., Houde, S., Gonzalez, G. E., Moran, D., Ross, S., Muller, M. J., & Weisz, J. D. (2024) · Annual Symposium on Human-Computer Interaction for Work (CHIWORK) · doi:10.1145/3663384.3663398 · Cited by 98
Open challenges and opportunities in federated foundation models towards biomedical healthcare
Li, X., Peng, L., Wang, Y., & Zhang, W. (2025) · BioData Mining · doi:10.1186/s13040-024-00414-9 · Cited by 84
Generalizing sentiment analysis: a review of progress, challenges, and emerging directions
Alahmadi, K., Alharbi, S., Chen, J., & Wang, X. (2025) · Social Network Analysis and Mining · doi:10.1007/s13278-025-01461-8 · Cited by 77
Leak, Cheat, Repeat: Data Contamination and Evaluation Malpractices in Closed-Source LLMs
Balloccu, S., Schmidtová, P., Lango, M., & Dusek, O. (2024) · Proceedings of the 18th Conference of the European Chapter of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/2024.eacl-long.5 · Cited by 70
SeqTrans: Automatic Vulnerability Fix Via Sequence to Sequence Learning
Chi, J., Qu, Y., Liu, T., Zheng, Q., & Yin, H. (2022) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2022.3156637 · Cited by 70
A Systematic Benchmarking Analysis of Transfer Learning for Medical Image Analysis
Taher, M. R. H., Haghighi, F., Feng, R., Gotway, M. B., & Liang, J. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-87722-4_1 · Cited by 81
He, K., Mao, R., Lin, Q., Ruan, Y., Lan, X., Feng, M., & Cambria, E. (2024) · doi:10.2139/ssrn.4809363 · Cited by 69
Clinical Outcome Prediction from Admission Notes using Self-Supervised Knowledge Integration
van Aken, B., Papaioannou, J.-M., Mayrdorfer, M., Budde, K., Gers, F. A., & Loeser, A. (2021) · Conference of the European Chapter of the Association for Computational Linguistics · doi:10.18653/v1/2021.eacl-main.75 · Cited by 81
A taxonomy of anti-vaccination arguments from a systematic literature review and text modelling
Fasce, A., Schmid, P., Holford, D. L., Bates, L., Gurevych, I., & Lewandowsky, S. (2023) · Nature Human Behaviour · doi:10.1038/s41562-023-01644-3 · Cited by 72
Challenges in applying large language models to requirements engineering tasks
Norheim, J. J., Rebentisch, E., Xiao, D. Q., Draeger, L., Kerbrat, A., & Weck, O. L. D. (2024) · Design Science · doi:10.1017/dsj.2024.8 · Cited by 86
FitzGerald, J., Ananthakrishnan, S., Arkoudas, K., Bernardi, D., Bhagia, A., Delli Bovi, C., Cao, J., Chada, R., Chauhan, A., Chen, L., et al. (2022) · Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining · doi:10.1145/3534678.3539173 · Cited by 68
DEMix Layers: Disentangling Domains for Modular Language Modeling
Gururangan, S., Lewis, M., Holtzman, A., Smith, N. A., & Zettlemoyer, L. (2022) · Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT) · doi:10.18653/v1/2022.naacl-main.407 · Cited by 81
Self-citationTrue Few-Shot Learning with Prompts—A Real-World Perspective
Schick, T., & Schütze, H. (2022) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00485 · Cited by 81
Cross-Domain Label-Adaptive Stance Detection
Hardalov, M., Arora, A., Nakov, P., & Augenstein, I. (2021) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2021.emnlp-main.710 · Cited by 71
Overview of the Ninth Dialog System Technology Challenge: DSTC9
Gunasekara, C., Kim, S., D’Haro, L. F., Rastogi, A., Chen, Y.-N., Eric, M., Hedayatnia, B., Gopalakrishnan, K., Liu, Y., Huang, C.-W., et al. (2024) · IEEE/ACM Transactions on Audio Speech and Language Processing · doi:10.1109/taslp.2024.3426331 · Cited by 80
Yang, G., Liu, X., Shi, J., Wang, Z., & Wang, G. (2024) · Computer Methods and Programs in Biomedicine Update · doi:10.1016/j.cmpbup.2024.100158 · Cited by 66
Dell, M. (2025) · Journal of Economic Literature · doi:10.1257/jel.20241733 · Cited by 72
Towards Lifelong Learning of Large Language Models: A Survey
Zheng, J., Qiu, S., Shi, C., & Ma, Q. (2025) · ACM Computing Surveys · doi:10.1145/3716629 · Cited by 93
Yang, H., Li, M., Zhou, H., Xiao, Y., Fang, Q., Zhou, S., & Zhang, R. (2025) · Journal of Medical Internet Research · doi:10.2196/70080 · Cited by 82
Fang, L., Yu, X., Cai, J., Chen, Y., Wu, S., Liu, Z., Yang, Z., Lu, H., Gong, X., Liu, Y., et al. (2025) · Artificial Intelligence Review · doi:10.1007/s10462-025-11423-3 · Cited by 86
MOOC-BERT: Automatically Identifying Learner Cognitive Presence From MOOC Discussion Data
Liu, Z., Kong, X., Chen, H., Liu, S., & Yang, Z. (2023) · IEEE Transactions on Learning Technologies · doi:10.1109/tlt.2023.3240715 · Cited by 63
On Learning Universal Representations Across LanguagesPreprint
Wei, X., Weng, R., Hu, Y., Xing, L., Yu, H., & Luo, W. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.15960 · Cited by 70
Houssein, E. H., Mohamed, R. E., & Ali, A. A. (2023) · Scientific Reports · doi:10.1038/s41598-023-34294-6 · Cited by 62
MasakhaNER: Named entity recognition for African languages
(2021) · HAL · doi:10.1162/tacl · Cited by 61
Lamaakal, I., Maleh, Y., El Makkaoui, K., Ouahbi, I., Pławiak, P., Alfarraj, O., Almousa, M., & Abd El-Latif, A. A. (2025) · Sensors · doi:10.3390/s25051318 · Cited by 60
MultiVerS: Improving scientific claim verification with weak supervision and full-document context
Wadden, D., Lo, K., Wang, L., Cohan, A., Beltagy, I., & Hajishirzi, H. (2022) · Findings of the Association for Computational Linguistics: NAACL 2022 · doi:10.18653/v1/2022.findings-naacl.6 · Cited by 60
Self-citationMeta Self-training for Few-shot Neural Sequence Labeling
Wang, Y., Mukherjee, S., Chu, H., Tu, Y., Wu, M., Gao, J., & Awadallah, A. H. (2021) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3447548.3467235 · Cited by 60
Liu, Y., Zhou, Y., Liu, Y., Xu, Z., & He, Y. (2025) · Engineering · doi:10.1016/j.eng.2025.04.003 · Cited by 63
Dict-BERT: Enhancing Language Model Pre-training with Dictionary
Yu, W., Zhu, C., Fang, Y., Yu, D., Wang, S., Xu, Y., Zeng, M., & Jiang, M. (2022) · Findings of the Association for Computational Linguistics: ACL (Findings of ACL) · doi:10.18653/v1/2022.findings-acl.150 · Cited by 70
Liu, Y., Zhang, X. F., Wegsman, D., Beauchamp, N., & Wang, L. (2022) · Findings of the Association for Computational Linguistics: NAACL · doi:10.18653/v1/2022.findings-naacl.101 · Cited by 77
Retrieval-augmented Generation across Heterogeneous Knowledge
Yu, W. (2022) · Conference of the North American Chapter of the Association for Computational Linguistics: Student Research Workshop (NAACL SRW) · doi:10.18653/v1/2022.naacl-srw.7 · Cited by 62
GeoLayoutLM: Geometric Pre-training for Visual Information Extraction
Luo, C., Cheng, C., Zheng, Q., & Yao, C. (2023) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52729.2023.00685 · Cited by 65
Analyzing Dataset Annotation Quality Management in the Wild
Klie, J.-C., de Castilho, R. E., & Gurevych, I. (2024) · Computational Linguistics · doi:10.1162/coli_a_00516 · Cited by 66
Large language models in plant biology
Lam, H. Y. I., Ong, X. E., & Mutwil, M. (2024) · Trends in Plant Science · doi:10.1016/j.tplants.2024.04.013 · Cited by 70
DomBERT: Domain-oriented Language Model for Aspect-based Sentiment Analysis
Xu, H., Liu, B., Shu, L., & Yu, P. (2020) · Findings of the Association for Computational Linguistics: EMNLP (Findings of EMNLP) · doi:10.18653/v1/2020.findings-emnlp.156 · Cited by 61
A Comparative Study of Using Pre-trained Language Models for Toxic Comment Classification
Zhao, Z., Zhang, Z., & Hopfgartner, F. (2021) · International World Wide Web Conference (WWW) · doi:10.1145/3442442.3452313 · Cited by 63
CRITIC: Large Language Models Can Self-Correct with Tool-Interactive Critiquing
Gou, Z., Shao, Z., Gong, Y., Shen, Y., Yang, Y., Duan, N., & Chen, W. (2023) · arXiv · doi:10.48550/arxiv.2305.11738 · Cited by 561
“[119] Suchin Gururangan, Ana Marasović, Swabha Swayamdipta, Kyle Lo, Iz Beltagy, Doug Downey, and Noah A.”
BackgroundPre-trained Language Model based Ranking in Baidu Search
Zou, L., Zhang, S., Cai, H., Ma, D., Cheng, S., Wang, S., Shi, D., Cheng, Z., & Yin, D. (2021) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3447548.3467147 · Cited by 61
Xu, R., Tao, C., Jiang, D., Zhao, X., Zhao, D., & Yan, R. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i16.17666 · Cited by 59
Su, P., & Vijay‐Shanker, K. (2022) · BMC Bioinformatics · doi:10.1186/s12859-022-04642-w · Cited by 63
Automated Attack Synthesis by Extracting Finite State Machines from Protocol Specification Documents
Pacheco, M. L., von Hippel, M., Weintraub, B., Goldwasser, D., & Nita-Rotaru, C. (2022) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp46214.2022.9833673 · Cited by 64
A multi-center study on the adaptability of a shared foundation model for electronic health records
Guo, L., Fries, J., Steinberg, E., Fleming, S. L., Morse, K., Aftandilian, C. C., Posada, J., Shah, N. H., & Sung, L. (2024) · npj Digital Medicine · doi:10.1038/s41746-024-01166-w · Cited by 67
Causal BERT: Language Models for Causality Detection Between Events Expressed in Text
Khetan, V., Ramnani, R., Anand, M., Sengupta, S., & Fano, A. (2021) · Lecture notes in networks and systems · doi:10.1007/978-3-030-80119-9_64 · Cited by 57
Razumovskaia, E., Glavaš, G., Majewska, O., Ponti, E. M., Korhonen, A., & Vulić, I. (2022) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.13083 · Cited by 65
Train No Evil: Selective Masking for Task-Guided Pre-Training
Gu, Y., Zhang, Z., Wang, X., Liu, Z., & Sun, M. (2020) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2020.emnlp-main.566 · Cited by 58
Automated Lay Language Summarization of Biomedical Scientific Reviews
Guo, Y., Qiu, W., Wang, Y., & Cohen, T. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i1.16089 · Cited by 61
XHate-999: Analyzing and Detecting Abusive Language Across Domains and Languages
Glavaš, G., Karan, M., & Vulić, I. (2020) · International Conference on Computational Linguistics · doi:10.18653/v1/2020.coling-main.559 · Cited by 55
Röttger, P., & Pierrehumbert, J. B. (2021) · Findings of the Association for Computational Linguistics: EMNLP (Findings of EMNLP) · doi:10.18653/v1/2021.findings-emnlp.206 · Cited by 65
Adelani, D. I., Alabi, J. O., Fan, A., Kreutzer, J., Shen, X., Reid, M., Ruiter, D., Klakow, D., Nabende, P., Chang, E., et al. (2022) · Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT) · doi:10.18653/v1/2022.naacl-main.223 · Cited by 63
Domain Adaptation for Deep Entity Resolution
Tu, J., Fan, J., Tang, N., Wang, P., Chai, C., Li, G., Fan, R., & Du, X. (2022) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3514221.3517870 · Cited by 56
Phishing URL detection generalisation using Unsupervised Domain Adaptation
Rashid, F., Doyle, B., Han, S. C., & Seneviratne, S. (2024) · Computer Networks · doi:10.1016/j.comnet.2024.110398 · Cited by 58
Kraišniković, C., Harb, R., Plass, M., Zoughbi, W. A., Holzinger, A., & Müller, H. (2024) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2024.109561 · Cited by 55
SUPERB: Speech processing Universal PERformance Benchmark
Yang, S.-W., Chi, P.-H., Chuang, Y.-S., Lai, C.-I. J., Lakhotia, K., Lin, Y. Y., Liu, A. T., Shi, J., Chang, X., Lin, G.-T., et al. (2021) · arXiv · doi:10.48550/arxiv.2105.01051 · Cited by 52
DynaEval: Unifying Turn and Dialogue Level Evaluation
Zhang, C., Chen, Y., D’Haro, L. F., Zhang, Y., Friedrichs, T., Lee, G., & Li, H. (2021) · Annual Meeting of the Association for Computational Linguistics · doi:10.18653/v1/2021.acl-long.441 · Cited by 62
Just Say No: Analyzing the Stance of Neural Dialogue Generation in Offensive Contexts
Baheti, A., Sap, M., Ritter, A., & Riedl, M. O. (2021) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2021.emnlp-main.397 · Cited by 60
TaCL: Improving BERT Pre-training with Token-aware Contrastive Learning
Su, Y., Liu, F., Meng, Z., Lan, T., Shu, L., Shareghi, E., & Collier, N. (2022) · Findings of the Association for Computational Linguistics: NAACL · doi:10.18653/v1/2022.findings-naacl.191 · Cited by 59
Retrieval augmentation of large language models for lay language generation
Guo, Y., Qiu, W., Gondy Leroy, A., Wang, S., & Cohen, T. (2023) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2023.104580 · Cited by 62
MPC-BERT: A Pre-Trained Language Model for Multi-Party Conversation Understanding
Gu, J.-C., Tao, C., Ling, Z.-H., Xu, C., Geng, X., & Jiang, D. (2021) · doi:10.18653/v1/2021.acl-long.285 · Cited by 51
Data-driven building load prediction and large language models: Comprehensive overview
Zhang, Y., Wang, D., Wang, G., Xu, P., & Zhu, Y. (2024) · Energy and Buildings · doi:10.1016/j.enbuild.2024.115001 · Cited by 52
Validation guidelines for drug-target prediction methods
Tanoli, Z., Schulman, A., & Aittokallio, T. A. (2024) · Expert Opinion on Drug Discovery · doi:10.1080/17460441.2024.2430955 · Cited by 53
Culturally Aware and Adapted NLP: A Taxonomy and a Survey of the State of the Art
Liu, C. C., Gurevych, I., & Korhonen, A. (2025) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00760 · Cited by 81
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
- hybrid
- doi.org
- 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
