{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T09:13:52Z","timestamp":1769678032857,"version":"3.49.0"},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"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","award":["2014816"],"award-info":[{"award-number":["2014816"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2038410"],"award-info":[{"award-number":["2038410"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1109\/tac.2024.3479874","type":"journal-article","created":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T13:29:55Z","timestamp":1728912595000},"page":"2258-2273","source":"Crossref","is-referenced-by-count":2,"title":["Zeroth-Order Learning in Continuous Games via Residual Pseudogradient Estimates"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1539-8296","authenticated-orcid":false,"given":"Yuanhanqing","family":"Huang","sequence":"first","affiliation":[{"name":"Elmore Family School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4250-8852","authenticated-orcid":false,"given":"Jianghai","family":"Hu","sequence":"additional","affiliation":[{"name":"Elmore Family School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MCS.2022.3171478"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2012.2223766"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2012.6364562"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511895043"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2012.121115"},{"key":"ref6","first-page":"14708","article-title":"Fast routing under uncertainty: Adaptive learning in congestion games via exponential weights","volume-title":"Proc. Int. Conf. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Vu","year":"2021"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.36.1.48"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1515\/9781400829460"},{"issue":"1","key":"ref9","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/s10107-018-1254-8","article-title":"Learning in games with continuous action sets and unknown payoff functions","volume":"173","author":"Mertikopoulos","year":"2019","journal-title":"Math. Program."},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2019.01.008"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3046232"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2922953"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2021.110080"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2022.3212629"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511546921"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1561\/9781680831719"},{"key":"ref17","first-page":"747","article-title":"The extragradient method for finding saddle points and other problems","volume":"12","author":"Korpelevich","year":"1976","journal-title":"Matecon"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623403425629"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0034-z"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1287\/10-SSY011"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-019-00120-x"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/15M1031953"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2017.8264532"},{"key":"ref24","first-page":"6936","article-title":"On the convergence of single-call stochastic extra-gradient methods","volume-title":"Proc. Int. Conf. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Hsieh","year":"2019"},{"key":"ref25","article-title":"A variational inequality perspective on generative adversarial networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Gidel","year":"2019"},{"key":"ref26","first-page":"326","article-title":"The last-iterate convergence rate of optimistic mirror descent in stochastic variational inequalities","volume-title":"Proc. Conf. Learn. Theory","author":"Azizian","year":"2021"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/14097238X"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7798955"},{"key":"ref29","first-page":"385","article-title":"Online convex optimization in the bandit setting: Gradient descent without a gradient","volume-title":"Proc. 16th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Flaxman","year":"2005"},{"issue":"2","key":"ref30","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1134\/S0005117917020035","article-title":"Stochastic online optimization single-point and multi-point non-linear multi-armed bandits convex and strongly-convex case","volume":"78","author":"Gasnikov","year":"2017","journal-title":"Autom. Remote Control"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2021.110006"},{"key":"ref32","first-page":"3603","article-title":"Improve single-point zeroth-order optimization using high-pass and low-pass filters","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen","year":"2022"},{"key":"ref33","first-page":"5666","article-title":"Bandit learning in concave N-person games","volume-title":"Proc. Int. Conf. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Bravo","year":"2018"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2024.3355035"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.23919\/ECC64448.2024.10591275"},{"key":"ref36","article-title":"Doubly optimal no-regret online learning in strongly monotone games with bandit feedback","author":"Lin","year":"2021"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-023-02001-y"},{"key":"ref38","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"Facchinei","year":"2003"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2010.936021"},{"issue":"4","key":"ref40","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/BF00932654","article-title":"Complementarity problems over cones with monotone and pseudomonotone maps","volume":"18","author":"Karamardian","year":"1976","journal-title":"J. Optim. Theory Appl."},{"key":"ref41","article-title":"Theory of convex optimization for machine learning","volume":"15","author":"Bubeck","year":"2014"},{"key":"ref42","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1007\/s10107-022-01850-3","article-title":"Unifying mirror descent and dual averaging","volume":"199","author":"Juditsky","year":"2022","journal-title":"Math. Program."},{"key":"ref43","author":"Nemirovskij","year":"1983","journal-title":"Problem complexity and method efficiency in optimization"},{"key":"ref44","article-title":"Optimistic mirror descent in saddle-point problems: Going the extra(-gradient) mile","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Mertikopoulos","year":"2019"},{"key":"ref45","article-title":"Zeroth-order learning in continuous games via residual pseudogradient estimates","author":"Huang","year":"2023"},{"issue":"8","key":"ref46","doi-asserted-by":"crossref","first-page":"1669","DOI":"10.1007\/s11590-015-0960-x","article-title":"Qualitative properties of strongly pseudomonotone variational inequalities","volume":"10","author":"Kim","year":"2016","journal-title":"Optim. Lett."},{"key":"ref47","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.neunet.2011.09.001","article-title":"A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization","volume":"26","author":"Liu","year":"2012","journal-title":"Neural Netw."},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.4294229"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.23919\/ACC50511.2021.9482891"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2841319"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/b978-0-12-604550-5.50015-8"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177728716"},{"key":"ref53","volume-title":"Introduction to Optimization","author":"Polyak","year":"1987"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/9\/10945509\/10715648-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/9\/10945509\/10715648.pdf?arnumber=10715648","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T21:01:54Z","timestamp":1769634114000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10715648\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4]]},"references-count":53,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tac.2024.3479874","relation":{},"ISSN":["0018-9286","1558-2523","2334-3303"],"issn-type":[{"value":"0018-9286","type":"print"},{"value":"1558-2523","type":"electronic"},{"value":"2334-3303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4]]}}}