Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Нейронний пошук архітектур× | Випадковий ліс× | |
|---|---|---|
| Галузь≠ | Глибоке навчання | Машинне навчання |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 2017 | 2001 |
| Автор методу≠ | Zoph, B. & Le, Q.V. | Breiman, L. |
| Тип≠ | Automated architecture optimization (deep learning) | Ensemble (bagging of decision trees) |
| Основоположне джерело≠ | Zoph, B. & Le, Q.V. (2017). Neural Architecture Search with Reinforcement Learning. ICLR. link ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Інші назви | Nöral Mimari Arama (NAS), NAS, automated architecture design, differentiable architecture search | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Пов'язані≠ | 5 | 4 |
| Підсумок≠ | Neural Architecture Search (NAS), introduced by Zoph and Le in 2017, automatically optimizes architectural decisions such as a network's depth, width, and connection structure instead of hand-designing them. Leading methods in the field include DARTS, ENAS, and Once-for-All. | 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. |
| ScholarGateНабір даних ↗ |
|
|