mlsanityData to 7 Oct 2026

Multi-Level Fine-Tuning, Data Augmentation, and Few-Shot Learning for Specialized Cyber Threat Intelligence

arXiv 2207.11076 ↗First posted 22 Jul 2022cs.CR cs.CLcited by 3

Not on the map. Why?

Abstract (arXiv)

Gathering cyber threat intelligence from open sources is becoming increasingly important for maintaining and achieving a high level of security as systems become larger and more complex. However, these open sources are often subject to information overload. It is therefore useful to apply machine learning models that condense the amount of information to what is necessary. Yet, previous studies and applications have shown that existing classifiers are not able to extract specific information about emerging cybersecurity events due to their low generalization ability. Therefore, we propose a system to overcome this problem by training a new classifier for each new incident. Since this requires a lot of labelled data using standard training methods, we combine three different low-data regime techniques - transfer learning, data augmentation, and few-shot learning - to train a high-quality classifier from very few labelled instances. We evaluated our approach using a novel dataset derived from the Microsoft Exchange Server data breach of 2021 which was labelled by three experts. Our findings reveal an increase in F1 score of more than 21 points compared to standard training methods and more than 18 points compared to a state-of-the-art method in few-shot learning. Furthermore, the classifier trained with this method and 32 instances is only less than 5 F1 score points worse than a classifier trained with 1800 instances.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 23 of its 44 references that are in the map. First posted on arXiv 22 Jul 2022.

Builds on

23 of 44 references.

References · 23

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2020Language Models are Few-Shot Learnerscited by 32,199
  3. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  4. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
  5. 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,772
  6. 2019BioBERT: a pre-trained biomedical language representation model for biomedical text miningcited by 1,935
  7. 2019SciBERT: A Pretrained Language Model for Scientific Textcited by 1,404
  8. 2020Making Pre-trained Language Models Better Few-shot Learnerscited by 1,255
  9. 2020Exploiting Cloze Questions for Few Shot Text Classification and Natural Language Inferencecited by 934
  10. 2022GPT-NeoX-20B: An Open-Source Autoregressive Language Modelcited by 711
  11. 2019CamemBERT: a Tasty French Language Modelcited by 368
  12. 2017Synthetic and Natural Noise Both Break Neural Machine Translationcited by 304
11 more
  1. 2019SMART: Robust and Efficient Fine-Tuning for Pre-trained Natural Language Models through Principled Regularized Optimizationcited by 253
  2. 2021GPT3Mix: Leveraging Large-scale Language Models for Text Augmentationcited by 185
  3. 2019Not Enough Data? Deep Learning to the Rescue!cited by 174
  4. 2021A Survey on Data Augmentation for Text Classificationcited by 111
  5. 2021Improving and Simplifying Pattern Exploiting Trainingcited by 97
  6. 2021FLEX: Unifying Evaluation for Few-Shot NLPcited by 67
  7. 2020Improving Zero and Few-Shot Abstractive Summarization with Intermediate Fine-tuning and Data Augmentationcited by 53
  8. 2020How Effective is Task-Agnostic Data Augmentation for Pretrained Transformers?cited by 41
  9. 2022PERFECT: Prompt-free and Efficient Few-shot Learning with Language Modelscited by 40
  10. 2021Data Augmentation in Natural Language Processing: A Novel Text Generation Approach for Long and Short Text Classifierscited by 24
  11. 2020Mixup-Transformer: Dynamic Data Augmentation for NLP Taskscited by 15

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 0; 2024: 1; 2025: 0; 2026: 1.

3 papers.