방법 비교

	다중 헤드 셀프 어텐션	GPT 파인튜닝	랜덤 포레스트
분야	딥러닝	딥러닝	머신러닝
계열	Machine learning	Machine learning	Machine learning
기원 연도	2017	2019	2001
창시자	Vaswani, A. et al.	Radford, A. et al. (OpenAI)	Breiman, L.
유형	Attention mechanism (Transformer core)	Fine-tuning of pretrained autoregressive language models	Ensemble (bagging of decision trees)
원전	Vaswani, A. et al. (2017). Attention Is All You Need. NeurIPS.	Radford, A., Wu, J., Child, R., Luan, D., Amodei, D. & Sutskever, I. (2019). Language Models are Unsupervised Multitask Learners. OpenAI Technical Report.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
별칭	Öz-Dikkat ve Çok Başlı Dikkat (Multi-Head Self-Attention), öz-dikkat, multi-head attention, scaled dot-product attention	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
관련	5	5	4
요약	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.	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.