Sammenlign metoder
Gennemgå dine valgte metoder side om side; rækker, der afviger, er fremhævet.
| Robust Active Learning× | Online læring× | |
|---|---|---|
| Fagområde | Maskinlæring | Maskinlæring |
| Familie | Machine learning | Machine learning |
| Oprindelsesår≠ | 2006 | 1958–2000s |
| Ophavsperson≠ | Balcan, M.-F.; Beygelzimer, A.; Langford, J. | Rosenblatt, F.; Littlestone, N.; Shalev-Shwartz, S. (key contributors) |
| Type≠ | Active learning with robustness guarantees | Learning paradigm (sequential model update) |
| Oprindelig kilde≠ | 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 ↗ | Shalev-Shwartz, S. (2011). Online Learning and Online Convex Optimization. Foundations and Trends in Machine Learning, 4(2), 107–194. DOI ↗ |
| Aliasser | RAL, noise-tolerant active learning, robust query learning, adversarially robust active learning | incremental learning, sequential learning, streaming learning, online machine learning |
| Relaterede | 6 | 6 |
| Resumé≠ | 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. | Online learning is a machine learning paradigm in which a model is updated incrementally as each new data point arrives, rather than being trained once on a fixed dataset. It is essential when data streams continuously, storage is limited, or the underlying distribution shifts over time. Theoretical performance is measured by cumulative regret relative to the best fixed predictor in hindsight. |
| ScholarGateDatasæt ↗ |
|
|