Skip to content
DraconiticResearch
Search Sources API
197,693 studies31 sourcesUpdated 19 min ago
PreprintarXiv licencearXiv

When Does Training on Synthetic Data Provably Work?

Abstract

High-quality training data are a major bottleneck in machine learning, motivating increasing use of artificially generated data. We study when a binary classifier trained on synthetic data transfers successfully to a real distribution, under a shared conditional label distribution. First, we derive finite-sample excess-error bounds when the real covariate distribution is absolutely continuous with respect to the synthetic distribution under a controlled density ratio. Second, we study the partially and fully singular case, where the real distribution has mass outside the synthetic one. If the hypothesis class is sufficiently expressive, synthetic risk alone cannot uniformly control real-world error: a classifier can be nearly optimal on synthetic data while approaching worst-case error on the uncovered real region, even when the distributions are arbitrarily close in Wasserstein distance. For function classes where hypotheses and the log-odds of the conditional label probability are Lipschitz, we recover a bound in terms of the probability that a real sample lies outside the reach of the synthetic data, restoring a transfer guarantee even in the fully singular case. Experiments confirm this in controlled low-dimensional settings and on 32,200 images generated as counterparts to real ImageNet images by four state-of-the-art generators: an adversarial classifier reaches 0.5% error on the synthetic domain but 99.25% error on the real domain, while ordinarily trained architectures show positively correlated synthetic and real test errors. Synthetic data should be budgeted at high sample counts and models validated on real data.

Related

  1. Pointwise or Pairwise: When Do Pairwise Losses Help Reward Learning, Provably?
    Junghyun Lee, Minsoo Ha, Sanghwa Kim +4
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  2. When Can We Work in Embedding Space? What Text Embeddings Preserve
    Simon Freyaldenhoven
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  3. What the submission does not show: Complexifying cognitive offloading in students' mathematical work with LLMs
    Igor' Kontorovich, Miriam N. Wallach
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  4. Why Does the Slope Definition of e Work?: A Self-Contained Exploration After Real Analysis
    Hung Viet Chu, Steven J. Miller, Joshua M. Siktar
    arXivPreprintCC BY-NC-ND 4.0Full textGeneral mathematicsarXiv
  5. Random Clocks on Computation Paths]{Random Clocks on Computation Paths: How Far Can They Reach, and When Does Stepping Back Help?
    Farzad Didehvar, Saman Farhat
    arXivPreprintCC BY 4.0Full textProbabilityarXiv
BibTeX
@misc{odunlami2026when,
  title = {{When Does Training on Synthetic Data Provably Work?}},
  author = {Leroy Odunlami and Tobias Riedlinger and Hanno Gottschalk},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.28036},
  eprint = {2610.28036},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.28036},
}
RIS
TY  - UNPB
TI  - When Does Training on Synthetic Data Provably Work?
AU  - Leroy Odunlami
AU  - Tobias Riedlinger
AU  - Hanno Gottschalk
PY  - 2026
DA  - 2026/10/20
PB  - arXiv
DO  - 10.48550/arxiv.2610.28036
UR  - https://arxiv.org/abs/2610.28036
AB  - High-quality training data are a major bottleneck in machine learning, motivating increasing use of artificially generated data. We study when a binary classifier trained on synthetic data transfers successfully to a real distribution, under a shared conditional label distribution. First, we derive finite-sample excess-error bounds when the real covariate distribution is absolutely continuous with respect to the synthetic distribution under a controlled density ratio. Second, we study the partially and fully singular case, where the real distribution has mass outside the synthetic one. If the hypothesis class is sufficiently expressive, synthetic risk alone cannot uniformly control real-world error: a classifier can be nearly optimal on synthetic data while approaching worst-case error on the uncovered real region, even when the distributions are arbitrarily close in Wasserstein distance. For function classes where hypotheses and the log-odds of the conditional label probability are Lipschitz, we recover a bound in terms of the probability that a real sample lies outside the reach of the synthetic data, restoring a transfer guarantee even in the fully singular case. Experiments confirm this in controlled low-dimensional settings and on 32,200 images generated as counterparts to real ImageNet images by four state-of-the-art generators: an adversarial classifier reaches 0.5% error on the synthetic domain but 99.25% error on the real domain, while ordinarily trained architectures show positively correlated synthetic and real test errors. Synthetic data should be budgeted at high sample counts and models validated on real data.
ER  -