Affiliation:
1. Center for Combinatorics, LPMC & KLMDASR Nankai University Tianjin China
2. School of Statistics and Data Science, LPMC & KLMDASR Nankai University Tianjin China
3. College of Computer Science Nankai University Tianjin China
Abstract
AbstractThis paper introduces a novel approach to reducing statistical errors in generative models, with a specific focus on generative adversarial networks (GANs). Inspired by the error analysis of GANs, we find that statistical errors mainly arise from random sampling, leading to significant uncertainties in GANs. To address this issue, we propose a selective sampling mechanism called space‐filling sampling. Our method aims to increase the sampling probability in areas with insufficient data, thereby improving the learning performance of the generator. Theoretical analysis confirms the effectiveness of our approach in reducing statistical errors and accelerating convergence in GANs. This research represents a pioneering effort in targeting the reduction of statistical errors in GANs, and it demonstrates the potential for enhancing the training of other generative models.
Funder
National Key Research and Development Program of China
National Natural Science Foundation of China
Reference51 articles.
1. A general theory for orthogonal array based Latin hypercube sampling;Ai M.;Statistica Sinica,2016
2. Arora S. Ge R. Liang Y. Ma T. &Zhang Y.(2017).Generalization and equilibrium in generative adversarial nets (GANs). InProceedings of the 34th International Conference on Machine Learning PMLR pp.224–232.
3. Berthelot D. Schumm T. &Metz L.(2017).BEGAN: Boundary equilibrium generative adversarial networks. arXiv preprint arXiv:1703.10717.
4. Bowman S. R. Vilnis L. Vinyals O. Dai A. M. Jozefowicz R. &Bengio S.(2016).Generating sentences from a continuous space. InProceedings of the 20th SIGNLL Conference on Computational Natural Language Learning(pp.10–21).Association for Computational Linguistics.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献