{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:57:52Z","timestamp":1773377872470,"version":"3.50.1"},"reference-count":45,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834691","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"672-677","source":"Crossref","is-referenced-by-count":4,"title":["Accelerated Proximal Alternating Gradient-Descent-Ascent for Nonconvex Minimax Machine Learning"],"prefix":"10.1109","author":[{"given":"Ziyi","family":"Chen","sequence":"first","affiliation":[{"name":"University of Utah,Electrical & Computer Engineering,Salt Lake City,US"}]},{"given":"Shaocong","family":"Ma","sequence":"additional","affiliation":[{"name":"University of Utah,Electrical & Computer Engineering,Salt Lake City,US"}]},{"given":"Yi","family":"Zhou","sequence":"additional","affiliation":[{"name":"University of Utah,Electrical & Computer Engineering,Salt Lake City,US"}]}],"member":"263","reference":[{"key":"ref39","author":"xu","year":"2020","journal-title":"Enhanced first and zeroth order variance reduced algorithms for min-max optimization"},{"key":"ref38","article-title":"On solving minimax optimization locally: A follow-the-ridge approach","author":"wang","year":"2019","journal-title":"Proc International Conference on Learning Representations (ICLR)"},{"key":"ref33","author":"qiu","year":"2020","journal-title":"Single-timescale stochastic nonconvex-concave optimization for smooth nonlinear td learning"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(64)90137-5"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/130942954"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-018-1272-y"},{"key":"ref37","article-title":"Improved algorithms for convex-concave minimax optimization","author":"wang","year":"2020","journal-title":"Proc Advances in Neural Information Processing Systems (NeurIPS)"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0394-2"},{"key":"ref35","article-title":"Certifying some distributional robustness with principled adversarial training","author":"sinha","year":"2018","journal-title":"Proc International Conference on Learning Representations (ICLR)"},{"key":"ref34","article-title":"Convergence rates of inexact proximal-gradient methods for convex optimization","author":"schmidt","year":"2011","journal-title":"Proc Advances in Neural Information Processing Systems (NeurIPS)"},{"key":"ref10","article-title":"Minimax theorem and nash equilibrium","author":"ferreira","year":"2012","journal-title":"International Journal of Latest Trends in Finance & Economic Sciences"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0871-8"},{"key":"ref40","author":"xu","year":"2020","journal-title":"A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems"},{"key":"ref12","first-page":"1802","article-title":"Negative momentum for improved game dynamics","author":"gidel","year":"2019","journal-title":"Proc International Conference on Artificial Intelligence and Statistics (AISTATS)"},{"key":"ref13","first-page":"2672","article-title":"Generative adversarial nets","author":"goodfellow","year":"2014","journal-title":"Proc Advances in Neural Information Processing Systems (NeurIPS)"},{"key":"ref14","author":"huang","year":"2020","journal-title":"Gradient descent ascent for min-max problems on riemannian manifolds"},{"key":"ref15","author":"huang","year":"2020","journal-title":"Accelerated zeroth-order and first-order momentum methods from mini to minimax optimization"},{"key":"ref16","article-title":"Efficient mirror descent ascent methods for nonsmooth minimax problems","volume":"34","author":"huang","year":"2021","journal-title":"Proc International Conference on Neural Information Processing Systems (Neurips)"},{"key":"ref17","first-page":"4880","article-title":"What is local optimality in nonconvex-nonconcave minimax optimization?","author":"jin","year":"2020","journal-title":"Proc International Conference on Machine Learning (ICML)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref19","first-page":"379","article-title":"Accelerated proximal gradient methods for nonconvex programming","author":"li","year":"2015","journal-title":"Proc International Conference on Neural Information Processing Systems (Neurips)"},{"key":"ref4","author":"bo?","year":"2020","journal-title":"Alternating proximal-gradient steps for (stochastic) nonconvex-concave minimax problems"},{"key":"ref28","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":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref27","author":"nesterov","year":"2014","journal-title":"Introductory Lectures on Convex Optimization A Basic Course"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/15M1026924"},{"key":"ref5","article-title":"Proximal gradient descentascent: Variable convergence under k? geometry","author":"chen","year":"2021","journal-title":"Proc International Conference on Learning Representations (ICLR)"},{"key":"ref29","first-page":"14934","article-title":"Solving a class of non-convex min-max games using iterative first order methods","author":"nouiehed","year":"2019","journal-title":"Proc Advances in Neural Information Processing Systems (NeurIPS)"},{"key":"ref8","first-page":"196","article-title":"Linear convergence of the primal-dual gradient method for convex-concave saddle point problems without strong convexity","author":"du","year":"2019","journal-title":"Proc International Conference on Artificial Intelligence and Statistics (AISTATS)"},{"key":"ref7","first-page":"9236","article-title":"The limit points of (optimistic) gradient descent in min-max optimization","author":"daskalakis","year":"2018","journal-title":"Proc Advances in Neural Information Processing Systems (NeurIPS)"},{"key":"ref2","first-page":"391","article-title":"Finite regret and cycles with fixed step-size via alternating gradient descent-ascent","author":"bailey","year":"2020","journal-title":"In Proceedings of the Conference on Computational Learning Theory (COLT)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CDC42340.2020.9304033"},{"key":"ref1","first-page":"486","article-title":"Local saddle point optimization: A curvature exploitation approach","author":"adolphs","year":"2019","journal-title":"Proc International Conference on Artificial Intelligence and Statistics (AISTATS)"},{"key":"ref20","first-page":"2111","article-title":"Convergence analysis of proximal gradient with momentum for nonconvex optimization","volume":"70","author":"li","year":"2017","journal-title":"Proc International Conference on Machine Learning (ICML)"},{"key":"ref45","author":"zhu","year":"2020","journal-title":"A New Primal-Dual Algorithm for a Class of Nonlinear Compositional Convex Optimization Problems"},{"key":"ref22","first-page":"6083","article-title":"On gradient descent ascent for nonconvex-concave minimax problems","author":"lin","year":"2020","journal-title":"Proc International Conference on Machine Learning (ICML)"},{"key":"ref21","first-page":"2738","article-title":"Near-optimal algorithms for minimax optimization","author":"lin","year":"2020","journal-title":"Proc Annual Conference on Learning Theory (COLT)"},{"key":"ref24","article-title":"Stochastic recursive gradient descent ascent for stochastic nonconvex-strongly-concave minimax problems","volume":"33","author":"luo","year":"2020","journal-title":"Proc Advances in Neural Information Processing Systems (NeurIPS)"},{"key":"ref42","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","author":"yang","year":"2020","journal-title":"Proc Advances in Neural Information Processing Systems (NeurIPS)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/0716071"},{"key":"ref41","article-title":"Stabilizing adversarial nets with prediction methods","author":"yadav","year":"2018","journal-title":"Proc International Conference on Learning Representations (ICLR)"},{"key":"ref44","author":"zhang","year":"2021","journal-title":"The complexity of nonconvex-strongly-concave minimax optimization"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-009-9522-7"},{"key":"ref43","article-title":"On the suboptimality of negative momentum for minimax optimization","author":"zhang","year":"2020"},{"key":"ref25","first-page":"1497","article-title":"A unified analysis of extragradient and optimistic gradient methods for saddle point problems: Proximal point approach","author":"mokhtari","year":"2020","journal-title":"Proc International Conference on Artificial Intelligence and Statistics (AISTATS)"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834691.pdf?arnumber=9834691","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:25Z","timestamp":1773347725000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834691\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":45,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834691","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}