Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Învățare Activă Robustă× | Mașină cu Vectori de Suport Robustă× | |
|---|---|---|
| Domeniu | Învățare automată | Învățare automată |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 2006 | 2006–2009 |
| Autorul original≠ | Balcan, M.-F.; Beygelzimer, A.; Langford, J. | Xu, H., Caramanis, C., & Mannor, S. |
| Tip≠ | Active learning with robustness guarantees | Robust supervised classifier / regressor |
| Sursa seminală≠ | 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 ↗ | Xu, H., Caramanis, C., & Mannor, S. (2009). Robustness and regularization of support vector machines. Journal of Machine Learning Research, 10, 1485–1510. link ↗ |
| Denumiri alternative | RAL, noise-tolerant active learning, robust query learning, adversarially robust active learning | Robust SVM, RSVM, noise-tolerant SVM, outlier-robust SVM |
| Înrudite≠ | 6 | 5 |
| Rezumat≠ | 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. | Robust SVM extends the standard support vector machine to resist the influence of outliers and mislabeled points. By replacing the hinge loss with a bounded or non-convex loss function — or by incorporating robust optimization constraints — it learns a decision boundary that is far less distorted by corrupted training examples, making it suitable for noisy real-world datasets where standard SVM would degrade significantly. |
| ScholarGateSet de date ↗ |
|
|