Comparer des méthodes
Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.
| Ajustement fin de BERT× | Forêt Aléatoire× | Auto-attention multi-têtes× | |
|---|---|---|---|
| Domaine≠ | Apprentissage profond | Apprentissage automatique | Apprentissage profond |
| Famille | Machine learning | Machine learning | Machine learning |
| Année d'origine≠ | 2019 | 2001 | 2017 |
| Auteur d'origine≠ | Devlin, J. et al. | Breiman, L. | Vaswani, A. et al. |
| Type≠ | Transfer learning (fine-tuning a pre-trained transformer) | Ensemble (bagging of decision trees) | Attention mechanism (Transformer core) |
| Source fondatrice≠ | Devlin, J., Chang, M.-W., Lee, K. & Toutanova, K. (2019). BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. NAACL. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ | Vaswani, A. et al. (2017). Attention Is All You Need. NeurIPS. link ↗ |
| Alias | BERT İnce Ayar (Fine-Tuning), BERT ince ayar, fine-tuning BERT, transfer learning with BERT | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble | Öz-Dikkat ve Çok Başlı Dikkat (Multi-Head Self-Attention), öz-dikkat, multi-head attention, scaled dot-product attention |
| Apparentées≠ | 5 | 4 | 5 |
| Résumé≠ | BERT fine-tuning, building on the BERT model introduced by Devlin and colleagues in 2019, re-trains a pre-trained BERT model on a small labelled dataset for a target task such as classification, named-entity recognition, or question answering. Through transfer learning it reaches high performance even with relatively little task-specific data. | Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree. | Multi-head self-attention, introduced by Vaswani and colleagues in 2017, is the mechanism that lets every position in a sequence compute its relationship to all other positions in parallel. It is the core of the Transformer architecture and the foundation underneath BERT, GPT, and T5. |
| ScholarGateJeu de données ↗ |
|
|
|