As witnessed by the references provided by the reviewers, adding surrogate data to training is a practice of great current interest in itself. This is different from data augmentation, which uses transformations of the original data, and from regularization, which does not use surrogate data. We will emphasize the relation to and distinction from these lines of work in our revision.
The referee also mentions three related works. All of these papers are very different and cannot be compared to ours.
The most important difference is all of these papers use vanilla ERM instead of weighted ERM. As a consequence, if the surrogate data sample is sufficiently large, the effect of surrogate data will drown the original data, and the resulting model will perform poorly. In other words, if we compare our approach to theirs in a setting in which the surrogate dataset is significantly larger than the original one, our approach will outperform theirs by a multiplicative factor that can be arbitrarily large.
(Of course, the naive solution to this problem is to add only a small fraction of surrogate data, but this is suboptimal.)
Overcoming this fundamental problem is the very starting point of our work. Hence our work takes the next step beyond what is accomplished in these papers.
We remark the following additional differences:
1. Hashimoto, T., 2021, July. Model performance scaling with multiple data sources. This paper derives a low-dimensional scaling result for data mixtures. However, the settings studied are such that the exponent is always equal to one.
2. Kang, F., Just, H.A., Sahu, A.K. and Jia, R., 2024. Performance scaling via optimal transport: Enabling data selection from partially revealed sources.
This paper is entirely empirical. It assumes without mathematical justification that the error is an affine function of the Optimal Transport distance. Coefficients are fitted to this postulated relation without providing insights into how the scaling behavior depends on the mixture proportion. The only theorem assumes that the postulated scaling law holds exactly, which is obviously unrealistic.
In conclusion, the real problem addressed in this paper is actually very different from ours. Given a certain postulated law, they optimize the proportion (which they do by gradient descent). Our work is about deriving a correct scaling law.
3. Ye, J., Liu, P., Sun, T., Zhou, Y., Zhan, J. and Qiu, X., 2024. ‘Data mixing laws: Optimizing data mixtures by predicting language modeling performance’.
This paper was posted on arxiv on March 24. As such, it is concurrent or follow-up work. Also, our work implies that the “mixing law” they suggest does not hold in any of the models that we can analyze mathematically. (The law they propose in Eq (1) is exponential in a linear combination of the proportions, while we prove a different relationship.)