Scaling laws for learning with real and surrogate data
<|reference_start|>Scaling laws for learning with real and surrogate data: 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 $n$ 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 introduce 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: $(i)$ 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. $(ii)$ In order to reap the benefit of surrogate data, it is crucial to use optimally weighted ERM. $(iii)$ 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.<|reference_end|>
@article{jain2024scaling,
    title={Scaling laws for learning with real and surrogate data},
    author={Ayush Jain, Andrea Montanari and Eren Sasoglu},
    journal={arXiv preprint arXiv:2402.04376},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.04376},
    primaryClass={cs.LG cs.AI stat.ML}
}