Noisy Batch Active Learning with Deterministic Annealing
We study the problem of training machine learning models incrementally with batches of samples annotated with noisy oracles. We select each batch of samples that are important and also diverse via clustering and importance sampling. More importantly, we incorporate model uncertainty into the sampling probability to compensate for poor estimation of the importance scores when the training data is too small to build a meaningful model. Experiments on benchmark image classification datasets (MNIST, SVHN, CIFAR10, and EMNIST) show improvement over existing active learning strategies. We introduce an extra denoising layer to deep networks to make active learning robust to label noises and show significant improvements.
Code (1)
Tasks
Active LearningClusteringDenoisingimage-classificationImage ClassificationSimilar Papers 제목 키워드 기반
Stochastic Annealing for Variational Inference
We empirically evaluate a stochastic annealing strategy for Bayesian posterior optimization with variational inference. Variational inference is a deterministic approach to approximate posterior inference in Bayesian mod…
Variational InferenceScalable Batch-Mode Deep Bayesian Active Learning via Equivalence Class Annealing
Active learning has demonstrated data efficiency in many fields. Existing active learning algorithms, especially in the context of batch-mode deep Bayesian active models, rely heavily on the quality of uncertainty estima…
Active LearningDiversityMulti-class ClassificationLearning in Confusion: Batch Active Learning with Noisy Oracle
We study the problem of training machine learning models incrementally using active learning with access to imperfect or noisy oracles. We specifically consider the setting of batch active learning, in which multiple sam…
Active LearningDenoisingimage-classificationImage ClassificationDeterministic Quantum Annealing Expectation-Maximization Algorithm
Maximum likelihood estimation (MLE) is one of the most important methods in machine learning, and the expectation-maximization (EM) algorithm is often used to obtain maximum likelihood estimates. However, EM heavily depe…
Stochastic Variational Inference with Tuneable Stochastic Annealing
In this paper, we exploit the observation that stochastic variational inference (SVI) is a form of annealing and present a modified SVI approach -- applicable to both large and small datasets -- that allows the amount of…
Variational Inference