Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Two Birds with One Stone: Efficient Deep Learning over Mislabeled Data through Subset Selection

Two Birds with One Stone: Efficient Deep Learning over Mislabeled Data through Subset Selection

Thumbnail Image
Download
Name

3728289.pdf

Size

3.85 MB

Format

Adobe PDF

Checksum (MD5)

4ebe0b0263e1a197d8676d9a23999635

Download all files submitted through automated deposit
3728289.zip (1.68 MB)
Author(s)
Deng, Yuhao
•
Chai, Chengliang
•
Jin, Kaisen
•
Zheng, Linan
•
Cao, Lei
•
Yuan, Ye
•
Wang, Guoren
Date Issued
June 18, 2025
Journal
Proceedings of the ACM on Management of Data
Publisher
Association for Computing Machinery
Citation
Yuhao Deng, Chengliang Chai, Kaisen Jin, Linan Zheng, Lei Cao, Ye Yuan, and Guoren Wang. 2025. Two Birds with One Stone: Efficient Deep Learning over Mislabeled Data through Subset Selection. Proc. ACM Manag. Data 3, 3, Article 231 (June 2025), 28 pages.
Version
Final published version
Abstract
Using a large training dataset to train a big and powerful model -- a typical practice in modern deep learning, often suffers from two major problems: the expensive and slow training process and the error-prone labels. The existing approaches, targeting either speeding up the training by selecting a subset of representative training instances (subset selection) or eliminating the negative effect of mislabels during training (mislabel detection), do not perform well in this scenario due to overlooking one of these two problems. To fill this gap, we propose Deem, a novel data-efficient framework that selects a subset of representative training instances under label uncertainty. The key idea is to leverage the metadata produced during deep learning training, e.g., training losses and gradients, to estimate the label uncertainty and select the representative instances. In particular, we model the problem of subset selection under uncertainty as a problem of finding a subset that closely approximates the gradient of the whole training data set derived on soft labels. We show that it is an NP-hard problem with submodular property and propose a low complexity algorithm to solve this problem with an approximate ratio. Training on this small subset thus improves the training efficiency while guaranteeing the model's accuracy. Moreover, we propose an efficient strategy to dynamically refine this subset during the iterative training process. Extensive experiments on 6 datasets and 10 baselines demonstrate that Deem accelerates the training process up to 10X without sacrificing the model accuracy.
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
https://doi.org/10.1145/3728289
https://dspace.mit.edu/handle/1721.1/171310
DOI of Published Version
https://doi.org/10.1145/3728289
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.