{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T03:58:08Z","timestamp":1772251088618,"version":"3.50.1"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Chinese NSF","award":["11671116"],"award-info":[{"award-number":["11671116"]}]},{"name":"Chinese NSF","award":["11701137"],"award-info":[{"award-number":["11701137"]}]},{"name":"Chinese NSF","award":["12071108"],"award-info":[{"award-number":["12071108"]}]},{"name":"Chinese NSF","award":["11631013"],"award-info":[{"award-number":["11631013"]}]},{"name":"Chinese NSF","award":["11991020"],"award-info":[{"award-number":["11991020"]}]},{"name":"Chinese NSF","award":["12021001"],"award-info":[{"award-number":["12021001"]}]},{"DOI":"10.13039\/501100001809","name":"Major Research Plan of the NSFC","doi-asserted-by":"publisher","award":["91630202"],"award-info":[{"award-number":["91630202"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Beijing Academy of Artificial Intelligence"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1109\/tnnls.2020.3025383","type":"journal-article","created":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T19:21:51Z","timestamp":1602012111000},"page":"4627-4638","source":"Crossref","is-referenced-by-count":8,"title":["A Minibatch Proximal Stochastic Recursive Gradient Algorithm Using a Trust-Region-Like Scheme and Barzilai\u2013Borwein Stepsizes"],"prefix":"10.1109","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6860-9435","authenticated-orcid":false,"given":"Tengteng","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9829-3395","authenticated-orcid":false,"given":"Xin-Wei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Hong","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5611-1672","authenticated-orcid":false,"given":"Jie","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"144","article-title":"A stochastic PCA and SVD algorithm with an exponential convergence rate","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Shamir"},{"key":"ref2","first-page":"2626","article-title":"Faster eigenvector computation via shift-and-invert preconditioning","volume-title":"Proc. ICML","author":"Garber"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055448"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139042918"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2014.12.013"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2868835"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02985802"},{"key":"ref8","first-page":"190","article-title":"Bandit theory meets compressed sensing for high dimensional stochastic linear bandit","volume-title":"Proc. 15th Int. Conf. Artif. Intell. Stat","author":"Carpentier"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-016-9854-9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/78.553476"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2672978"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0629-5"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1561\/2400000003"},{"key":"ref15","article-title":"Underestimate sequences via quadratic averaging","author":"Ma","year":"2017","journal-title":"arXiv:1710.03695"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/16M1072528"},{"key":"ref17","article-title":"A geometric alternative to Nesterov\u2019s accelerated gradient descent","author":"Bubeck","year":"2015","journal-title":"arXiv:1506.08187"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"ref19","first-page":"1614","article-title":"Optimal black-box reductions between optimization objectives","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Allen-Zhu"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015332"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/16M1080173"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0839-0"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/140961791"},{"issue":"1","key":"ref25","first-page":"962","article-title":"Importance sampling for minibatches","volume":"19","author":"Csiba","year":"2018","journal-title":"J. Mach. Learn. Res."},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2505682"},{"key":"ref27","first-page":"2613","article-title":"Sarah: A novel method for machine learning problems using stochastic recursive gradient","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","volume":"70","author":"Nguyen"},{"key":"ref28","first-page":"2663","article-title":"A stochastic gradient method with an exponential convergence rate for finite training sets","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Roux"},{"key":"ref29","first-page":"315","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Johnson"},{"key":"ref30","first-page":"1646","article-title":"SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Defazio"},{"key":"ref31","first-page":"685","article-title":"Barzilai\u2013Borwein step size for stochastic gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Tan"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/8.1.141"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1287\/ijoo.2018.0010"},{"key":"ref34","article-title":"Stochastic variance reduced gradient methods using a trust-region-like scheme","author":"Yu","year":"2019"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-17689-5_3"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-020-01550-x"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2003.814255"},{"key":"ref39","article-title":"Linear convergence of variance-reduced stochastic gradient without strong convexity","author":"Gong","year":"2014","journal-title":"arXiv:1406.1102"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46128-1_50"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-016-1058-9"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2017.0889"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.06.002"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/9559436\/09214876.pdf?arnumber=9214876","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T01:19:47Z","timestamp":1706059187000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9214876\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10]]},"references-count":43,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2020.3025383","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10]]}}}