Diffusion-based Deep Active Learning
Not on the map. Why?
Abstract (arXiv)
The remarkable performance of deep neural networks depends on the availability of massive labeled data. To alleviate the load of data annotation, active deep learning aims to select a minimal set of training points to be labelled which yields maximal model accuracy. Most existing approaches implement either an `exploration'-type selection criterion, which aims at exploring the joint distribution of data and labels, or a `refinement'-type criterion which aims at localizing the detected decision boundaries. We propose a versatile and efficient criterion that automatically switches from exploration to refinement when the distribution has been sufficiently mapped. Our criterion relies on a process of diffusing the existing label information over a graph constructed from the hidden representation of the data set as provided by the neural network. This graph representation captures the intrinsic geometry of the approximated labeling function. The diffusion-based criterion is shown to be advantageous as it outperforms existing criteria for deep active learning.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 23 Mar 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 2; 2023: 1; 2024: 1; 2025: 0; 2026: 2.
10 papers.
- 2022GALAXY: Graph-based Active Learning at the Extremecited by 29
- 2021Model-Change Active Learning in Graph-Based Semi-Supervised Learningcited by 8
- 2022Poisson Reweighted Laplacian Uncertainty Sampling for Graph-based Active Learningcited by 6
- 2021Diffusion Mechanism in Residual Neural Network: Theory and Applicationscited by 5
- 2021Maximizing and Satisficing in Multi-armed Bandits with Graph Informationcited by 5
- 2023Novel Batch Active Learning Approach and Its Application to Synthetic Aperture Radar Datasetscited by 4
- 2024MALADY: Multiclass Active Learning with Auction Dynamics on Graphscited by 1
- 2021An efficient scheme based on graph centrality to select nodes for training for effective learningcited by 0
- 2026Hard to See, Hard to Label: Generative and Symbolic Acquisition for Subtle Visual Phenomenacited by 0
- 2026An Approximation Algorithm for Graph Label Selectioncited by 0
- 2026An Approximation Algorithm for Graph Label Selection18 May 2026
- 2026Hard to See, Hard to Label: Generative and Symbolic Acquisition for Subtle Visual Phenomena24 Apr 2026
- 2024MALADY: Multiclass Active Learning with Auction Dynamics on Graphs14 Sep 2024
- 2023Novel Batch Active Learning Approach and Its Application to Synthetic Aperture Radar Datasets19 Jul 2023
- 2022Poisson Reweighted Laplacian Uncertainty Sampling for Graph-based Active Learning27 Oct 2022
- 2022GALAXY: Graph-based Active Learning at the Extreme3 Feb 2022
- 2021Model-Change Active Learning in Graph-Based Semi-Supervised Learning14 Oct 2021
- 2021Maximizing and Satisficing in Multi-armed Bandits with Graph Information2 Aug 2021
- 2021Diffusion Mechanism in Residual Neural Network: Theory and Applications7 May 2021
- 2021An efficient scheme based on graph centrality to select nodes for training for effective learning29 Apr 2021