方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 鲁棒主动学习× | 在线学习× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2006 | 1958–2000s |
| 提出者≠ | Balcan, M.-F.; Beygelzimer, A.; Langford, J. | Rosenblatt, F.; Littlestone, N.; Shalev-Shwartz, S. (key contributors) |
| 类型≠ | Active learning with robustness guarantees | Learning paradigm (sequential model update) |
| 开创性文献≠ | 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 ↗ |
| 别名 | RAL, noise-tolerant active learning, robust query learning, adversarially robust active learning | incremental learning, sequential learning, streaming learning, online machine learning |
| 相关 | 6 | 6 |
| 摘要≠ | 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. |
| ScholarGate数据集 ↗ |
|
|