pith. sign in

arxiv: 1802.09841 · v1 · pith:VR3BKATRnew · submitted 2018-02-27 · 💻 cs.LG · cs.CV· stat.ML

Adversarial Active Learning for Deep Networks: a Margin Based Approach

classification 💻 cs.LG cs.CVstat.ML
keywords activelearningadversarialdecisiondeepexamplesnetworksboundaries
0
0 comments X
read the original abstract

We propose a new active learning strategy designed for deep neural networks. The goal is to minimize the number of data annotation queried from an oracle during training. Previous active learning strategies scalable for deep networks were mostly based on uncertain sample selection. In this work, we focus on examples lying close to the decision boundary. Based on theoretical works on margin theory for active learning, we know that such examples may help to considerably decrease the number of annotations. While measuring the exact distance to the decision boundaries is intractable, we propose to rely on adversarial examples. We do not consider anymore them as a threat instead we exploit the information they provide on the distribution of the input space in order to approximate the distance to decision boundaries. We demonstrate empirically that adversarial active queries yield faster convergence of CNNs trained on MNIST, the Shoe-Bag and the Quick-Draw datasets.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Multimodal Distribution Matching for Vision-Language Dataset Distillation

    cs.CV 2026-05 unverdicted novelty 6.0

    MDM distills vision-language datasets via joint embedding clustering, weight-space model interpolation, and geometry-aware distribution matching on the unit hypersphere.

  2. ADAM: A Systematic Data Extraction Attack on Agent Memory via Adaptive Querying

    cs.CR 2026-04 unverdicted novelty 6.0

    ADAM extracts data from LLM agent memory with up to 100% attack success rate by estimating data distribution and selecting queries via entropy guidance.

  3. Discriminative Active Learning

    cs.LG 2019-07 unverdicted novelty 6.0

    DAL poses batch active learning as a binary classification task between labeled and unlabeled data to select informative examples for labeling.

  4. Revisiting Active Sequential Prediction-Powered Mean Estimation

    stat.ML 2026-04 unverdicted novelty 5.0

    Non-asymptotic analysis of prediction-powered mean estimation shows that no-regret learning for query probabilities converges to the maximum allowed constant value, independent of covariates.

  5. ALDEN: Boosting Private Data Extraction from Retrieval-Augmented Generation Systems via Active Learning and Distribution Estimation

    cs.IR 2026-04 unverdicted novelty 5.0

    ALDEN boosts private data extraction rates from RAG systems by combining active learning for query diversification with dynamic estimation of the underlying knowledge-base topic distribution.