{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T14:21:31Z","timestamp":1781965291645,"version":"3.54.5"},"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":"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\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62302325"],"award-info":[{"award-number":["62302325"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Foundation of Jiangsu Province in China","award":["BK20230485"],"award-info":[{"award-number":["BK20230485"]}]},{"name":"Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1109\/tpami.2025.3528193","type":"journal-article","created":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T20:26:10Z","timestamp":1736540770000},"page":"3067-3078","source":"Crossref","is-referenced-by-count":5,"title":["Adaptive Biased Stochastic Optimization"],"prefix":"10.1109","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8374-2928","authenticated-orcid":false,"given":"Zhuang","family":"Yang","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Soochow University, Suzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.3004354"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.3000512"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1038\/s42256-023-00632-6"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v26i1.8300"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2015617118"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.5555\/2999611.2999647"},{"key":"ref7","first-page":"2663","article-title":"A stochastic gradient method with an exponential convergence rate for finite training sets","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Roux"},{"key":"ref8","first-page":"1646","article-title":"SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Defazio"},{"key":"ref9","first-page":"689","article-title":"SPIDER: Near-optimal non-convex optimization via stochastic path-integrated differential estimator","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Fang"},{"key":"ref10","first-page":"2613","article-title":"SARAH: A novel method for machine learning problems using stochastic recursive gradient","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Nguyen"},{"issue":"24","key":"ref11","first-page":"1","article-title":"On biased stochastic gradient estimation","volume":"23","author":"Driggs","year":"2022","journal-title":"J. Mach. Learn. Res."},{"issue":"110","key":"ref12","first-page":"1","article-title":"ProxSARAH: An efficient algorithmic framework for stochastic composite nonconvex optimization","volume":"21","author":"Pham","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"ref13","first-page":"2406","article-title":"Spiderboost and momentum: Faster variance reduction algorithms","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Wang"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055448"},{"key":"ref15","first-page":"5975","article-title":"A simple stochastic variance reduced algorithm with fast convergence rates","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zhou"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-022-02157-1"},{"issue":"Jul","key":"ref17","first-page":"2121","article-title":"Adaptive subgradient methods for online learning and stochastic optimization","volume":"12","author":"Duchi","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref18","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kingma"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.4135\/9781412983907.n1717"},{"key":"ref20","article-title":"On the convergence of ADAM and beyond","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Reddi"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3280826"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2020.3023660"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2023.3300546"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/140954362"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/7.2.149"},{"issue":"16","key":"ref26","first-page":"35","article-title":"Note on convergence of conjugate direction methods","volume":"3","author":"Polak","year":"1969","journal-title":"Revue Francaise D Informatique De Recherche Operationnelle"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/s1052623497318992"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/030601880"},{"key":"ref29","first-page":"314","article-title":"Stochastic variance reduction for nonconvex optimization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Reddi"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/120880811"},{"key":"ref31","first-page":"148","article-title":"Less than a single pass: Stochastically controlled stochastic gradient","volume-title":"Proc. Conf. Artif. Intell. Statist.","author":"Lei"},{"key":"ref32","first-page":"2345","article-title":"Non-convex finite-sum optimization via SCSG methods","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Lei"},{"key":"ref33","article-title":"Stochastic recursive gradient algorithm for nonconvex optimization","author":"Nguyen","year":"2017"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2868835"},{"key":"ref35","first-page":"2759","article-title":"Biased stochastic first-order methods for conditional stochastic optimization and applications in meta learning","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Hu"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29911-8_26"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108656"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117719"},{"key":"ref39","article-title":"Quasi-hyperbolic momentum and adam for deep learning","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Ma"},{"key":"ref40","first-page":"9633","article-title":"Understanding the role of momentum in stochastic gradient methods","volume-title":"Proc. 33rd Int. Conf. Neural Inf. Process. Syst.","author":"Gitman"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(64)90137-5"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0629-5"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"ref44","first-page":"1895","article-title":"Sub-sampled cubic regularization for non-convex optimization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Kohler"},{"key":"ref45","first-page":"5990","article-title":"Stochastic variance-reduced cubic regularized Newton methods","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zhou"},{"key":"ref46","first-page":"3921","article-title":"Stochastic nested variance reduced gradient descent for nonconvex optimization","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Zhou"},{"issue":"103","key":"ref47","first-page":"1","article-title":"Stochastic nested variance reduction for nonconvex optimization","volume":"21","author":"Zhou","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"ref48","first-page":"6286","article-title":"Page: A simple and optimal probabilistic gradient estimator for nonconvex optimization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Li"},{"key":"ref49","first-page":"4026","article-title":"Stochastic variance-reduced policy gradient","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Papini"},{"key":"ref50","first-page":"541","article-title":"An improved convergence analysis of stochastic variance-reduced policy gradient","volume-title":"Proc. Conf. Uncertainty Artif. Intell.","author":"Xu"},{"key":"ref51","article-title":"Sample efficient policy gradient methods with recursive variance reduction","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xu"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2505682"},{"key":"ref53","article-title":"Decoupled weight decay regularization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Loshchilov"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/34\/10916529\/10836750.pdf?arnumber=10836750","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T18:38:31Z","timestamp":1741372711000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10836750\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4]]},"references-count":53,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2025.3528193","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4]]}}}