Porovnat metody
Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.
| Model sekvence-sekvence× | Dolaďování modelu BERT× | Random Forest× | |
|---|---|---|---|
| Obor≠ | Hluboké učení | Hluboké učení | Strojové učení |
| Rodina | Machine learning | Machine learning | Machine learning |
| Rok vzniku≠ | 2014 | 2019 | 2001 |
| Tvůrce≠ | Sutskever, I.; Cho, K. | Devlin, J. et al. | Breiman, L. |
| Typ≠ | Encoder-decoder neural network (deep learning) | Transfer learning (fine-tuning a pre-trained transformer) | Ensemble (bagging of decision trees) |
| Původní zdroj≠ | Sutskever, I., Vinyals, O. & Le, Q. V. (2014). Sequence to Sequence Learning with Neural Networks. NeurIPS. link ↗ | 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 ↗ |
| Další názvy | Dizi-Dizi Modeli (Seq2Seq — Encoder-Decoder), encoder-decoder model, seq2seq, sequence to sequence learning | 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 |
| Příbuzné≠ | 5 | 5 | 4 |
| Shrnutí≠ | The sequence-to-sequence (Seq2Seq) model, introduced by Sutskever, Vinyals and Le and by Cho and colleagues in 2014, is an encoder-decoder neural network that maps a variable-length input sequence to a variable-length output sequence. It is the foundation of machine translation, text summarization, dialogue systems and code generation. | 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. |
| ScholarGateDatová sada ↗ |
|
|
|