{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T10:16:28Z","timestamp":1729678588918,"version":"3.28.0"},"reference-count":35,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T00:00:00Z","timestamp":1653264000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T00:00:00Z","timestamp":1653264000000},"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":[[2022,5,23]]},"DOI":"10.1109\/icassp43922.2022.9746485","type":"proceedings-article","created":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T19:50:34Z","timestamp":1651089034000},"page":"4343-4347","source":"Crossref","is-referenced-by-count":1,"title":["On The Convergence of ADAM-Type Algorithms for Solving Structured Single Node and Decentralized Min-Max Saddle Point Games"],"prefix":"10.1109","author":[{"given":"Babak","family":"Barazandeh","sequence":"first","affiliation":[{"name":"Splunk"}]},{"given":"Kristal","family":"Curtis","sequence":"additional","affiliation":[{"name":"Splunk"}]},{"given":"Chandrima","family":"Sarkar","sequence":"additional","affiliation":[{"name":"Splunk"}]},{"given":"Ram","family":"Sriharsha","sequence":"additional","affiliation":[{"name":"Pinecone"}]},{"given":"George","family":"Michailidis","sequence":"additional","affiliation":[{"name":"University of Florida"}]}],"member":"263","reference":[{"article-title":"Distributed saddle-point problems under similarity","year":"2021","author":"beznosikov","key":"ref33"},{"article-title":"Adversarial attacks on neural network policies","year":"2017","author":"huang","key":"ref32"},{"article-title":"Adversarial examples in the physical world","year":"2016","author":"kurakin","key":"ref31"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/130943170"},{"article-title":"Explaining and harnessing adversarial examples","year":"2014","author":"goodfellow","key":"ref35"},{"key":"ref34","first-page":"214","article-title":"Wasserstein generative adversarial networks","author":"arjovsky","year":"2017","journal-title":"International Conference on Machine Learning"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9054474"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-030-63823-8","article-title":"Global convergence and variance reduction for a class of nonconvex-nonconcave minimax problems","volume":"33","author":"yang","year":"2020","journal-title":"Advances in neural information processing systems"},{"article-title":"First-order convergence theory for weakly-convex-weakly-concave min-max problems","year":"2018","author":"liu","key":"ref12"},{"key":"ref13","first-page":"2746","article-title":"Efficient methods for structured nonconvex-nonconcave min-max optimization","author":"diakonikolas","year":"2021","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"ref14","first-page":"6282","article-title":"Min-max optimization without gradients: Convergence and applications to black-box evasion and poisoning attacks","author":"liu","year":"2020","journal-title":"International Conference on Machine Learning"},{"article-title":"Zeroth-order algorithms for nonconvex minimax problems with improved complexities","year":"2020","author":"wang","key":"ref15"},{"article-title":"Can decentralized algorithms outperform centralized algorithms? a case study for decentralized parallel stochastic gradient descent","year":"2017","author":"lian","key":"ref16"},{"key":"ref17","first-page":"5330","article-title":"Can decentralized algorithms outperform centralized algorithms?","author":"lian","year":"2017","journal-title":"Advances in neural information processing systems"},{"article-title":"Decentralized parallel algorithm for training generative adversarial nets","year":"0","author":"liu","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/14096668X"},{"article-title":"Adaptive first-and zeroth-order methods for weakly convex stochastic optimization problems","year":"2020","author":"nazari","key":"ref28"},{"key":"ref4","first-page":"3384","article-title":"Learning adversarially fair and transferable representations","author":"madras","year":"2018","journal-title":"International Conference on Machine Learning"},{"key":"ref27","article-title":"Divide the gradient by a running average of its recent magnitude. coursera: Neural networks for machine learning","author":"tieleman","year":"2017","journal-title":"Technical Report"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622525"},{"key":"ref6","first-page":"4880","article-title":"What is local optimality in nonconvex-nonconcave minimax optimization?","author":"jin","year":"2020","journal-title":"International Conference on Machine Learning"},{"article-title":"Independent policy gradient methods for competitive reinforcement learning","year":"2021","author":"daskalakis","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.3003851"},{"article-title":"Solving a class of non-convex min-max games using iterative first order methods","year":"2019","author":"nouiehed","key":"ref8"},{"article-title":"GANs May Have No Nash Equilibria","year":"2020","author":"farnia","key":"ref7"},{"article-title":"Towards deep learning models resistant to adversarial attacks","year":"2017","author":"madry","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46128-1_50"},{"key":"ref1","article-title":"Generative adversarial nets","volume":"27","author":"goodfellow","year":"2014","journal-title":"Advances in neural information processing systems"},{"key":"ref20","first-page":"3581","article-title":"Asynchronous gossip algorithms for stochastic optimization","author":"ram","year":"2009","journal-title":"Prooceedings of the 48th IEEE Conference on Decision and Control (CDC) held jointly with the 28th Chinese Control Conference"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9414476"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2198470"},{"article-title":"A decentralized proximal point-type method for saddle point problems","year":"2019","author":"liu","key":"ref24"},{"article-title":"Towards better understanding of adaptive gradient algorithms in generative adversarial nets","year":"2019","author":"liu","key":"ref23"},{"key":"ref26","first-page":"7","article-title":"On the convergence of adam and beyond","volume":"5","author":"sashank","year":"2018","journal-title":"International Conference on Learning Representations"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2021.108245"}],"event":{"name":"ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2022,5,23]]},"location":"Singapore, Singapore","end":{"date-parts":[[2022,5,27]]}},"container-title":["ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9745891\/9746004\/09746485.pdf?arnumber=9746485","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T03:24:06Z","timestamp":1727061846000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9746485\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,23]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/icassp43922.2022.9746485","relation":{},"subject":[],"published":{"date-parts":[[2022,5,23]]}}}