{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T21:39:15Z","timestamp":1763415555379,"version":"3.28.0"},"reference-count":42,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,6]],"date-time":"2021-06-06T00:00:00Z","timestamp":1622937600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,6]],"date-time":"2021-06-06T00:00:00Z","timestamp":1622937600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,6]],"date-time":"2021-06-06T00:00:00Z","timestamp":1622937600000},"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":[[2021,6,6]]},"DOI":"10.1109\/icassp39728.2021.9414476","type":"proceedings-article","created":{"date-parts":[[2021,5,13]],"date-time":"2021-05-13T15:53:45Z","timestamp":1620921225000},"page":"3625-3629","source":"Crossref","is-referenced-by-count":7,"title":["Solving a Class of Non-Convex Min-Max Games Using Adaptive Momentum Methods"],"prefix":"10.1109","author":[{"given":"Babak","family":"Barazandeh","sequence":"first","affiliation":[]},{"given":"Davoud Ataee","family":"Tarzanagh","sequence":"additional","affiliation":[]},{"given":"George","family":"Michailidis","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"arxiv","article-title":"On the convergence proof of amsgrad and a new version","author":"phuong","year":"2019"},{"key":"ref38","first-page":"3581","article-title":"A large-scale study on regularization and normalization in gans","author":"kurach","year":"2019","journal-title":"International Conference on Machine Learning"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.3003851"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0629-5"},{"key":"ref31","first-page":"5","article-title":"Introductory lectures on convex programming volume i: Basic course","volume":"3","author":"nesterov","year":"1998","journal-title":"Lecture notes"},{"key":"ref30","first-page":"5200","article-title":"Sgd: General analysis and improved rates","author":"gower","year":"2019","journal-title":"International Conference on Machine Learning"},{"article-title":"Progressive growing of gans for improved quality, stability, and variation","year":"2017","author":"karras","key":"ref37"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-55393-7_37"},{"article-title":"Decentralized parallel algorithm for training generative adversarial nets","year":"2019","author":"liu","key":"ref35"},{"key":"ref34","article-title":"Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile","author":"mertikopoulos","year":"2019","journal-title":"International Conference on Learning Representations"},{"article-title":"On the convergence of a class of adam-type algorithms for non-convex optimization","year":"2018","author":"chen","key":"ref10"},{"key":"ref40","first-page":"12680","article-title":"E?cient algorithms for smooth minimax optimization","author":"thekumparampil","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref11","first-page":"9815","article-title":"Adaptive methods for nonconvex optimization","author":"zaheer","year":"2018","journal-title":"Advances in neural information processing systems"},{"article-title":"Dadam: A consensus-based distributed adaptive gradient method for online optimization","year":"2019","author":"nazari","key":"ref12"},{"article-title":"Adaptive first-and zeroth-order methods for weakly convex stochastic optimization problems","year":"2020","author":"nazari","key":"ref13"},{"article-title":"Towards better under-standing of adaptive gradient algorithms in generative adversarial nets","year":"2019","author":"liu","key":"ref14"},{"key":"ref15","first-page":"2672","article-title":"Generative adversarial nets","author":"goodfellow","year":"2014","journal-title":"Advances in neural information processing systems"},{"article-title":"Wasserstein gan","year":"2017","author":"arjovsky","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/DSW.2019.8755568"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2018.8646506"},{"article-title":"Minmax optimization: Stable limit points of gradient descent ascent are locally optimal","year":"2019","author":"jin","key":"ref19"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/15M1031953"},{"key":"ref4","article-title":"Adaptive subgradient methods for online learning and stochastic optimization","volume":"12","author":"duchi","year":"2011","journal-title":"Journal of Machine Learning Research"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/100811787"},{"article-title":"Improving the convergence of back-propagation learning with second order methods","year":"1988","author":"becker","key":"ref3"},{"article-title":"Adam: A method for stochastic optimization","year":"2014","author":"kingma","key":"ref6"},{"article-title":"On gradient descent ascent for nonconvex-concave minimax problems","year":"2019","author":"lin","key":"ref29"},{"article-title":"Adaptive bound optimization for online convex optimization","year":"2010","author":"mcmahan","key":"ref5"},{"key":"ref8","first-page":"543","article-title":"A method for solving the convex programming problem with convergence rate o (1\/k^ 2)","volume":"269","author":"nesterov","year":"1983","journal-title":"Dokl Akad Nauk SSSR"},{"key":"ref7","article-title":"On the convergence of adam and beyond","author":"reddi","year":"2018","journal-title":"International Conference on Learning Representations"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(88)90003-2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(64)90137-5"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1080173"},{"key":"ref20","first-page":"362","article-title":"Frankwolfe algorithms for saddle point problems","author":"gidel","year":"2017","journal-title":"Artificial Intelligence and Statistics"},{"article-title":"Training gans with optimism","year":"2017","author":"daskalakis","key":"ref22"},{"article-title":"Iteration complexity of randomized primal-dual methods for convex-concave saddle point problems","year":"2018","author":"hamedani","key":"ref21"},{"key":"ref42","first-page":"2234","article-title":"Improved techniques for training gans","author":"salimans","year":"2016","journal-title":"Advances in neural information processing systems"},{"key":"ref24","first-page":"14905","article-title":"Solving a class of non-convex min-max games using iterative first order methods","author":"nouiehed","year":"2019","journal-title":"Advances in neural information processing systems"},{"article-title":"E?cient search of first-order nash equilibria in nonconvex-concave smooth min-max problems","year":"2020","author":"ostrovskii","key":"ref41"},{"article-title":"Gans may have no nash equilibria","year":"2020","author":"farnia","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316162750.005"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9054474"}],"event":{"name":"ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2021,6,6]]},"location":"Toronto, ON, Canada","end":{"date-parts":[[2021,6,11]]}},"container-title":["ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9413349\/9413350\/09414476.pdf?arnumber=9414476","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T11:40:54Z","timestamp":1652182854000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9414476\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,6]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/icassp39728.2021.9414476","relation":{},"subject":[],"published":{"date-parts":[[2021,6,6]]}}}