Skip to content

Question answering on the Google Natural Questions data corpus using HuggingFace's Transformers library

Notifications You must be signed in to change notification settings

sohamray19/distilBertNQ

Repository files navigation

distilBertNQ

Question Answering performed on Google's Natural Questions dataset using Huggingface's DistilBert Transformer

Results

Best combined score:

  • F1-score = Long: 58, Short: 49
  • Precision = Long: 62, Short: 49
  • Recall = Long: 54, Short: 50

Best Long Answer score:

  • F1-score = 60
  • Precision = 64
  • Recall = 56

Best Short Answer Score:

  • F1-score = 49
  • Precision = 49
  • Recall = 50

Winning hyperparameter setting is highlighted in the excel sheet attached below (see hyperparameter tuning section). Note: I have considered "best-threshold" values from the evaluation script output for the F1-score, precision and recall

Getting Started

  • Clone this repository to get started.
  • Make sure you have python 3.7 installed. If not installed already, follow the instructions on Anaconda website

Prerequisites

You will need:

  • Huggingface's transformers library
  • Tensorflow 2.0 (with gpu)
  • gsutils
  • tensorflow addons
pip install -r requirements_data_gen.txt

Tensorflow 2.0 should automatically start using the gpu if cuda and cudnn are installed. Here are some links that might help with troubleshooting: 1, 2

Note: If a TensorFlow operation has both CPU and GPU implementations, by default the GPU devices will be given priority when the operation is assigned to a device.

Getting the data

To get the preprocessed training set, and vocabulary from Google's bert-joint-baseline, run these commands

gsutil cp -R gs://bert-nq/bert-joint-baseline/nq-train.tfrecords-00000-of-00001 .
gsutil cp -R gs://bert-nq/bert-joint-baseline/vocab-nq.txt .

To get the dev (validation) data from Google's bert-joint-baseline, run this command

gsutil -m cp -R gs://natural_questions/v1.0/dev .

To generate the validation data record, run this command

python -m generate_validation \
--logtostderr \
--vocab_file=/path/to/vocab-nq.txt \
--output_dir=/path/to/output/directory/ \
--predict_file=path/to/validation/file/pattern

For example,

python -m generate_validation \
--logtostderr \
--vocab_file=./vocab-nq.txt \
--output_dir=./ \
--predict_file=./dev/nq-dev-??.jsonl.gz

Note: Check that your tf_record file is greater than 0 bytes to make sure that the correct dev file was found

Training

To train the model, run this command

pip install -r requirements_run.txt

then this

python run_distilbert.py \
--training_mode=True \
--train_file=/path/to/train-file \
--use_chkpt=False \
--checkpoint_path=/path/to/store/checkpoint/ \
--epochs= epochs \
--batch_size= batch size \
--init_learning_rate=initial learning rate \
--init_weight_decay_rate= initial weight decay rate \
--clipped=True \
--len_train=length of training dataset you want to use

For example,

python run_distilbert.py \
--training_mode=True \
--train_file=./nq-train.tfrecords-00000-of-00001 \
--use_chkpt=False \
--checkpoint_path=./checkpoints/ \
--epochs=2 \
--batch_size=2 \
--init_learning_rate=3e-5 \
--init_weight_decay_rate=0.01 \
--clipped=True \
--len_train=100000

Note: The command above will train on 100000 samples. To train on entire dataset, set --clipped=False

Note: To resolve any OOM or resource exhaustion errors try reducing batch-size

Validation

To generate the validation predictions in a predictions.json file, run this command

python run_distilbert.py \
--training_mode=False \
--val_file=/path/to/val-record \
--use_chkpt=True \
--checkpoint_path=/path/to/stored/checkpoint/ \
--pred_file=path/to/dev/json/file \
--json-output-path=/path/to/store/predictions.json \
--batch_size= batch size

For example,

python run_distilbert.py \
--training_mode=False \
--val_file=./eval.tf_record \
--checkpoint_path=./checkpoints/ \
--pred_file=./dev/nq-dev-??.jsonl.gz \
--json_output_path=./predictions.json \
--batch_size=2

Note: Pred-file is usually just the val file before it was converted into a tf_record.

Note: To resolve any OOM or resource exhaustion errors try reducing batch-size

Evaluation

For evaluation, first you will need to download the evaluation script from here. I have also included it in the git repo. Run it with this command:

python -m nq_eval --gold_path=/path/to/validation-jsonl.gz --predictions_path=/path/to/predictions.json --logtostderr

For example,

python -m nq_eval --gold_path=./dev/nq-dev-??.jsonl.gz --predictions_path=./predictions.json --logtostderr

If the model is fully trained, this should give a score similar to:

