Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Байєсівське активне навчання× | Активне навчання× | |
|---|---|---|
| Галузь | Машинне навчання | Машинне навчання |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 1992–2011 | 2009 |
| Автор методу≠ | MacKay, D.J.C.; Houlsby, N. et al. | Burr Settles |
| Тип≠ | Active learning with Bayesian uncertainty | Interactive supervised learning framework |
| Основоположне джерело≠ | Houlsby, N., Huszár, F., Ghahramani, Z., & Lengyel, M. (2011). Bayesian Active Learning for Classification and Preference Learning. arXiv preprint arXiv:1112.5745. link ↗ | Settles, B. (2009). Active learning literature survey. University of Wisconsin-Madison Computer Sciences Technical Report 1648. link ↗ |
| Інші назви | BAL, Bayesian optimal experimental design for ML, BALD (Bayesian Active Learning by Disagreement), probabilistic active learning | Query Learning, Optimal Experimental Design (ML context), Pool-Based Active Learning, Aktif Öğrenme |
| Пов'язані≠ | 6 | 2 |
| Підсумок≠ | Bayesian Active Learning (BAL) combines a probabilistic model with an active query strategy to identify the unlabeled examples that, once labeled, would most reduce model uncertainty. Instead of labeling data at random, BAL guides an oracle — typically a human annotator — toward the points where labeling will provide the greatest information gain, making it highly label-efficient. | Active learning is an iterative machine-learning paradigm in which a learning algorithm selectively queries an oracle — typically a human annotator — for labels on the most informative unlabeled examples. Formalized by Burr Settles in his seminal 2009 literature survey, active learning addresses the practical bottleneck of annotation cost by achieving high model accuracy with far fewer labeled examples than passive supervised learning requires. |
| ScholarGateНабір даних ↗ |
|
|