{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,17]],"date-time":"2026-09-17T16:53:30Z","timestamp":1789664010748,"version":"4.0.1"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100010218","name":"Department of Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100010218","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1109\/tac.2022.3159748","type":"journal-article","created":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T19:36:19Z","timestamp":1647459379000},"page":"1628-1641","source":"Crossref","is-referenced-by-count":14,"title":["Nonasymptotic Bounds for Stochastic Optimization With Biased Noisy Gradient Oracles"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9588-4771","authenticated-orcid":false,"given":"Nirav","family":"Bhavsar","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0362-6730","authenticated-orcid":false,"given":"L. A.","family":"Prashanth","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.21314\/JOR.2000.038"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-1384-8"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-4285-0"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-015-9296-2"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/9.119632"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/0471722138"},{"key":"ref7","first-page":"819","article-title":"(Bandit) convex optimization with biased noisy gradient oracles","volume-title":"Proc. Artif. Intell. Statist.","author":"Hu","year":"2016"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/120880811"},{"key":"ref9","first-page":"3459","article-title":"Zeroth-order (non)-convex stochastic optimization via conditional gradient and gradient updates","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Balasubramanian","year":"2018"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/19M128908X"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0677-5"},{"key":"ref12","first-page":"5","article-title":"Estimate sequence methods: Extensions and approximations","volume-title":"Inst. Operations Res.","author":"Baes","year":"2009"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/060676386"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2020.1818081"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/dry009"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/140951679"},{"key":"ref17","first-page":"3727","article-title":"Zeroth-order stochastic variance reduction for nonconvex optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Liu","year":"2018"},{"key":"ref18","first-page":"315","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","volume":"26","author":"Johnson","year":"2013","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316481"},{"key":"ref20","first-page":"11762","article-title":"Concentration of risk measures: A Wasserstein distance approach","volume":"32","author":"Bhat","year":"2019","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref21","first-page":"1321","article-title":"Convergence of a class of random search algorithms","volume":"8","author":"Katkovnik","year":"1972","journal-title":"Automat. Remote Control"},{"key":"ref22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9352-8","volume-title":"Stochastic Approximation Methods for Constrained and Unconstrained Systems","author":"Kushner","year":"1978"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2600643"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2930821"},{"key":"ref25","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-69033-9","volume-title":"Stochastic Simulation: Algorithms and Analysis","volume":"57","author":"Asmussen","year":"2007"},{"key":"ref26","volume-title":"Gradient Estimation Via Perturbation Analysis","volume":"116","author":"Glasserman","year":"1991"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/16M1080173"},{"key":"ref28","first-page":"5729","article-title":"Hessian aided policy gradient","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Shen","year":"2019"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s007800200072"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-4266(02)00281-9"},{"key":"ref31","first-page":"1295","article-title":"A general approach to multi-armed bandits under risk criteria","volume-title":"Proc. 31st Conf. Learn. Theory","author":"Cassel","year":"2018"},{"key":"ref32","article-title":"Concentration of risk measures: A Wasserstein distance approach","author":"Prashanth","year":"2020"},{"key":"ref33","first-page":"1468","article-title":"Policy gradient for coherent risk measures","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Tamar","year":"2015"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2022.3159748"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1561\/2200000050"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.3150\/19-BEJ1151"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/10056266\/09736646.pdf?arnumber=9736646","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,18]],"date-time":"2024-01-18T00:44:37Z","timestamp":1705538677000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9736646\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3]]},"references-count":36,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tac.2022.3159748","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":[[2023,3]]}}}