Elamur Research⌕
☰
home / papers / 2024 / GPT系列大语言模型在自然语言处理任务中的鲁棒性

GPT系列大语言模型在自然语言处理任务中的鲁棒性

Summary

Large language models perform well on standard benchmarks, but it is less clear how they cope with realistic noise and perturbations in their input. The authors examine this for OpenAI's GPT-3 and GPT-3.5 families: code-davinci-002, text-davinci-001/002/003 and gpt-3.5-turbo. They use 15 public datasets covering 9 NLP tasks, grouped into classification, reading comprehension and information extraction. The test material totals roughly 147,000 original samples.

Each input is altered with 61 linguistically motivated TextFlint transformations at the character, word and sentence levels. Models are prompted zero-shot and few-shot with three prompt templates per task. Fine-tuned BERT serves as the reference.

The GPT models reach BERT-like accuracy on sentiment, semantic matching and reading comprehension. They are weak at NER and relation extraction, where they sometimes invent labels. Robustness is low overall, especially for classification and sentence-level changes. Newer model versions and more demonstrations raise accuracy but do not close the robustness gap.

Checks on an updated gpt-3.5-turbo, gpt-4, LLaMA2-7B and LLaMA2-13B support these conclusions. The study is useful to anyone relying on LLMs for extraction or for noisy real-world text.

Key points

  • Benchmark scope: 9 tasks and 15 datasets, including:
    • SemEval2014-Laptop/Restaurant, IMDB, MNLI-m/mm, SNLI, QQP, MRPC and WSC273;
    • SQuAD 1.1/2.0;
    • WSJ (Penn Treebank POS), CoNLL2003, OntoNotesv5 and TACRED.
  • Perturbations: 61 TextFlint transformations. The baseline is supervised BERT (BERT-base-uncased; BERT-Large-ITPT for IMDB; BERT-BiLSTM-CRF for WSJ).
  • Zero-shot results: gpt-3.5-turbo and text-davinci-003 match or exceed BERT on some datasets, for example SemEval2014-Restaurant and WSC273.
  • Error analysis:
    • On CoNLL2003, most NER errors involve confusing entities with the "O" tag.
    • On TACRED, "no relation" cases are often given specific relations, and fabricated relation types appear.
    • On binary IMDB, the models produce an unrequested "neutral" label.
  • Model iterations and prompting: across versions, accuracy improves steadily, but robustness gains appear only for sentiment analysis. Changing demonstration content helps somewhat but does not resolve the underlying problem.

Our summary of the paper, in our own words — not its text. The work belongs to its authors; read it at the links above.

Fields: Linguistics & languages · Natural language processing

Cite

The paper itself, not this page. BibTeX from the library's record of the work. DOI 10.7544/issn1000-1239.202330801

@article{2024,
  title = {{GPT系列大语言模型在自然语言处理任务中的鲁棒性}},
  author = {陈炫婷 and 叶俊杰 and 祖璨 and 许诺 and 桂韬 and 张奇},
  journal = {计算机研究与发展 (Journal of Computer Research and Development)},
  year = {2024},
  doi = {10.7544/issn1000-1239.202330801},
  url = {https://doi.org/10.7544/issn1000-1239.202330801}
}

References

5 references, 1 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet.

  1. shot learners[J]. arXiv preprint, arXiv: 2109.01652, 2021 find
  2. [2] Brown T B, Mann B, Ryder N, et al. Language models are few-shot learners[C/OL]//Advances in Neural Information Processing Systems. [2023-09-10].https://proceedings.neurips.cc/paper/2020/hash/1457c0d6bfcb4967418bfb8ac142f64a-Abstract.html find
  3. [3] Touvron H, Lavril T, Izacard G, et al. LLaMA: Open and efficient foundation language models[J]. arXiv preprint, arXiv: 2302.13971, 2023 find
  4. [4] Anil R, Dai A M, Firat O, et al. PaLM 2 technical report[J]. arXiv preprint, arXiv: 2305.10403, 2023 find our card
  5. [5] Kaplan J, McCandlish S, Henighan T, et al. Scaling laws for neural language models[J]. arXiv preprint, arXiv: 2001.08361, 2020 find

This page in Markdown → https://md.research.elamur.ai/free/en/papers/chen-2024-robustness-gpt-large/