mlsanityData to 14 Oct 2026

Submodular Mutual Information for Targeted Data Subset Selection

arXiv 2105.00043 ↗First posted 30 Apr 2021cs.LG cs.CVcited by 8

Not on the map. Why?

Abstract (arXiv)

With the rapid growth of data, it is becoming increasingly difficult to train or improve deep learning models with the right subset of data. We show that this problem can be effectively solved at an additional labeling cost by targeted data subset selection(TSS) where a subset of unlabeled data points similar to an auxiliary set are added to the training data. We do so by using a rich class of Submodular Mutual Information (SMI) functions and demonstrate its effectiveness for image classification on CIFAR-10 and MNIST datasets. Lastly, we compare the performance of SMI functions for TSS with other state-of-the-art methods for closely related problems like active learning. Using SMI functions, we observe ~20-30% gain over the model's performance before re-training with added targeted subset; ~12% more than other methods.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 7 of its 17 references that are in the map. First posted on arXiv 30 Apr 2021.

Builds on

7 of 17 references.

References · 7

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2019Deep Batch Active Learning by Diverse, Uncertain Gradient Lower Boundscited by 610
  3. 2020GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learningcited by 226
  4. 2020Submodular Combinatorial Information Measures with Applications in Machine Learningcited by 88
  5. 2019Learning From Less Data: A Unified Data Subset Selection and Active Learning Framework for Computer Visioncited by 64
  6. 2017Query-adaptive Video Summarization via Quality-aware Relevance Estimationcited by 22
  7. 2020A Unified Framework for Generic, Query-Focused, Privacy Preserving and Update Summarization using Submodular Information Measurescited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 3; 2024: 0; 2025: 4; 2026: 1.

8 papers.