Salīdzināt metodes
Apskatiet izvēlētās metodes blakus; rindas, kas atšķiras, ir izceltas.
| Robust Online Learning× | Tiešsaistes apguve× | |
|---|---|---|
| Nozare | Mašīnmācīšanās | Mašīnmācīšanās |
| Saime | Machine learning | Machine learning |
| Izcelsmes gads≠ | 2000s–2010s | 1958–2000s |
| Autors≠ | Hazan, E.; Shalev-Shwartz, S.; and others | Rosenblatt, F.; Littlestone, N.; Shalev-Shwartz, S. (key contributors) |
| Tips≠ | Algorithmic framework | Learning paradigm (sequential model update) |
| Pirmavots≠ | Hazan, E. (2016). Introduction to Online Convex Optimization. Foundations and Trends in Optimization, 2(3–4), 157–325. link ↗ | Shalev-Shwartz, S. (2011). Online Learning and Online Convex Optimization. Foundations and Trends in Machine Learning, 4(2), 107–194. DOI ↗ |
| Citi nosaukumi | ROL, robust incremental learning, adversarially robust online learning, robust sequential learning | incremental learning, sequential learning, streaming learning, online machine learning |
| Saistītās≠ | 5 | 6 |
| Kopsavilkums≠ | Robust Online Learning extends the online learning framework — where a model updates sequentially after each observation — by incorporating robustness mechanisms that guard against corrupted labels, adversarial examples, heavy-tailed noise, and concept drift. The result is a sequential learner that maintains bounded regret even when the data stream contains outliers or deliberate perturbations. | 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. |
| ScholarGateDatu kopa ↗ |
|
|