{"long-best-threshold-f1": 0.5803108808290156, "long-best-threshold-precision": 0.6222222222222222,
"long-best-threshold-recall": 0.5436893203883495, "long-best-threshold": 6.31158971786499,
"long-recall-at-precision>=0.5": 0.6504854368932039, "long-precision-at-precision>=0.5": 0.5037593984962406,
"long-recall-at-precision>=0.75": 0.34951456310679613, "long-precision-at-precision>=0.75": 0.75,
"long-recall-at-precision>=0.9": 0.009708737864077669, "long-precision-at-precision>=0.9": 1.0,
"short-best-threshold-f1": 0.4729729729729729, "short-best-threshold-precision": 0.4794520547945205,
"short-best-threshold-recall": 0.4666666666666667, "short-best-threshold": 6.9500908851623535,
"short-recall-at-precision>=0.5": 0.37333333333333335, "short-precision-at-precision>=0.5": 0.5185185185185185,
"short-recall-at-precision>=0.75": 0, "short-precision-at-precision>=0.75": 0, "short-recall-at-precision>=0.9": 0,
"short-precision-at-precision>=0.9": 0}

Testing

This process will be the same as validation. If you have 2 files, one with annotations and one without, pass the one with annotations to nq_eval program and the one without as the pred-file to the generate_validations program.

Model Description and Architectural Decisions

  • Literature Review: Before I get into model description, here are the papers I referenced to make my architectural decisions:
  • Approach: After the literature review, my first step was to set up the skeleton of the pipeline. I wrote and revised the code to train the model, generate the validation dataset, and then generate the predictions.json file for evaluation. For generating predictions, as well as generating the validation record file, I modified the code presented in the Bert-Baseline repo. Once this setup was established, I went deeper into the model, optimizers and loss functions to find the optimal set up. Based on the Fine-tuning paper mentioned above, I started multiple processes, on small parts of the dataset, and continued with only those that showed promising results. Then, I did an ablation study by starting with the best suggested optimizer using weight decay and a scheduler and then removed them one by one to observe the impact it made. This helped me find the optimal optimizer configuration. I also experimented with different loss functions and have presented my results in the excel sheet referenced below in the hyperparameter tuning section. To minimize expenditure, I used Google colab for the most part, and paperspace only at the very end.
  • Data: I have used the preprocessed training dataset provided in the bert-joint-baseline model. I have also written a script to generate the validation set in a similar fashion. Not only does the smaller size make the data easier to deal with, but also it evens out the number of instances with NULL values, as well as adds the special tokens for where the answers are most often found. This increases accuracy. For more information, please refer to the bert-baseline paper cited above. I have used the tiny-dev dataset provided by Google as the validation dataset and am referring to the dev set by Google as the test set.
  • Model: For this task, I have used the distilBert transformers model by HuggingFace. As per folk-lore, BERT-based models has been providing the best results. We can observe this if we look at the leaderboard as well. While I would have loved to use (or atleast experiment with) a larger BERT model, due to resource constraints, I have used the DISTILBERT model made by huggingface that is shown to have similar results, but is much lighter and faster. I started with the 'bert-fine-tuned-on-squad' model, but switched to distilbert version for faster, yet similar results. For more information, please refer to the DistilBert paper cited above.
  • Optimizer: For the optimizer, I tried 3 options, Adam, AdamW with custom scheduler, and finally LAMB. LAMB has been shown to provide optimal results with BERT, and my model seemed to perform the best with it as well. For more information, please refer to the LAMB paper sited above.
  • Hyperparameter Tuning: Given the resource constraint, I had to be selective with my hyperparameter tuning. I am attaching an excel file here which represents my process of hyperparameter tuning, with results. With more time (or with better hardware), I would love to run Bayesian Optimisation or random search on the parameters to improve performance. Note: I am still trying some hyperparameter combinations, but submitted early as I don't see any significant change coming. In the case where there is, I will update the excel sheet.

Potential improvements to performance with time

  • I would love to go deeper into deep learning techniques, including gradient accumulation, and other optimizations functions. I wold try to tweak these methods to perform best with our dataset.
  • I would try out different architectures on top of distilbert and other transformer models, especially RoBERTa and BERT large, since with this much data I would suspect larger models would give better results.
  • I would like to perform an ablation study on multiple hyperparameter settings and optimizer configurations to observe their effect on f1-score.
  • I would try visualising accuracy, loss, error rates and convergence for all combinations to look for patterns and actionable insights.
  • I would try to minimize re-allocations in my code to speed up operation
  • I would learn and experiment with distributed training techniques.

Potential improvements to performance with hardware

  • Gradient Accumulation. I tried doing it with my current code but couldn't get around the resource exhaustion(OOM) error. Additionally, it makes more sense to use gradient accumulation with multiple GPU's.
  • With better hardware, I would have more time, allowing me to try out different combinations of hyperparameters and transformers models.
  • I would love to try different pre-processing techniques, especially methods that could make better use of the abundant data
  • I would use Random Search/Bayesian Optimization (or something more suitable if that exists) for hyperparameter tuning on the model
  • I would use techniques like cross validation to check for overfitting
  • I would try an ensemble-based approach

About

Question answering on the Google Natural Questions data corpus using HuggingFace's Transformers library

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published