mlsanityData to 7 Oct 2026

Performance Scaling via Optimal Transport: Enabling Data Selection from Partially Revealed Sources

arXiv 2307.02460 ↗First posted 5 Jul 2023cs.LG cs.AI cs.CEcited by 16

Not on the map. Why?

Abstract (arXiv)

Traditionally, data selection has been studied in settings where all samples from prospective sources are fully revealed to a machine learning developer. However, in practical data exchange scenarios, data providers often reveal only a limited subset of samples before an acquisition decision is made. Recently, there have been efforts to fit scaling laws that predict model performance at any size and data source composition using the limited available samples. However, these scaling functions are black-box, computationally expensive to fit, highly susceptible to overfitting, or/and difficult to optimize for data selection. This paper proposes a framework called <projektor>, which predicts model performance and supports data selection decisions based on partial samples of prospective data sources. Our approach distinguishes itself from existing work by introducing a novel *two-stage* performance inference process. In the first stage, we leverage the Optimal Transport distance to predict the model's performance for any data mixture ratio within the range of disclosed data sizes. In the second stage, we extrapolate the performance to larger undisclosed data sizes based on a novel parameter-free mapping technique inspired by neural scaling laws. We further derive an efficient gradient-based method to select data sources based on the projected model performance. Evaluation over a diverse range of applications demonstrates that <projektor> significantly improves existing performance scaling approaches in terms of both the accuracy of performance inference and the computation costs associated with constructing the performance predictor. Also, <projektor> outperforms by a wide margin in data selection effectiveness compared to a range of other off-the-shelf solutions.

Key facts. Cited by 16 papers in the map (data through 7 Oct 2026). Builds on 35 of its 53 references that are in the map. First posted on arXiv 5 Jul 2023.

Builds on

35 of 53 references.

References · 35

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Microsoft COCO: Common Objects in Contextcited by 17,498
  3. 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,617
  4. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
  5. 2020Scaling Laws for Neural Language Modelscited by 6,411
  6. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  7. 2016Identity Mappings in Deep Residual Networkscited by 1,960
  8. 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
  9. 2018BDD100K: A Diverse Driving Dataset for Heterogeneous Multitask Learningcited by 1,282
  10. 2019Data Shapley: Equitable Valuation of Data for Machine Learningcited by 617
  11. 2020Estimating Training Data Influence by Tracing Gradient Descentcited by 565
  12. 2022Beyond neural scaling laws: beating power law scaling via data pruningcited by 519
23 more
  1. 2021Explaining Neural Scaling Lawscited by 353
  2. 2017Learning Generative Models with Sinkhorn Divergencescited by 310
  3. 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 280
  4. 2019Towards Efficient Data Valuation Based on the Shapley Valuecited by 279
  5. 2023TRAK: Attributing Model Behavior at Scalecited by 273
  6. 2018Sorting out Lipschitz function approximationcited by 211
  7. 2020Coresets via Bilevel Optimization for Continual Learning and Streamingcited by 191
  8. 2022Datamodels: Predicting Predictions from Training Datacited by 186
  9. 2019Deep learning with noisy labels: exploring techniques and remedies in medical image analysiscited by 173
  10. 2020Dataset Security for Machine Learning: Data Poisoning, Backdoor Attacks, and Defensescited by 171
  11. 2021Beta Shapley: a Unified and Noise-reduced Data Valuation Framework for Machine Learningcited by 162
  12. 2020Geometric Dataset Distances via Optimal Transportcited by 157
  13. 2019Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithmscited by 147
  14. 2022DeepCore: A Comprehensive Library for Coreset Selection in Deep Learningcited by 146
  15. 2022Revisiting Neural Scaling Laws in Language and Visioncited by 129
  16. 2018Improving GANs Using Optimal Transportcited by 122
  17. 2022Agreement-on-the-Line: Predicting the Performance of Neural Networks under Distribution Shiftcited by 94
  18. 2017Practical Coreset Constructions for Machine Learningcited by 75
  19. 2023LAVA: Data Valuation without Pre-Specified Learning Algorithmscited by 69
  20. 2022Efficiently Computing Local Lipschitz Constants of Neural Networks via Bound Propagationcited by 45
  21. 2022How Much More Data Do I Need? Estimating Requirements for Downstream Taskscited by 22
  22. 2019Universal Lipschitz Approximation in Bounded Depth Neural Networkscited by 11
  23. 2019Robust Coreset Construction for Distributed Machine Learningcited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 6; 2025: 4; 2026: 4.

16 papers.

Sort:

By area: