Implicit Manifold Learning on Generative Adversarial Networks
暂无分享,去创建一个
[1] R. McCann. Polar factorization of maps on Riemannian manifolds , 2001 .
[2] C. Villani. Optimal Transport: Old and New , 2008 .
[3] Nestor Guillen,et al. Five lectures on optimal transportation: Geometry, regularity and applications , 2010, 1011.2911.
[4] Hariharan Narayanan,et al. Sample Complexity of Testing the Manifold Hypothesis , 2010, NIPS.
[5] Yoshua Bengio,et al. Generative Adversarial Nets , 2014, NIPS.
[6] Max Welling,et al. Auto-Encoding Variational Bayes , 2013, ICLR.
[7] Soumith Chintala,et al. Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks , 2015, ICLR.
[8] Sebastian Nowozin,et al. f-GAN: Training Generative Neural Samplers using Variational Divergence Minimization , 2016, NIPS.
[9] Ian J. Goodfellow,et al. NIPS 2016 Tutorial: Generative Adversarial Networks , 2016, ArXiv.
[10] Yingyu Liang,et al. Generalization and Equilibrium in Generative Adversarial Nets (GANs) , 2017, ICML.
[11] Léon Bottou,et al. Towards Principled Methods for Training Generative Adversarial Networks , 2017, ICLR.
[12] David Berthelot,et al. BEGAN: Boundary Equilibrium Generative Adversarial Networks , 2017, ArXiv.
[13] Yiming Yang,et al. MMD GAN: Towards Deeper Understanding of Moment Matching Network , 2017, NIPS.
[14] Marc G. Bellemare,et al. The Cramer Distance as a Solution to Biased Wasserstein Gradients , 2017, ArXiv.
[15] Aaron C. Courville,et al. Improved Training of Wasserstein GANs , 2017, NIPS.
[16] Yi Zhang,et al. Do GANs actually learn the distribution? An empirical study , 2017, ArXiv.