Võrdle meetodeid
Vaata valitud meetodeid kõrvuti; erinevad read on esile tõstetud.
| Robustne aktiivõpe× | Aktiivne õppimine× | |
|---|---|---|
| Valdkond | Masinõpe | Masinõpe |
| Perekond | Machine learning | Machine learning |
| Tekkeaasta≠ | 2006 | 2009 |
| Looja≠ | Balcan, M.-F.; Beygelzimer, A.; Langford, J. | Burr Settles |
| Tüüp≠ | Active learning with robustness guarantees | Interactive supervised learning framework |
| Algallikas≠ | Balcan, M.-F., Beygelzimer, A., & Langford, J. (2006). Agnostic active learning. In Proceedings of the 23rd International Conference on Machine Learning (ICML 2006), pp. 65–72. ACM. DOI ↗ | Settles, B. (2009). Active learning literature survey. University of Wisconsin-Madison Computer Sciences Technical Report 1648. link ↗ |
| Rööpnimetused | RAL, noise-tolerant active learning, robust query learning, adversarially robust active learning | Query Learning, Optimal Experimental Design (ML context), Pool-Based Active Learning, Aktif Öğrenme |
| Seotud≠ | 6 | 2 |
| Kokkuvõte≠ | Robust Active Learning extends the standard active learning framework to handle noisy labels, adversarial perturbations, and unreliable oracles. Rather than assuming perfect labeling, it incorporates statistical or adversarial robustness guarantees into the query selection process, maintaining sample efficiency while tolerating corruption in the annotation process. | 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. |
| ScholarGateAndmestik ↗ |
|
|