Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Amestec de Experți× | Pădurea Aleatoare (Random Forest)× | XGBoost× | |
|---|---|---|---|
| Domeniu≠ | Învățare profundă | Învățare automată | Învățare automată |
| Familie | Machine learning | Machine learning | Machine learning |
| Anul apariției≠ | 2017 | 2001 | 2016 |
| Autorul original≠ | Shazeer, N. et al. | Breiman, L. | Chen, T. & Guestrin, C. |
| Tip≠ | Sparse neural network architecture (conditional computation) | Ensemble (bagging of decision trees) | Ensemble (gradient-boosted decision trees) |
| Sursa seminală≠ | Shazeer, N. et al. (2017). Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer. ICLR. arXiv:1701.06538 link ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ | Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗ |
| Denumiri alternative≠ | Uzman Karışımı (Mixture of Experts — MoE), uzman karışımı, MoE, sparse mixture of experts | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble | XGBoost, extreme gradient boosting, scalable tree boosting |
| Înrudite≠ | 3 | 4 | 5 |
| Rezumat≠ | Mixture of Experts (MoE) is a sparse neural-network architecture, introduced by Shazeer and colleagues in 2017 with the sparsely-gated MoE layer, in which only a subset of expert sub-networks is activated for each input. As seen in models such as Switch Transformer and Mixtral, it holds computation cost fixed even as the total parameter count grows. | 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. | XGBoost (Extreme Gradient Boosting) is a scalable tree-boosting algorithm introduced by Tianqi Chen and Carlos Guestrin in 2016. It builds a strong predictor by adding decision trees one at a time, each correcting the errors left by the trees before it, and is a powerful prediction method widely used in competitions. |
| ScholarGateSet de date ↗ |
|
|
|