|
--- |
|
language: en |
|
tags: |
|
- exbert |
|
license: apache-2.0 |
|
datasets: |
|
- bookcorpus |
|
- wikipedia |
|
--- |
|
|
|
This model is exported for masked-lm task with the following command: |
|
``` |
|
python3 -m optimum.exporters.onnx --model bert-base-cased --for-ort --task masked-lm models/ |
|
``` |
|
If you want to use `bert-base-uncased` for other tasks, please export the ONNX model with your corresponding task. |
|
|
|
# BERT base model (uncased) |
|
|
|
Pretrained model on English language using a masked language modeling (MLM) objective. It was introduced in |
|
[this paper](https://arxiv.org/abs/1810.04805) and first released in |
|
[this repository](https://github.com/google-research/bert). This model is uncased: it does not make a difference |
|
between english and English. |
|
|
|
Disclaimer: The team releasing BERT did not write a model card for this model so this model card has been written by |
|
the Hugging Face team. |
|
|
|
## Model description |
|
|
|
BERT is a transformers model pretrained on a large corpus of English data in a self-supervised fashion. This means it |
|
was pretrained on the raw texts only, with no humans labeling them in any way (which is why it can use lots of |
|
publicly available data) with an automatic process to generate inputs and labels from those texts. More precisely, it |
|
was pretrained with two objectives: |
|
|
|
- Masked language modeling (MLM): taking a sentence, the model randomly masks 15% of the words in the input then run |
|
the entire masked sentence through the model and has to predict the masked words. This is different from traditional |
|
recurrent neural networks (RNNs) that usually see the words one after the other, or from autoregressive models like |
|
GPT which internally masks the future tokens. It allows the model to learn a bidirectional representation of the |
|
sentence. |
|
- Next sentence prediction (NSP): the models concatenates two masked sentences as inputs during pretraining. Sometimes |
|
they correspond to sentences that were next to each other in the original text, sometimes not. The model then has to |
|
predict if the two sentences were following each other or not. |
|
|
|
This way, the model learns an inner representation of the English language that can then be used to extract features |
|
useful for downstream tasks: if you have a dataset of labeled sentences, for instance, you can train a standard |
|
classifier using the features produced by the BERT model as inputs. |
|
|
|
## Model variations |
|
|
|
BERT has originally been released in base and large variations, for cased and uncased input text. The uncased models also strips out an accent markers. |
|
Chinese and multilingual uncased and cased versions followed shortly after. |
|
Modified preprocessing with whole word masking has replaced subpiece masking in a following work, with the release of two models. |
|
Other 24 smaller models are released afterward. |
|
|
|
The detailed release history can be found on the [google-research/bert readme](https://github.com/google-research/bert/blob/master/README.md) on github. |
|
|
|
| Model | #params | Language | |
|
|------------------------|--------------------------------|-------| |
|
| [`bert-base-uncased`](https://huggingface.co/bert-base-uncased) | 110M | English | |
|
| [`bert-large-uncased`](https://huggingface.co/bert-large-uncased) | 340M | English | sub |
|
| [`bert-base-cased`](https://huggingface.co/bert-base-cased) | 110M | English | |
|
| [`bert-large-cased`](https://huggingface.co/bert-large-cased) | 340M | English | |
|
| [`bert-base-chinese`](https://huggingface.co/bert-base-chinese) | 110M | Chinese | |
|
| [`bert-base-multilingual-cased`](https://huggingface.co/bert-base-multilingual-cased) | 110M | Multiple | |
|
| [`bert-large-uncased-whole-word-masking`](https://huggingface.co/bert-large-uncased-whole-word-masking) | 340M | English | |
|
| [`bert-large-cased-whole-word-masking`](https://huggingface.co/bert-large-cased-whole-word-masking) | 340M | English | |
|
|
|
## Intended uses & limitations |
|
|
|
You can use the raw model for either masked language modeling or next sentence prediction, but it's mostly intended to |
|
be fine-tuned on a downstream task. See the [model hub](https://huggingface.co/models?filter=bert) to look for |
|
fine-tuned versions of a task that interests you. |
|
|
|
Note that this model is primarily aimed at being fine-tuned on tasks that use the whole sentence (potentially masked) |
|
to make decisions, such as sequence classification, token classification or question answering. For tasks such as text |
|
generation you should look at model like GPT2. |
|
|
|
### How to use |
|
|
|
You can use this model directly with a pipeline for masked language modeling from the [Optimum library](https://huggingface.co/docs/optimum/main/en/index): |
|
|
|
```python |
|
>>> from optimum.pipelines import pipeline |
|
>>> unmasker = pipeline('fill-mask', model='bert-base-uncased', accelerator="ort") |
|
>>> unmasker("The capital of France is [MASK].") |
|
|
|
[{'score': 0.4167858958244324, |
|
'token': 3000, |
|
'token_str': 'paris', |
|
'sequence': 'the capital of france is paris.'}, |
|
{'score': 0.07141812890768051, |
|
'token': 22479, |
|
'token_str': 'lille', |
|
'sequence': 'the capital of france is lille.'}, |
|
{'score': 0.06339272111654282, |
|
'token': 10241, |
|
'token_str': 'lyon', |
|
'sequence': 'the capital of france is lyon.'}, |
|
{'score': 0.04444783180952072, |
|
'token': 16766, |
|
'token_str': 'marseille', |
|
'sequence': 'the capital of france is marseille.'}, |
|
{'score': 0.030297117307782173, |
|
'token': 7562, |
|
'token_str': 'tours', |
|
'sequence': 'the capital of france is tours.'} |
|
] |
|
``` |
|
|
|
Here is how to use this model to fill the masked token with ONNX Runtime backend: |
|
|
|
```python |
|
from transformers import AutoTokenizer |
|
from optimum.onnxruntime import ORTModelForMaskedLM |
|
tokenizer = AutoTokenizer.from_pretrained('bert-base-uncased') |
|
|
|
model = ORTModelForMaskedLM.from_pretrained("bert-base-uncased", from_transformers=True) |
|
text = "The capital of France is [MASK]." |
|
inputs = tokenizer(text, return_tensors="pt") |
|
logits = model(**inputs) |
|
|
|
mask_token_index = (inputs.input_ids == tokenizer.mask_token_id)[0].nonzero(as_tuple=True)[0] |
|
predicted_token_id = logits[0, mask_token_index].argmax(axis=-1) |
|
|
|
tokenizer.decode(predicted_token_id) |
|
``` |
|
|
|
### Limitations and bias |
|
|
|
Even if the training data used for this model could be characterized as fairly neutral, this model can have biased |
|
predictions: |
|
|
|
```python |
|
>>> from optimum.pipelines import pipeline |
|
>>> unmasker = pipeline('fill-mask', model='bert-base-uncased', accelerator="ort") |
|
>>> unmasker("The man worked as a [MASK].") |
|
|
|
[{'score': 0.09747613966464996, |
|
'token': 10533, |
|
'token_str': 'carpenter', |
|
'sequence': 'the man worked as a carpenter.'}, |
|
{'score': 0.0523831732571125, |
|
'token': 15610, |
|
'token_str': 'waiter', |
|
'sequence': 'the man worked as a waiter.'}, |
|
{'score': 0.04962756112217903, |
|
'token': 13362, |
|
'token_str': 'barber', |
|
'sequence': 'the man worked as a barber.'}, |
|
{'score': 0.03788623586297035, |
|
'token': 15893, |
|
'token_str': 'mechanic', |
|
'sequence': 'the man worked as a mechanic.'}, |
|
{'score': 0.03768099099397659, |
|
'token': 18968, |
|
'token_str': 'salesman', |
|
'sequence': 'the man worked as a salesman.'}] |
|
|
|
>>> unmasker("The woman worked as a [MASK].") |
|
|
|
[{'score': 0.21981455385684967, |
|
'token': 6821, |
|
'token_str': 'nurse', |
|
'sequence': 'the woman worked as a nurse.'}, |
|
{'score': 0.15974153578281403, |
|
'token': 13877, |
|
'token_str': 'waitress', |
|
'sequence': 'the woman worked as a waitress.'}, |
|
{'score': 0.11547334492206573, |
|
'token': 10850, |
|
'token_str': 'maid', |
|
'sequence': 'the woman worked as a maid.'}, |
|
{'score': 0.0379691943526268, |
|
'token': 19215, |
|
'token_str': 'prostitute', |
|
'sequence': 'the woman worked as a prostitute.'}, |
|
{'score': 0.030423566699028015, |
|
'token': 5660, |
|
'token_str': 'cook', |
|
'sequence': 'the woman worked as a cook.'}] |
|
``` |
|
|
|
This bias will also affect all fine-tuned versions of this model. |
|
|
|
## Training data |
|
|
|
The BERT model was pretrained on [BookCorpus](https://yknzhu.wixsite.com/mbweb), a dataset consisting of 11,038 |
|
unpublished books and [English Wikipedia](https://en.wikipedia.org/wiki/English_Wikipedia) (excluding lists, tables and |
|
headers). |
|
|
|
## Training procedure |
|
|
|
### Preprocessing |
|
|
|
The texts are lowercased and tokenized using WordPiece and a vocabulary size of 30,000. The inputs of the model are |
|
then of the form: |
|
|
|
``` |
|
[CLS] Sentence A [SEP] Sentence B [SEP] |
|
``` |
|
|
|
With probability 0.5, sentence A and sentence B correspond to two consecutive sentences in the original corpus, and in |
|
the other cases, it's another random sentence in the corpus. Note that what is considered a sentence here is a |
|
consecutive span of text usually longer than a single sentence. The only constrain is that the result with the two |
|
"sentences" has a combined length of less than 512 tokens. |
|
|
|
The details of the masking procedure for each sentence are the following: |
|
- 15% of the tokens are masked. |
|
- In 80% of the cases, the masked tokens are replaced by `[MASK]`. |
|
- In 10% of the cases, the masked tokens are replaced by a random token (different) from the one they replace. |
|
- In the 10% remaining cases, the masked tokens are left as is. |
|
|
|
### Pretraining |
|
|
|
The model was trained on 4 cloud TPUs in Pod configuration (16 TPU chips total) for one million steps with a batch size |
|
of 256. The sequence length was limited to 128 tokens for 90% of the steps and 512 for the remaining 10%. The optimizer |
|
used is Adam with a learning rate of 1e-4, \\(\beta_{1} = 0.9\\) and \\(\beta_{2} = 0.999\\), a weight decay of 0.01, |
|
learning rate warmup for 10,000 steps and linear decay of the learning rate after. |
|
|
|
## Evaluation results |
|
|
|
When fine-tuned on downstream tasks, this model achieves the following results: |
|
|
|
Glue test results: |
|
|
|
| Task | MNLI-(m/mm) | QQP | QNLI | SST-2 | CoLA | STS-B | MRPC | RTE | Average | |
|
|:----:|:-----------:|:----:|:----:|:-----:|:----:|:-----:|:----:|:----:|:-------:| |
|
| | 84.6/83.4 | 71.2 | 90.5 | 93.5 | 52.1 | 85.8 | 88.9 | 66.4 | 79.6 | |
|
|
|
|
|
### BibTeX entry and citation info |
|
|
|
```bibtex |
|
@article{DBLP:journals/corr/abs-1810-04805, |
|
author = {Jacob Devlin and |
|
Ming{-}Wei Chang and |
|
Kenton Lee and |
|
Kristina Toutanova}, |
|
title = {{BERT:} Pre-training of Deep Bidirectional Transformers for Language |
|
Understanding}, |
|
journal = {CoRR}, |
|
volume = {abs/1810.04805}, |
|
year = {2018}, |
|
url = {http://arxiv.org/abs/1810.04805}, |
|
archivePrefix = {arXiv}, |
|
eprint = {1810.04805}, |
|
timestamp = {Tue, 30 Oct 2018 20:39:56 +0100}, |
|
biburl = {https://dblp.org/rec/journals/corr/abs-1810-04805.bib}, |
|
bibsource = {dblp computer science bibliography, https://dblp.org} |
|
} |
|
``` |
|
|
|
<a href="https://huggingface.co/exbert/?model=bert-base-uncased"> |
|
<img width="300px" src="https://cdn-media.huggingface.co/exbert/button.png"> |
|
</a> |
|
|