- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper investigates the generalization of classifiers trained on synthetic data under covariate shift. It derives excess-risk bounds under density-ratio and Lipschitz assumptions, and characterizes worst-case failures when the real distribution contains regions not covered by the synthetic distribution. The theoretical results are illustrated through synthetic experiments and an ImageNet-based dataset generated using four image generators.
Critical strengths
The paper addresses a relevant problem and presents a reasonably clear theoretical analysis, supported by experiments on both controlled and realistic datasets.
Critical weaknesses
-
The main theoretical contribution appears limited. Theorem 4 and Corollary 5 essentially characterize the non-identifiability of target-domain behavior outside the source distribution's support, which is closely related to existing impossibility results in domain adaptation. The paper does not clearly establish what is fundamentally new compared with these results. Furthermore, the guarantee in Theorem 7 depends on quantities that are generally unavailable in practice, including the Bayes classifier and the true conditional label distribution.
-
The experimental evidence does not fully support the broader conclusions. The adversarial classifiers in Section 4.3 are trained using real data with deliberately inverted labels. While this confirms the existence of such classifiers, it does not demonstrate that these failures arise under ordinary synthetic-only training. Moreover, high real-versus-synthetic discrimination accuracy does not establish that the underlying distributions are mutually singular. The conclusions regarding support separation therefore seem overstated.
Questions for authors
-
How do Theorem 4 and Corollary 5 differ substantively from existing domain adaptation impossibility results?
-
Can the guarantee in Theorem 7 be made practically applicable without knowing the Bayes classifier or the true conditional label distribution?
-
Do similar failure patterns arise when models are trained exclusively on synthetic data, without introducing real samples with inverted labels?
2 comments
Response 2/2
Q1. (cf. W1)
Q2. Only partially. Since another reviewer asked a similar question, we updated the corresponding section. In Sec. 4.1 and Appendix F, we show how a lower bound on the real mass outside the stability balls can be measured for a relaxed version of the bound. On our data, this bound is uninformative. We show that this is not a defect of the specific bound we give, but that, when the synthetic data lies far from the region where the discriminator predicts real, no bound on the excess error that holds uniformly over all Lipschitz models with a training risk close to the optimum can be smaller than , where is the specificity of a domain classifier (Corollary 11). We now estimate the quantities involved in both cases (guarantee (Theorem 9) and adversary Lipschitz construction (Theorem 10)) on our generated dataset which was previously not the case.
Q3. Yes, but to a much lesser degree than for the adversaries. In our correlation experiment on ordinarily trained architectures (Sec. 4.1, Figure 2, Appendix B.4) the real error is systematically higher than the synthetic error and grows roughly linearly with it. For the 30 architectures with the lowest synthetic error, which we retrained on a new split, the median gap between real and synthetic error is 8.6 to 17.7 points and the largest is 10.1 to 28.0 points depending on the generator (Table 6). For Stable Diffusion 3.5 Large, all 30 have a gap of at least 10 points, and for HunyuanImage 3.0, 7 of 30 have a gap of at least 20 points. However, no real error reaches 50% (chance level), whereas the adversaries reach gaps of 62 to 88 points (Table 3). So ordinary training shows a systematic gap but does not exhibit the worst case behavior in our experiments.
Response 1/2
We thank the reviewer for the critical and detailed engagement with our work. Several of the points were also raised in other reviews and motivated substantial changes, which we describe below. We answer point by point. (Theorem, Corollary, Section and Appendix numbers refer to the rebuttal version.)
W1 (novelty). We understand the concern and have gone back through the literature on impossibility results. Our work contains the following points that we could not find in the works we checked, which include the related work of our paper and further papers on domain adaptation:
The work closest in title for the reviewer's question would be David et al. (2010), “Impossibility Theorems for Domain Adaptation”, but its setting differs: It does not treat training with the log-likelihood or Lipschitz models, and it contains no experiments. Its lower bound is also a constant, whereas ours is adaptive to the degree of domain separability.
Concerning the fact that the quantities are unobservable, we argue that population statements are common in learning theory, but we acknowledge that this is unsatisfactory from a practitioner's point of view. Since another review flagged this as well, we reformulated our negative results so that they depend on observable quantities, as detailed under W2.
W2 (discriminability vs. singularity and average vs. worst case). We agree that high discrimination accuracy between real and synthetic images does not establish that the distributions are mutually singular. This was an imprecision on our part. Another review made the same point, and we therefore decided to de-emphasize singularity which was possible because a very large density ratio and true singularity behave similar in practice and so our constructions work also without strict singularity. We reformulated the adversarial construction in terms of a domain classifier and its sensitivity and specificity (Theorem 4). This has two advantages. First, the strict division into singular and non-singular cases is replaced by a continuous dependence on the degree of domain separation. The updated result does not rely on the distributions being fully singular. Second, the construction now depends on observable quantities, which you and other reviewers flagged as a weakness of our results. The experiment with inverted labels in the submitted version is sufficient to show existence, but it required real labels. The experiment was updated to align with the reformulated theorem and real labels are not used directly anymore.
Concerning that ordinary training does not find the adversary, we agree, and we did not claim otherwise. The adversary shows existence, and the goal of our work is to characterize when this worst case can exist, since for safety-critical applications good average behavior is not always enough. Since another review made a similar point, we acknowledge that we did not communicate this clearly enough, and we now stress it more strongly, notably in the paragraph "Existence vs. selection" after Corollary 7. Since several reviews put a strong emphasis on ordinary training, we also extended the correlation experiment on ordinarily trained architectures (Sec. 4.1, Figure 2), but we do want to stress that it is not the main focus of this work.