Graph-based Discriminators: Sample Complexity and Expressiveness
暂无分享,去创建一个
[1] Yoshua Bengio,et al. Generative Adversarial Nets , 2014, NIPS.
[2] Ronitt Rubinfeld,et al. Testing that distributions are close , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[3] Yair Weiss,et al. On GANs and GMMs , 2018, NeurIPS.
[4] Liam Paninski,et al. A Coincidence-Based Test for Uniformity Given Very Sparsely Sampled Discrete Data , 2008, IEEE Transactions on Information Theory.
[5] Stéphan Clémençon,et al. Scaling-up Empirical Risk Minimization: Optimization of Incomplete $U$-statistics , 2015, J. Mach. Learn. Res..
[6] Yoav Freund,et al. Game theory, on-line prediction and boosting , 1996, COLT '96.
[7] Pravesh Kothari,et al. Agnostic Learning by Refuting , 2017 .
[8] Yi Zhang,et al. Do GANs actually learn the distribution? An empirical study , 2017, ArXiv.
[9] Russell Impagliazzo,et al. Hard-core distributions for somewhat hard problems , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[10] David Haussler,et al. Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.
[11] Pravesh Kothari,et al. Improper Learning by Refuting , 2018, ITCS.
[12] Shai Ben-David. 2 Notes on Classes with Vapnik-Chervonenkis Dimension 1 , 2015, ArXiv.
[13] Roi Livni,et al. Passing Tests without Memorizing: Two Models for Fooling Discriminators , 2019, ArXiv.
[14] Ilias Diakonikolas,et al. Optimal Algorithms for Testing Closeness of Discrete Distributions , 2013, SODA.
[15] Salil P. Vadhan,et al. On Learning vs. Refutation , 2017, COLT.
[16] Seshadhri Comandur,et al. Testing Expansion in Bounded Degree Graphs , 2007, Electron. Colloquium Comput. Complex..
[17] Ashish Khetan,et al. PacGAN: The Power of Two Samples in Generative Adversarial Networks , 2017, IEEE Journal on Selected Areas in Information Theory.
[18] Peter L. Bartlett,et al. Neural Network Learning - Theoretical Foundations , 1999 .
[19] Shai Ben-David,et al. Understanding Machine Learning - From Theory to Algorithms , 2014 .
[20] Dana Ron,et al. On Testing Expansion in Bounded-Degree Graphs , 2000, Studies in Complexity and Cryptography.
[21] G. Lugosi,et al. Ranking and empirical minimization of U-statistics , 2006, math/0603123.
[22] A. Müller. Integral Probability Metrics and Their Generating Classes of Functions , 1997, Advances in Applied Probability.