{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T23:05:25Z","timestamp":1782169525797,"version":"3.54.5"},"reference-count":19,"publisher":"Informa UK Limited","issue":"1","funder":[{"DOI":"10.13039\/100000001","name":"U.S. National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1618717"],"award-info":[{"award-number":["CCF-1618717"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"U.S. National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1740796"],"award-info":[{"award-number":["CCF-1740796"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2021,1,2]]},"DOI":"10.1080\/10556788.2020.1818081","type":"journal-article","created":{"date-parts":[[2020,9,14]],"date-time":"2020-09-14T07:23:40Z","timestamp":1600068220000},"page":"237-258","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":21,"title":["Inexact SARAH algorithm for stochastic optimization"],"prefix":"10.1080","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6083-606X","authenticated-orcid":false,"given":"Lam M.","family":"Nguyen","sequence":"first","affiliation":[{"name":"IBM Research, Thomas J. Watson Research Center, Yorktown Heights, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3547-1841","authenticated-orcid":false,"given":"Katya","family":"Scheinberg","sequence":"additional","affiliation":[{"name":"School of Operations Research and Information Engineering, Cornell University, Ithaca, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7455-2025","authenticated-orcid":false,"given":"Martin","family":"Tak\u00e1\u010d","sequence":"additional","affiliation":[{"name":"Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"301","published-online":{"date-parts":[[2020,9,14]]},"reference":[{"key":"CIT0001","unstructured":"A. Defazio , \n                     F. Bach , and \n                     S. Lacoste-Julien  ,  SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives, in Proceedings of 28th Conference on Neural Information Processing Systems (NIPS 2014), Montreal, QC, 2014, pp.\u00a01646\u20131654."},{"key":"CIT0002","unstructured":"C. Fang , \n                     C.J. Li , \n                     Z. Lin , and \n                     T. Zhang  ,  Spider:near-optimal non-convex optimization via stochastic path integrated differential estimator, in Proceedings of 32nd Conference on Neural Information Processing Systems (NeurIPS 2018), Montreal, QC, 2018."},{"key":"CIT0003","unstructured":"R. Johnson  and \n                     T. Zhang  ,  Accelerating stochastic gradient descent using predictive variance reduction, in Proceedings of 27th Conference on Neural Information Processing Systems (NIPS 2013), Lake Tahoe, NV, 2013, pp.\u00a0315\u2013323."},{"key":"CIT0004","doi-asserted-by":"crossref","unstructured":"H. Karimi , \n                     J. Nutini , and \n                     M. Schmidt  ,  Linear convergence of gradient and proximal-gradient methods under the Polyak-\u0141ojasiewicz condition, in Machine Learning and Knowledge Discovery in Databases, P. Frasconi, N. Landwehr, G. Manco, and J. Vreeken, eds., Springer International Publishing, Cham, 2016, pp.\u00a0795\u2013811.","DOI":"10.1007\/978-3-319-46128-1_50"},{"key":"CIT0005","unstructured":"J. Kone\u010dn\u00fd  and \n                     P. Richt\u00e1rik  ,  Semi-stochastic gradient descent methods (2013). Available at arXiv:1312.1666 ."},{"key":"CIT0006","unstructured":"N. Le Roux , \n                     M. Schmidt , and \n                     F. Bach  ,  A stochastic gradient method with an exponential convergence rate for finite training sets, in Proceedings of 26th Conference on Neural Information Processing Systems (NIPS 2012), Lake Tahoe, NV, 2012, pp.\u00a02663\u20132671."},{"key":"CIT0007","unstructured":"L. Lei  and \n                     M.I. Jordan  ,  Less than a single pass: stochastically controlled stochastic gradient, in Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, A. Singh and J. Zhu, eds., Proceedings of Machine Learning Research Vol.\u00a054, 20\u201322 April, PMLR, Fort Lauderdale, FL, 2017, pp.\u00a0148\u2013156."},{"key":"CIT0008","unstructured":"L. Lei , \n                     C. Ju , \n                     J. Chen , and \n                     M.I. Jordan  ,  Non-convex finite-sum optimization via SCSG methods, in Proceedings of 31st Conference on Neural Information Processing Systems (NIPS 2017), Long Beach, CA, I. Guyon, U.V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett, eds., Curran Associates, Inc., 2017, pp.\u00a02348\u20132358."},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0706-8"},{"key":"CIT0011","unstructured":"L. Nguyen , \n                     J. Liu , \n                     K. Scheinberg , and \n                     M. Tak\u00e1\u010d  ,  SARAH: A novel method for machine learning problems using stochastic recursive gradient, in Proceedings of 34th International Conference on Machine Learning (ICML 2017), Sydney, 2017, pp.\u00a02613\u20132621."},{"key":"CIT0012","unstructured":"L.M. Nguyen , \n                     J. Liu , \n                     K. Scheinberg , and \n                     M. Tak\u00e1c  ,  Stochastic recursive gradient algorithm for nonconvex optimization, CoRR (2017). Available at abs\/1705.07261 ."},{"key":"CIT0013","unstructured":"L. Nguyen , \n                     N. Nguyen , \n                     D. Phan , \n                     J. Kalagnanam , and \n                     K. Scheinberg  ,  When does stochastic gradient algorithm work well? (2018). Available at arXiv:1801.06159 ."},{"key":"CIT0014","unstructured":"L. Nguyen , \n                     P.H. Nguyen , \n                     M. van Dijk , \n                     P. Richt\u00e1rik , \n                     K. Scheinberg , and \n                     M. Tak\u00e1\u010d  ,  SGD and Hogwild! convergence without the bounded gradients assumption, in Proceedings of 35th International Conference on Machine Learning (ICML 2018), Stockholm, 2018."},{"key":"CIT0015","unstructured":"C. Paquette  and \n                     K. Scheinberg  ,  A stochastic line search method with convergence rate analysis, SIAM J. Optim. 30(1) (2020), pp. 349\u2013376."},{"key":"CIT0016","unstructured":"N.H. Pham , \n                     L.M. Nguyen , \n                     D.T. Phan , and \n                     Q. Tran-Dinh  ,  ProxSARAH: An efficient algorithmic framework for stochastic composite nonconvex optimization, J. Mach. Learn. Res. 21 (2020), pp. 1\u201348."},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(64)90137-5"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1030-6"},{"key":"CIT0019","unstructured":"Z. Wang , \n                     K. Ji , \n                     Y. Zhou , \n                     Y. Liang , and \n                     V. Tarokh  ,  Spiderboost: A class of faster variance-reduced algorithms for nonconvex optimization, arXiv preprint (2018). Available at arXiv:1810.10690 ."}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2020.1818081","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,18]],"date-time":"2021-01-18T08:33:59Z","timestamp":1610958839000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2020.1818081"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,14]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1,2]]}},"alternative-id":["10.1080\/10556788.2020.1818081"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2020.1818081","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,14]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2020-01-15","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-08-27","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-09-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}