Porovnať metódy
Prezrite si vybrané metódy vedľa seba; riadky, ktoré sa líšia, sú zvýraznené.
| Dolaďovanie GPT× | Náhodný les× | |
|---|---|---|
| Odbor≠ | Hlboké učenie | Strojové učenie |
| Rodina | Machine learning | Machine learning |
| Rok vzniku≠ | 2019 | 2001 |
| Tvorca≠ | Radford, A. et al. (OpenAI) | Breiman, L. |
| Typ≠ | Fine-tuning of pretrained autoregressive language models | Ensemble (bagging of decision trees) |
| Pôvodný zdroj≠ | Radford, A., Wu, J., Child, R., Luan, D., Amodei, D. & Sutskever, I. (2019). Language Models are Unsupervised Multitask Learners. OpenAI Technical Report. link ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Ďalšie názvy | GPT İnce Ayar ve Talimat Uyarlaması, GPT fine-tuning, instruction tuning, LLM fine-tuning | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Príbuzné≠ | 5 | 4 |
| Zhrnutie≠ | GPT fine-tuning adapts pretrained autoregressive language models such as GPT-2/3/4 or LLaMA — introduced in OpenAI's 2019 work by Radford and colleagues — to domain-specific data or to instruction following via reinforcement learning from human feedback (RLHF) or DPO. It is used for instruction following, domain adaptation, and generative tasks. | 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. |
| ScholarGateDátová sada ↗ |
|
|