{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T10:27:46Z","timestamp":1763202466656},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/tpami.2021.3071594","type":"journal-article","created":{"date-parts":[[2021,4,7]],"date-time":"2021-04-07T20:34:21Z","timestamp":1617827661000},"page":"1-1","source":"Crossref","is-referenced-by-count":10,"title":["Variance Reduced Methods for Non-convex Composition Optimization"],"prefix":"10.1109","author":[{"given":"Liu","family":"Liu","sequence":"first","affiliation":[{"name":"Engineering and Information Technologies, University of Sydney, 4334 Sydney, New South Wales, Australia, (e-mail: liu.liu1@sydney.edu.au)"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji","family":"Liu","sequence":"additional","affiliation":[{"name":"Computer Science, University of Rochester, Rochester, New York, United States, (e-mail: ji.liu.uwisc@gmail.com)"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dacheng","family":"Tao","sequence":"additional","affiliation":[{"name":"Engineering and Information Technologies, University of Sydney, 4334 Sydney, New South Wales, Australia, (e-mail: dacheng.tao@sydney.edu.au)"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"1145","article-title":"Proximal stochastic methods for nonsmooth nonconvex finite-sum optimization","author":"reddi","year":"2016"},{"key":"ref38","article-title":"Katyusha X: Practical momentum method for stochastic sum-of-nonconvex optimization","author":"allen-zhu","year":"2018","journal-title":"Int Conf Mach Learn"},{"key":"ref33","first-page":"64","article-title":"Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization","author":"shalev-shwartz","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref32","first-page":"1646","article-title":"SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives","author":"defazio","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref31","first-page":"1","article-title":"Statistical estimation of composite risk functionals and risk optimization problems","author":"dentcheva","year":"2016","journal-title":"Ann Inst Statist Math"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/WSC.2016.7822134"},{"key":"ref37","first-page":"1080","article-title":"Improved SVRG for non-strongly-convex or sum-of-non-convex objectives","author":"allen-zhu","year":"2016","journal-title":"Int Conf Mach Learn"},{"key":"ref36","first-page":"89","article-title":"Natasha: Faster non-convex stochastic optimization via strongly non-convex parameter","year":"2017","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref35","article-title":"Natasha 2: Faster non-convex optimization than SGD","author":"allen-zhu","year":"2017"},{"key":"ref34","first-page":"567","article-title":"Stochastic dual coordinate ascent methods for regularized loss minimization","volume":"14","author":"shalev-shwartz","year":"2013","journal-title":"J Mach Learn Res"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2006.166"},{"key":"ref40","first-page":"2348","article-title":"Non-convex finite-sum optimization via SCSG methods","author":"lei","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2441634"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2405340"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0871-8"},{"key":"ref14","first-page":"315","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","author":"johnson","year":"2013","journal-title":"Neural Inf Process Syst"},{"key":"ref15","first-page":"747","article-title":"SDCA without duality, regularization, and individual convexity","author":"shalev-shwartz","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref16","author":"nesterov","year":"2013","journal-title":"Introductory Lectures on Convex Optimization A Basic Course"},{"key":"ref17","first-page":"1080","article-title":"Improved SVRG for non-strongly-convex or sum-of-non-convex objectives","author":"allen-zhu","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/140961791"},{"key":"ref19","first-page":"314","article-title":"Stochastic variance reduction for nonconvex optimization","author":"reddi","year":"2016","journal-title":"Int Conf Mach Learn"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/17M1114296"},{"key":"ref4","article-title":"Learning from conditional distributions via dual kernel embeddings","author":"dai","year":"2016"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2705429"},{"key":"ref3","first-page":"1714","article-title":"Accelerating stochastic composition optimization","author":"liu","year":"2016","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2858783"},{"key":"ref29","first-page":"379","article-title":"Accelerated proximal gradient methods for nonconvex programming","author":"li","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2650943"},{"key":"ref8","first-page":"1159","article-title":"Finite-sum composition optimization via variance reduced gradient descent","author":"lian","year":"2017","journal-title":"Int Conf Arti Intel Stat"},{"key":"ref7","first-page":"857","article-title":"Stochastic neighbor embedding","author":"hinton","year":"2003","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1017-3"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2012.2205004"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.1998.712192"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2866699"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2016.2578323"},{"key":"ref21","article-title":"Improved incremental first-order oracle complexity of variance reduced methods for nonsmooth convex stochastic composition optimization","author":"lin","year":"2018"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11795"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2672978"},{"key":"ref41","first-page":"148","article-title":"Less than a single pass: Stochastically controlled stochastic gradient","author":"lei","year":"2017","journal-title":"Proc Artif Intell Statist"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2016.2539689"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2487981"},{"key":"ref43","first-page":"2579","article-title":"Visualizing data using t-SNE","volume":"9","author":"maaten","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2733200"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/4359286\/09398583.pdf?arnumber=9398583","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,22]],"date-time":"2022-09-22T20:47:25Z","timestamp":1663879645000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9398583\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/tpami.2021.3071594","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":[[2021]]}}}