Scaling laws for learning with real and surrogate data
Ayush Jain, Andrea Montanari, Eren Sasoglu
Abstract
Collecting large quantities of high-quality data can be prohibitively expensive or impractical, and a bottleneck in machine learning. One may instead augment a small set of data points from the target distribution with data from more accessible sources, e.g. data collected under different circumstances or synthesized by generative models. We refer to such data as `surrogate data'. We study a weighted empirical risk minimization (ERM) approach for integrating surrogate data into training. We analyze mathematically this method under several classical statistical models, and validate our findings empirically on datasets from different domains. Our main findings are: Integrating surrogate data can significantly reduce the test error on the original distribution. Surprisingly, this can happen even when the surrogate data is unrelated to the original ones. We trace back this behavior to the classical Stein's paradox. In order to reap the benefit of surrogate data, it is crucial to use optimally weighted ERM. The test error of models trained on mixtures of real and surrogate data is approximately described by a scaling law. This scaling law can be used to predict the optimal weighting scheme, and to choose the amount of surrogate data to add.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext ed113c48-6725-4860-b3c8-e3bbfab37798Cited by top-tier papers16
- Scaling Laws in Linear Regression: Compute, Parameters, and DataLicong Lin, Jingfeng Wu, Sham M. Kakade, Peter L. Bartlett et al.NeurIPS 2024 · 57 citations
- Emergence and scaling laws in SGD learning of shallow neural networksYunwei Ren, Eshaan Nichani, Denny Wu, Jason D. LeeNeurIPS 2025 · 33 citations
- Functional Scaling Laws in Kernel Regression: Loss Dynamics and Learning Rate SchedulesBinghui Li, Fengling Chen, Zixun Huang, Lean Wang et al.NeurIPS 2025 · 15 citations
- Larger Datasets Can Be Repeated More: A Theoretical Analysis of Multi-Epoch Scaling in Linear RegressionTingkai Yan, Haodong Wen, Binghui Li, Kairong Luo et al.ICLR 2026 · 12 citations
- When Models Don't Collapse: On the Consistency of Iterative MLEDaniel Barzilai, Ohad ShamirNeurIPS 2025 · 10 citations
Builds on6
- A Constructive Prediction of the Generalization Error Across ScalesJonathan S. Rosenfeld, Amir Rosenfeld, Yonatan Belinkov, Nir ShavitICLR 2020 · 265 citations
- On the Theory of Transfer Learning: The Importance of Task DiversityNilesh Tripuraneni, Michael I. Jordan, Chi JinNeurIPS 2020 · 263 citations
- Revisiting Neural Scaling Laws in Language and VisionIbrahim M. Alabdulmohsin, Behnam Neyshabur, Xiaohua ZhaiNeurIPS 2022 · 171 citations
- Scale Efficiently: Insights from Pretraining and Finetuning TransformersYi Tay, Mostafa Dehghani, Jinfeng Rao, William Fedus et al.ICLR 2022 · 67 citations
- Model Performance Scaling with Multiple Data SourcesTatsunori HashimotoICML 2021 · 38 citations
Related papers
- Towards a statistical theory of data selection under weak supervisionGermain Kolossov, Andrea Montanari, Pulkit TandonICLR 2024 · 27 citations
- Surrogate Regret Bounds for Polyhedral LossesRafael M. Frongillo, Bo WaggonerNeurIPS 2021 · 18 citations
- Learning from Biased Data: A Semi-Parametric ApproachPatrice Bertail, Stéphan Clémençon, Yannick Guyonvarch, Nathan NoiryICML 2021 · 6 citations
- The Value of Out-of-Distribution DataAshwin De Silva, Rahul Ramesh, Carey E. Priebe, Pratik Chaudhari et al.ICML 2023 · 16 citations
- Synthesizing Privacy Preserving Entity Resolution DatasetsXuedi Qin, Chengliang Chai, Nan Tang, Jian Li et al.ICDE 2022 · 7 citations
