MYCROFT: Towards Effective and Efficient External Data Augmentation
Not on the map. Why?
Abstract (arXiv)
Machine learning (ML) models often require large amounts of data to perform well. When the available data is limited, model trainers may need to acquire more data from external sources. Often, useful data is held by private entities who are hesitant to share their data due to propriety and privacy concerns. This makes it challenging and expensive for model trainers to acquire the data they need to improve model performance. To address this challenge, we propose Mycroft, a data-efficient method that enables model trainers to evaluate the relative utility of different data sources while working with a constrained data-sharing budget. By leveraging feature space distances and gradient matching, Mycroft identifies small but informative data subsets from each owner, allowing model trainers to maximize performance with minimal data exposure. Experimental results across four tasks in two domains show that Mycroft converges rapidly to the performance of the full-information baseline, where all data is shared. Moreover, Mycroft is robust to noise and can effectively rank data owners by utility. Mycroft can pave the way for democratized training of high performance ML models.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 31 of its 56 references that are in the map. First posted on arXiv 11 Oct 2024.
Builds on
31 of 56 references.
References · 31
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
- 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,442
- 2019Advances and Open Problems in Federated Learningcited by 3,046
- 2017Random Erasing Data Augmentationcited by 1,239
- 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 678
- 2018Learning to Reweight Examples for Robust Deep Learningcited by 675
- 2016Hollywood in Homes: Crowdsourcing Data Collection for Activity Understandingcited by 537
- 2021A Survey of Data Augmentation Approaches for NLPcited by 409
- 2019Selection via Proxy: Efficient Data Selection for Deep Learningcited by 339
- 2021GRAD-MATCH: Gradient Matching based Data Subset Selection for Efficient Deep Model Trainingcited by 274
- 2020GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learningcited by 226
19 more
- 2018Adversarial Active Learning for Deep Networks: a Margin Based Approachcited by 158
- 2022DeepCore: A Comprehensive Library for Coreset Selection in Deep Learningcited by 147
- 2019Generative Teaching Networks: Accelerating Neural Architecture Search by Learning to Generate Synthetic Training Datacited by 104
- 2018Data Augmentation by Pairing Samples for Images Classificationcited by 96
- 2021RETRIEVE: Coreset Selection for Efficient and Robust Semi-Supervised Learningcited by 74
- 2016Restricted Strong Convexity Implies Weak Submodularitycited by 52
- 2019Learning to Generate Synthetic Data via Compositingcited by 52
- 2023Unicom: Universal and Compact Representation Learning for Image Retrievalcited by 36
- 2022In Defense of Core-set: A Density-aware Core-set Selection for Active Learningcited by 27
- 2023Probabilistic Bilevel Coreset Selectioncited by 27
- 2023NetDiffusion: Network Data Augmentation Through Protocol-Constrained Traffic Generationcited by 27
- 2016LSH Ensemble: Internet-Scale Domain Searchcited by 24
- 2023Internet Explorer: Targeted Representation Learning on the Open Webcited by 21
- 2021Auctus: A Dataset Search Engine for Data Augmentationcited by 16
- 2023Performance Scaling via Optimal Transport: Enabling Data Selection from Partially Revealed Sourcescited by 16
- 2020Robust Variational Autoencoder for Tabular Data with Beta Divergencecited by 13
- 2024Efficient Data Subset Selection to Generalize Training Across Models: Transductive and Inductive Networkscited by 13
- 2021LEAF: Navigating Concept Drift in Cellular Networkscited by 9
- 2021Correlation Sketches for Approximate Join-Correlation Queriescited by 8
Built on by
Citing papers per year: 2025: 1.
1 paper.