Performance Scaling via Optimal Transport: Enabling Data Selection from Partially Revealed Sources
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
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Microsoft COCO: Common Objects in Contextcited by 17,498
- 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,617
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2016Identity Mappings in Deep Residual Networkscited by 1,960
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
- 2018BDD100K: A Diverse Driving Dataset for Heterogeneous Multitask Learningcited by 1,282
- 2019Data Shapley: Equitable Valuation of Data for Machine Learningcited by 617
- 2020Estimating Training Data Influence by Tracing Gradient Descentcited by 565
- 2022Beyond neural scaling laws: beating power law scaling via data pruningcited by 519
23 more
- 2021Explaining Neural Scaling Lawscited by 353
- 2017Learning Generative Models with Sinkhorn Divergencescited by 310
- 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 280
- 2019Towards Efficient Data Valuation Based on the Shapley Valuecited by 279
- 2023TRAK: Attributing Model Behavior at Scalecited by 273
- 2018Sorting out Lipschitz function approximationcited by 211
- 2020Coresets via Bilevel Optimization for Continual Learning and Streamingcited by 191
- 2022Datamodels: Predicting Predictions from Training Datacited by 186
- 2019Deep learning with noisy labels: exploring techniques and remedies in medical image analysiscited by 173
- 2020Dataset Security for Machine Learning: Data Poisoning, Backdoor Attacks, and Defensescited by 171
- 2021Beta Shapley: a Unified and Noise-reduced Data Valuation Framework for Machine Learningcited by 162
- 2020Geometric Dataset Distances via Optimal Transportcited by 157
- 2019Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithmscited by 147
- 2022DeepCore: A Comprehensive Library for Coreset Selection in Deep Learningcited by 146
- 2022Revisiting Neural Scaling Laws in Language and Visioncited by 129
- 2018Improving GANs Using Optimal Transportcited by 122
- 2022Agreement-on-the-Line: Predicting the Performance of Neural Networks under Distribution Shiftcited by 94
- 2017Practical Coreset Constructions for Machine Learningcited by 75
- 2023LAVA: Data Valuation without Pre-Specified Learning Algorithmscited by 69
- 2022Efficiently Computing Local Lipschitz Constants of Neural Networks via Bound Propagationcited by 45
- 2022How Much More Data Do I Need? Estimating Requirements for Downstream Taskscited by 22
- 2019Universal Lipschitz Approximation in Bounded Depth Neural Networkscited by 11
- 2019Robust Coreset Construction for Distributed Machine Learningcited by 6
Built on by
Citing papers per year: 2023: 2; 2024: 6; 2025: 4; 2026: 4.
16 papers.
Sort:
By area:
- 2024Get more for less: Principled Data Selection for Warming Up Fine-Tuning in LLMscited by 32
- 2024Unleashing the Power of Data Tsunami: A Comprehensive Survey on Data Assessment and Selection for Instruction Tuning of Language Modelscited by 29
- 2024Scaling laws for learning with real and surrogate datacited by 26
- 2025Demystifying Synthetic Data in LLM Pre-training: A Systematic Study of Scaling Laws, Benefits, and Pitfallscited by 24
- 2023Data Valuation and Detections in Federated Learningcited by 17
- 2023Data Acquisition: A New Frontier in Data-centric AIcited by 9
- 2024TAROT: Targeted Data Selection via Optimal Transportcited by 9
- 2025AdaDeDup: Adaptive Hybrid Data Pruning for Efficient Large-Scale Object Detection Trainingcited by 3
- 2026A Sustainable AI Economy Needs Data Deals That Work for Generatorscited by 3
- 2026Can Generalist Agents Automate Data Curation?cited by 3
- 2024Fair Classification with Partial Feedback: An Exploration-Based Data Collection Approachcited by 2
- 2024MYCROFT: Towards Effective and Efficient External Data Augmentationcited by 1
4 more
- 2026SEED: Targeted Data Selection by Weighted Independent Setcited by 1
- 2025Sublinear Algorithms for Wasserstein and Total Variation Distances: Applications to Fairness and Privacy Auditingcited by 0
- 2025Data Valuation and Selection in a Federated Model Marketplacecited by 0
- 2026CRAFT: Clustered Regression for Adaptive Filtering of Training datacited by 0
- 2026Can Generalist Agents Automate Data Curation?2 Jun 2026
- 2026SEED: Targeted Data Selection by Weighted Independent Set15 May 2026
- 2026CRAFT: Clustered Regression for Adaptive Filtering of Training data24 Apr 2026
- 2026A Sustainable AI Economy Needs Data Deals That Work for Generators15 Jan 2026
- 2025Demystifying Synthetic Data in LLM Pre-training: A Systematic Study of Scaling Laws, Benefits, and Pitfalls2 Oct 2025
- 2025Data Valuation and Selection in a Federated Model Marketplace9 Sep 2025
- 2025AdaDeDup: Adaptive Hybrid Data Pruning for Efficient Large-Scale Object Detection Training24 Jun 2025
- 2025Sublinear Algorithms for Wasserstein and Total Variation Distances: Applications to Fairness and Privacy Auditing10 Mar 2025
- 2024TAROT: Targeted Data Selection via Optimal Transport30 Nov 2024
- 2024MYCROFT: Towards Effective and Efficient External Data Augmentation11 Oct 2024
- 2024Unleashing the Power of Data Tsunami: A Comprehensive Survey on Data Assessment and Selection for Instruction Tuning of Language Models4 Aug 2024
- 2024Get more for less: Principled Data Selection for Warming Up Fine-Tuning in LLMs5 May 2024
4 more
- 2024Fair Classification with Partial Feedback: An Exploration-Based Data Collection Approach17 Feb 2024
- 2024Scaling laws for learning with real and surrogate data6 Feb 2024
- 2023Data Acquisition: A New Frontier in Data-centric AI22 Nov 2023
- 2023Data Valuation and Detections in Federated Learning9 Nov 2023
- 2024Get more for less: Principled Data Selection for Warming Up Fine-Tuning in LLMscited by 32
- 2024Scaling laws for learning with real and surrogate datacited by 26
- 2023Data Valuation and Detections in Federated Learningcited by 17
- 2023Data Acquisition: A New Frontier in Data-centric AIcited by 9
- 2024TAROT: Targeted Data Selection via Optimal Transportcited by 9
- 2025AdaDeDup: Adaptive Hybrid Data Pruning for Efficient Large-Scale Object Detection Trainingcited by 3
- 2026A Sustainable AI Economy Needs Data Deals That Work for Generatorscited by 3
- 2026Can Generalist Agents Automate Data Curation?cited by 3
- 2024Fair Classification with Partial Feedback: An Exploration-Based Data Collection Approachcited by 2
- 2024MYCROFT: Towards Effective and Efficient External Data Augmentationcited by 1
- 2026SEED: Targeted Data Selection by Weighted Independent Setcited by 1
- 2025Sublinear Algorithms for Wasserstein and Total Variation Distances: Applications to Fairness and Privacy Auditingcited by 0
12 most cited of 14 All 14 (JSON)
- 2026Can Generalist Agents Automate Data Curation?2 Jun 2026
- 2026SEED: Targeted Data Selection by Weighted Independent Set15 May 2026
- 2026CRAFT: Clustered Regression for Adaptive Filtering of Training data24 Apr 2026
- 2026A Sustainable AI Economy Needs Data Deals That Work for Generators15 Jan 2026
- 2025Data Valuation and Selection in a Federated Model Marketplace9 Sep 2025
- 2025AdaDeDup: Adaptive Hybrid Data Pruning for Efficient Large-Scale Object Detection Training24 Jun 2025
- 2025Sublinear Algorithms for Wasserstein and Total Variation Distances: Applications to Fairness and Privacy Auditing10 Mar 2025
- 2024TAROT: Targeted Data Selection via Optimal Transport30 Nov 2024
- 2024MYCROFT: Towards Effective and Efficient External Data Augmentation11 Oct 2024
- 2024Get more for less: Principled Data Selection for Warming Up Fine-Tuning in LLMs5 May 2024
- 2024Fair Classification with Partial Feedback: An Exploration-Based Data Collection Approach17 Feb 2024
- 2024Scaling laws for learning with real and surrogate data6 Feb 2024
12 newest of 14 All 14 (JSON)