Scaling laws for learning with real and surrogate data

Ayush Jain, Andrea Montanari, Eren Sasoglu
2/6/2024
cs.LGcs.AIstat.ML

No confident code implementation found for this paper. 3 possible matches can be shown below.

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 $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 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: $(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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 3 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{jain2024scaling,
  title  = {Scaling laws for learning with real and surrogate data},
  author = {Ayush Jain and Andrea Montanari and Eren Sasoglu},
  year   = {2024},
  eprint = {2402.04376},
  archivePrefix = {arXiv},
  doi    = {10.48550/arXiv.2402.04376},
  url    = {http://arxiv.org/abs/2402.04376v3},
  journal = {NEURIPS 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2402.04376.svg)](https://codeofpaper.com/paper/2402.04376)

Discussion