Abernethy, Jacob, Alekh Agarwal, Peter L Bartlett, and Alexander Rakhlin. 2009.
“A Stochastic View of Optimal Regret Through Minimax Duality.” arXiv:0903.5328 [Cs, Stat].
Abernethy, Jacob, Peter L Bartlett, and Elad Hazan. 2011. “Blackwell Approachability and No-Regret Learning Are Equivalent.” In, 20.
Arjovsky, Martin, and Léon Bottou. 2017.
“Towards Principled Methods for Training Generative Adversarial Networks.” arXiv:1701.04862 [Stat], January.
Arjovsky, Martin, Soumith Chintala, and Léon Bottou. 2017.
“Wasserstein Generative Adversarial Networks.” In
International Conference on Machine Learning, 214–23.
Arora, Sanjeev, Rong Ge, Yingyu Liang, Tengyu Ma, and Yi Zhang. 2017.
“Generalization and Equilibrium in Generative Adversarial Nets (GANs).” arXiv:1703.00573 [Cs], March.
Bora, Ashish, Ajil Jalal, Eric Price, and Alexandros G. Dimakis. 2017.
“Compressed Sensing Using Generative Models.” In
International Conference on Machine Learning, 537–46.
Bubeck, Sébastien, and Aleksandrs Slivkins. 2012.
“The Best of Both Worlds: Stochastic and Adversarial Bandits.” arXiv:1202.4473 [Cs], February.
Gebhart, Thomas, Paul Schrater, and Alan Hylton. 2019.
“Characterizing the Shape of Activation Space in Deep Neural Networks.” arXiv:1901.09496 [Cs, Stat], January.
Ghosh, Arnab, Viveka Kulharia, Vinay Namboodiri, Philip H. S. Torr, and Puneet K. Dokania. 2017.
“Multi-Agent Diverse Generative Adversarial Networks.” arXiv:1704.02906 [Cs, Stat], April.
Goodfellow, Ian J., Jonathon Shlens, and Christian Szegedy. 2014.
“Explaining and Harnessing Adversarial Examples.” arXiv:1412.6572 [Cs, Stat], December.
Goodfellow, Ian, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio. 2014.
“Generative Adversarial Nets.” In
Advances in Neural Information Processing Systems 27, edited by Z. Ghahramani, M. Welling, C. Cortes, N. D. Lawrence, and K. Q. Weinberger, 2672–80. NIPS’14. Cambridge, MA, USA: Curran Associates, Inc.
Grünwald, Peter D, and Joseph Y Halpern. 2007.
“A Game-Theoretic Analysis of Updating Sets of Probabilities.” Eprint arXiv:07113235.
Guo, Xin, Johnny Hong, Tianyi Lin, and Nan Yang. 2017.
“Relaxed Wasserstein with Applications to GANs.” arXiv:1705.07164 [Cs, Stat], May.
Ilyas, Andrew, Logan Engstrom, Shibani Santurkar, Brandon Tran, Dimitris Tsipras, and Aleksander Ma. 2019. “Adversarial Examples Are Not Bugs, They Are Features.” In Advances In Neural Information Processing Systems, 12.
Jetchev, Nikolay, Urs Bergmann, and Roland Vollgraf. 2016.
“Texture Synthesis with Spatial Generative Adversarial Networks.” In
Advances in Neural Information Processing Systems 29.
Larsen, Anders Boesen Lindbo, Søren Kaae Sønderby, Hugo Larochelle, and Ole Winther. 2015.
“Autoencoding Beyond Pixels Using a Learned Similarity Metric.” arXiv:1512.09300 [Cs, Stat], December.
Linial, Nathan. 1994.
“Chapter 38 Game-Theoretic Aspects of Computing.” In
Handbook of Game Theory with Economic Applications, 2:1339–95. Elsevier.
Ohsawa, Shohei. 2021.
“Unbiased Self-Play.” arXiv:2106.03007 [Cs, Econ, Stat], June.
Poole, Ben, Alexander A. Alemi, Jascha Sohl-Dickstein, and Anelia Angelova. 2016.
“Improved Generator Objectives for GANs.” In
Advances in Neural Information Processing Systems 29.
Raghunathan, Arvind U., Anoop Cherian, and Devesh K. Jha. 2019.
“Game Theoretic Optimization via Gradient-Based Nikaido-Isoda Function.” arXiv:1905.05927 [Cs, Math, Stat], May.
Sato, Yuzuru, Eizo Akiyama, and J Doyne Farmer. 2002.
“Chaos in Learning a Simple Two-Person Game.” Proceedings of the National Academy of Sciences 99 (7): 4748–51.
Vervoort, Marco R. 1996.
“Blackwell Games.” In
Statistics, Probability and Game Theory: Papers in Honor of David Blackwell, edited by T.S. Ferguson, L.S. Shapley, and J.B. MacQueen, 369–90. Institute of Mathematical Statistics.
No comments yet. Why not leave one?