Minimum-Margin Active Learning
Not on the map. Why?
Abstract (arXiv)
We present a new active sampling method we call min-margin which trains multiple learners on bootstrap samples and then chooses the examples to label based on the candidates' minimum margin amongst the bootstrapped models. This extends standard margin sampling in a way that increases its diversity in a supervised manner as it arises from the model uncertainty. We focus on the one-shot batch active learning setting, and show theoretically and through extensive experiments on a broad set of problems that min-margin outperforms other methods, particularly as batch size grows.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 31 May 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 3; 2024: 1; 2025: 1.
6 papers.
- 2024Chain-of-Thought Reasoning Without Promptingcited by 208
- 2025PixelThink: Towards Efficient Chain-of-Pixel Reasoningcited by 28
- 2023Marich: A Query-efficient Distributionally Equivalent Model Extraction Attack using Public Datacited by 11
- 2022Poisson Reweighted Laplacian Uncertainty Sampling for Graph-based Active Learningcited by 6
- 2023RD-DPP: Rate-Distortion Theory Meets Determinantal Point Process to Diversify Learning Data Samplescited by 4
- 2023Combining Self-labeling with Selective Samplingcited by 1
- 2025PixelThink: Towards Efficient Chain-of-Pixel Reasoning29 May 2025
- 2024Chain-of-Thought Reasoning Without Prompting15 Feb 2024
- 2023RD-DPP: Rate-Distortion Theory Meets Determinantal Point Process to Diversify Learning Data Samples9 Apr 2023
- 2023Marich: A Query-efficient Distributionally Equivalent Model Extraction Attack using Public Data16 Feb 2023
- 2023Combining Self-labeling with Selective Sampling11 Jan 2023
- 2022Poisson Reweighted Laplacian Uncertainty Sampling for Graph-based Active Learning27 Oct 2022