{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:02:25Z","timestamp":1754161345585,"version":"3.41.2"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1109\/ieeeconf44664.2019.9048943","type":"proceedings-article","created":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T01:10:33Z","timestamp":1585617033000},"page":"680-684","source":"Crossref","is-referenced-by-count":1,"title":["Alternating Gradient Descent Ascent for Nonconvex Min-Max Problems in Robust Learning and GANs"],"prefix":"10.1109","author":[{"given":"Songtao","family":"Lu","sequence":"first","affiliation":[{"name":"IBM Research AI,IBM Thomas J. Watson Research Center,New York,USA,10598"}]},{"given":"Rahul","family":"Singh","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology,School of Aerospace Engineering,Atlanta,GA,USA,30332"}]},{"given":"Xiangyi","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Minnesota Twin Cities,Department of Electrical and Computer Engineering,Minneapolis,MN,USA,55455"}]},{"given":"Yongxin","family":"Chen","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology,School of Aerospace Engineering,Atlanta,GA,USA,30332"}]},{"given":"Mingyi","family":"Hong","sequence":"additional","affiliation":[{"name":"University of Minnesota Twin Cities,Department of Electrical and Computer Engineering,Minneapolis,MN,USA,55455"}]}],"member":"263","reference":[{"key":"ref10","first-page":"5585","article-title":"Gradient descent GAN optimization is locally stable","author":"nagarajan","year":"2017","journal-title":"Proc of NIPS"},{"key":"ref11","article-title":"Non-convex min-max optimization: Provable algorithms and applications in machine learning","author":"rafique","year":"2018","journal-title":"arXiv preprint arXiv 1810 06008"},{"key":"ref12","article-title":"Stabilizing adversarial nets with prediction methods","author":"yadav","year":"2018","journal-title":"Proc of ICLR"},{"key":"ref13","article-title":"A convex duality framework for GANs","author":"farnia","year":"2018","journal-title":"Proc of NIPS"},{"key":"ref14","article-title":"Understanding GANs: the LQG setting","author":"feizi","year":"2017","journal-title":"arXiv preprint arXiv 1710 10793"},{"key":"ref15","article-title":"A primal-dual algorithm for general convex-concave saddle point problems","author":"hamedani","year":"2018","journal-title":"arXiv preprint arXiv 1803 01401"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/130919362"},{"key":"ref17","article-title":"Hybrid block successive approximation for one-sided non-convex min-max problems: Algorithms and applications","author":"lu","year":"2019","journal-title":"IEEE Transactions on Signal Processing (submitted)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref19","first-page":"1097","article-title":"Imagenet classification with deep convolutional neural networks","author":"krizhevsky","year":"2012","journal-title":"Proc of NIPS"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014739"},{"key":"ref3","first-page":"2208","article-title":"Stochastic gradient methods for distributionally robust optimization with f-divergences","author":"namkoong","year":"2016","journal-title":"Proc of NIPS"},{"key":"ref6","article-title":"Wasserstein GAN","author":"arjovsky","year":"2017","journal-title":"arXiv preprint arXiv 1701 07875"},{"key":"ref5","article-title":"Towards deep learning models resistant to adversarial attacks","author":"madry","year":"2018","journal-title":"Proc of ICLR"},{"key":"ref8","article-title":"Training GANs with optimism","author":"daskalakis","year":"2017","journal-title":"arXiv preprint arXiv 1711 07128"},{"key":"ref7","article-title":"On the convergence and robustness of training GANs with regularized optimal transport","author":"sanjabi","year":"2018","journal-title":"Proc of NIPS"},{"key":"ref2","article-title":"Unsupervised representation learning with deep convolutional generative adversarial networks","author":"radford","year":"2015","journal-title":"arXiv preprint arXiv 1511 06434"},{"key":"ref1","first-page":"2672","article-title":"Generative adversarial nets","author":"goodfellow","year":"2014","journal-title":"Proc of NIPS"},{"key":"ref9","first-page":"1825","article-title":"The numerics of GANs","author":"mescheder","year":"2017","journal-title":"Proc of NIPS"}],"event":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","start":{"date-parts":[[2019,11,3]]},"location":"Pacific Grove, CA, USA","end":{"date-parts":[[2019,11,6]]}},"container-title":["2019 53rd Asilomar Conference on Signals, Systems, and Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9034466\/9048648\/09048943.pdf?arnumber=9048943","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,28]],"date-time":"2025-07-28T19:43:27Z","timestamp":1753731807000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9048943\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/ieeeconf44664.2019.9048943","relation":{},"subject":[],"published":{"date-parts":[[2019,11]]}}}