{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T07:53:43Z","timestamp":1764402823913,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1109\/globalsip.2017.8309172","type":"proceedings-article","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T16:33:04Z","timestamp":1520872384000},"page":"1305-1309","source":"Crossref","is-referenced-by-count":2,"title":["Exploiting the structure via sketched gradient algorithms"],"prefix":"10.1109","author":[{"given":"Junqi","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Golbabaee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mike","family":"Davies","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"123","article-title":"Randomized algorithms for matrices and data","volume":"3","author":"michael","year":"2011","journal-title":"Foundations and Trends\ufffd in Machine Learning"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s00211-010-0331-6","article-title":"Faster least squares approximation","volume":"117","author":"petros","year":"2011","journal-title":"Numerische Mathematik"},{"key":"ref12","article-title":"Sharp time-data tradeoffs for linear inverse problems","author":"oymak","year":"2015","journal-title":"ArXiv Preprint"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1007\/s10208-012-9135-7","article-title":"The convex geometry of linear inverse problems","volume":"12","author":"venkat","year":"2012","journal-title":"Foundations of Computational Mathematics"},{"key":"ref14","article-title":"Ex-ploiting the structure via sketched gradient algorithms","author":"tang","year":"2017","journal-title":"ArXiv Preprint"},{"key":"ref15","article-title":"Gradient methods for minimizing composite objective function","author":"nesterov","year":"2007","journal-title":"UCLA Technical Report"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-008-9110-x"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/060673096"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2559902"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2009.2028250"},{"key":"ref3","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":"Advances in neural information processing systems"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2450722"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488620"},{"key":"ref8","first-page":"1","article-title":"Iterative hessian sketch: Fast and accurate solution approximation for constrained least-squares","volume":"17","author":"pilanci","year":"2016","journal-title":"Journal of Machine Learning Research"},{"key":"ref7","article-title":"Newton sketch: A linear-time optimization algorithm with linear-quadratic convergence","author":"pilanci","year":"2015","journal-title":"ArXiv Preprint"},{"key":"ref2","first-page":"315","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","author":"johnson","year":"2013","journal-title":"Advances in Neural Information Processing Systems 26"},{"key":"ref1","article-title":"Gra-dient projection iterative sketch for large scale constrained least-squares","author":"tang","year":"2017","journal-title":"ArXiv Preprint"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2007.910281"}],"event":{"name":"2017 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","start":{"date-parts":[[2017,11,14]]},"location":"Montreal, QC","end":{"date-parts":[[2017,11,16]]}},"container-title":["2017 IEEE Global Conference on Signal and Information Processing (GlobalSIP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8303183\/8308583\/08309172.pdf?arnumber=8309172","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,12]],"date-time":"2019-10-12T14:48:28Z","timestamp":1570891708000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8309172\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/globalsip.2017.8309172","relation":{},"subject":[],"published":{"date-parts":[[2017,11]]}}}