Methods › Natural Language Processing › Autoencoding Transformers › BERT

BERT

6,938 papers tagged archive 2025-07-28

Introduced by Jacob Devlin et al. in BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

BERT, or Bidirectional Encoder Representations from Transformers, improves upon standard Transformers by removing the unidirectionality constraint by using a masked language model (MLM) pre-training objective. The masked language model randomly masks some of the tokens from the input, and the objective is to predict the original vocabulary id of the masked word based only on its context. Unlike left-to-right language model pre-training, the MLM objective enables the representation to fuse the left and the right context, which allows us to pre-train a deep bidirectional Transformer. In addition to the masked language model, BERT uses a next sentence prediction task that jointly pre-trains text-pair representations.

There are two steps in BERT: pre-training and fine-tuning. During pre-training, the model is trained on unlabeled data over different pre-training tasks. For fine-tuning, the BERT model is first initialized with the pre-trained parameters, and all of the parameters are fine-tuned using labeled data from the downstream tasks. Each downstream task has separate fine-tuned models, even though they are initialized with the same pre-trained parameters.

PaperSourceSee Code · google-research/bert

In Syntology repository known, no verified implementation (declared_code; repositories: 5 listed of 533 in the graph, strongest link: official). This answer is about arXiv:1810.04805, the paper the archive credits with this method.

Origin paper of this answer, arXiv:1810.04805 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 300 ran (of which 75 constructed an object rather than computing a result; 234 with no instrument failure: 18 honoured, 5 violated, 211 with no contract checked; 66 where Syntology's instrument failed) · 359 unverified (of 659 harvested samples) · 164 pointer-only (licence). The instrument figure counts failures of Syntology's instrument, not of the code. Ran means executed on a synthesized input, not that the code is correct.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 6,938 · with a code link: 2,862 · where Syntology ran a sample: 640 (505 with a run with no instrument failure, 135 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (640 of 6,938 tagged: 505 with a run with no instrument failure, 135 where every run was a failure of Syntology's instrument)

Page 1 of 70: papers 1 to 100 of 6,938, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 shown of 1,187 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
RAG1,288
Retrieval1,260
Language Modelling1,119
Retrieval-augmented Generation1,092
Language Modeling903
Question Answering751
Sentence730
Sentiment Analysis406
Text Classification387
text-classification342
Transfer Learning305
Classification261
Word Embeddings258
Information Retrieval243
Named Entity Recognition242
Named Entity Recognition (NER)231
named-entity-recognition231
Natural Language Understanding229
Large Language Model221
Articles188

Usage over time archive 2025-07-28

Papers per year tagged with BERT: 2018 to 2025, peak 1,375 1,375 0 2018: 6 papers 2018 2019: 576 papers 2019 2020: 1234 papers 2020 2021: 1288 papers 2021 2022: 810 papers 2022 2023: 831 papers 2023 2024: 1375 papers 2024 2025: 818 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (6,938 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Autoencoding TransformersTransformersLanguage Models

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections