ScholarGate
Assistent
Machine learningMachine learning

Robust Active Learning

Robust Active Learning udvider det standardmæssige active learning-framework til at håndtere støjende labels, adversariale perturbationer og upålidelige elleracles. I stedet for at antage perfekt annotering, inkorporerer det statistiske eller adversariale robusthedsgarantier i udvælgelsesprocessen for forespørgsler, hvilket bevarer sampleffektivitet, mens det tolererer korruption i annoteringsprocessen.

Åbn i MethodMindSnartVideoSnartDownload slides

Læs hele metoden

Kun for medlemmer

Log ind med en gratis konto for at læse dette afsnit.

Log ind

Method map

The neighbourhood of related methods — select a node to explore.

Kilder

  1. 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: 10.1145/1143844.1143853
  2. Settles, B. (2009). Active Learning Literature Survey. Computer Sciences Technical Report 1648, University of Wisconsin–Madison. link

Sådan citerer du denne side

ScholarGate. (2026, June 3). Robust Active Learning (Noise-Tolerant Query-Based Learning). ScholarGate. https://scholargate.app/da/machine-learning/robust-active-learning

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

Compare side by side
ScholarGateRobust Active Learning (Robust Active Learning (Noise-Tolerant Query-Based Learning)). Hentet 2026-06-15 fra https://scholargate.app/da/machine-learning/robust-active-learning · Datasæt: https://doi.org/10.5281/zenodo.20539026