{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T01:51:11Z","timestamp":1767923471130,"version":"3.49.0"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2015,6,1]],"date-time":"2015-06-01T00:00:00Z","timestamp":1433116800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000006","name":"ONR","doi-asserted-by":"publisher","award":["N00014-11-1002"],"award-info":[{"award-number":["N00014-11-1002"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"AFOSR","doi-asserted-by":"publisher","award":["FA9550-09-1-0643"],"award-info":[{"award-number":["FA9550-09-1-0643"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Top. Signal Process."],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/jstsp.2015.2400412","type":"journal-article","created":{"date-parts":[[2015,2,5]],"date-time":"2015-02-05T20:00:44Z","timestamp":1423166444000},"page":"612-624","source":"Crossref","is-referenced-by-count":14,"title":["Designing Statistical Estimators That Balance Sample Size, Risk, and Computational Cost"],"prefix":"10.1109","volume":"9","author":[{"given":"John J.","family":"Bruer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joel A.","family":"Tropp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Volkan","family":"Cevher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen R.","family":"Becker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","first-page":"592","article-title":"How to generate random matrices from the classical compact groups","volume":"54","author":"mezzadri","year":"2007","journal-title":"Notices Amer Math Soc"},{"key":"ref32","author":"becker","year":"2012","journal-title":"TFOCS v1 2 user guide"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref30","first-page":"615","article-title":"An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems","volume":"6","author":"toh","year":"2010","journal-title":"Pac J Optim"},{"key":"ref10","first-page":"756","article-title":"Computation-Risk Tradeoffs for Covariance-Thresholded Regression","author":"shender","year":"2013","journal-title":"Proc 30th Intl Conf Machine Learning (ICML-13)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.3150\/12-BEJSP17"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1302293110"},{"key":"ref13","author":"nemirovsky","year":"1983","journal-title":"Problem Complexity and Method Efficiency in Optimization"},{"key":"ref14","first-page":"543","article-title":"A method for solving the convex programming problem with convergence rate <formula formulatype=\"inline\"><tex Notation=\"TeX\">${\\hbox {O}}(1\/{\\hbox {k}}^{2})$<\/tex><\/formula>","volume":"269","author":"nesterov","year":"1983","journal-title":"Dokl Akad Nauk SSSR"},{"key":"ref15","author":"tseng","year":"2008","journal-title":"?On accelerated proximal gradient methods for convex-concave optimization ?"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0552-5"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/100818327"},{"key":"ref18","author":"rockafellar","year":"1997","journal-title":"Variational Analysis"},{"key":"ref19","author":"nesterov","year":"2007","journal-title":"Gradient methods for minimizing composite objective function"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-08-02189-3"},{"key":"ref4","article-title":"Sharp MSE bounds for proximal denoising","author":"oymak","year":"2013","journal-title":"ArXiv 1305 2714v5"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/120863290"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iau005"},{"key":"ref6","article-title":"Oracle inequalities for computationally adaptive model selection","author":"agarwal","year":"2012","journal-title":"ArXiv"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"93","DOI":"10.4310\/CMS.2010.v8.n1.a6","article-title":"Fast linearized Bregman iteration for compressive sensing and sparse denoising","volume":"8","author":"osher","year":"2010","journal-title":"Commun Math Sci"},{"key":"ref5","first-page":"161","article-title":"The tradeoffs of large scale learning","author":"bottou","year":"2008","journal-title":"Proc Adv Neural Inf Process Syst 20 (NIPS ?07)"},{"key":"ref8","article-title":"Computational lower bounds for sparse PCA","author":"berthet","year":"2013","journal-title":"ArXiv 1304 0828v2"},{"key":"ref7","first-page":"1019","article-title":"Using more data to speed-up training time","author":"shalev-shwartz","year":"2012","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref2","first-page":"1664","article-title":"Time?data tradeoffs by aggressive smoothing","author":"bruer","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst 27 (NIPS ?14)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390273"},{"key":"ref9","first-page":"145","article-title":"More data speeds up training time in learning halfspaces over sparse vectors","author":"daniely","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst 26 (NIPS ?13)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-011-0029-5"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623403427823"},{"key":"ref24","first-page":"1309","article-title":"The achievable performance of convex demixing","author":"mccoy","year":"2013","journal-title":"ArXiv"},{"key":"ref23","first-page":"721","article-title":"Constrained convex minimization via model-based excessive gap","author":"tran-dinh","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst 27 (NIPS ?14)"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00503.x"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","article-title":"Regression shrinkage and selection via the Lasso","volume":"58","author":"tibshirani","year":"1996","journal-title":"J Roy Statist Soc Ser B Stat Methodol"}],"container-title":["IEEE Journal of Selected Topics in Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4200690\/7105973\/07031873.pdf?arnumber=7031873","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,7]],"date-time":"2024-06-07T01:36:27Z","timestamp":1717724187000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7031873\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":33,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/jstsp.2015.2400412","relation":{},"ISSN":["1932-4553","1941-0484"],"issn-type":[{"value":"1932-4553","type":"print"},{"value":"1941-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6]]}}}