[1910.01108] DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter
Computer Science > Computation and Language
arXiv:1910.01108 (cs)
[Submitted on 2 Oct 2019 (v1), last revised 1 Mar 2020 (this version, v4)]
Title:DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter
Authors:Victor Sanh, Lysandre Debut, Julien Chaumond, Thomas Wolf
View a PDF of the paper titled DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter, by Victor Sanh and 3 other authors
Abstract:As Transfer Learning from large-scale pre-trained models becomes more prevalent in Natural Language Processing (NLP), operating these large models in on-the-edge and/or under constrained computational training or inference budgets remains challenging. In this work, we propose a method to pre-train a smaller general-purpose language representation model, called DistilBERT, which can then be fine-tuned with good performances on a wide range of tasks like its larger counterparts. While most prior work investigated the use of distillation for building task-specific models, we leverage knowledge distillation during the pre-training phase and show that it is possible to reduce the size of a BERT model by 40%, while retaining 97% of its language understanding capabilities and being 60% faster. To leverage the inductive biases learned by larger models during pre-training, we introduce a triple loss combining language modeling, distillation and cosine-distance losses. Our smaller, faster and lighter model is cheaper to pre-train and we demonstrate its capabilities for on-device computations in a proof-of-concept experiment and a comparative on-device study.
Comments: | February 2020 - Revision: fix bug in evaluation metrics, updated metrics, argumentation unchanged. 5 pages, 1 figure, 4 tables. Accepted at the 5th Workshop on Energy Efficient Machine Learning and Cognitive Computing - NeurIPS 2019
Subjects: | Computation and Language (cs.CL) Cite as: | arXiv:1910.01108 [cs.CL] (or arXiv:1910.01108v4 [cs.CL] for this version) https://doi.org/10.48550/arXiv.1910.01108 Focus to learn more arXiv-issued DOI via DataCite
Submission history
From: Victor Sanh [view email] [v1] Wed, 2 Oct 2019 17:56:28 UTC (275 KB) [v2] Wed, 16 Oct 2019 14:52:02 UTC (275 KB) [v3] Fri, 24 Jan 2020 16:58:52 UTC (276 KB) [v4] Sun, 1 Mar 2020 02:57:50 UTC (276 KB)
Full-text links:
Access Paper:
View a PDF of the paper titled DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter, by Victor Sanh and 3 other authors
Current browse context:
cs.CL
Change to browse by:
References & Citations
13 blog links
DBLP - CS Bibliography
Victor Sanh Julien Chaumond Thomas Wolf
export BibTeX citation Loading...
BibTeX formatted citation
×
loading...
Data provided by:
Bookmark
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media
Code, Data and Media Associated with this Article
alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
Links to Code Toggle
Papers with Code (What is Papers with Code?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos
Demos
Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers
Recommenders and Search Tools
Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
About arXivLabs
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)