{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:53:33Z","timestamp":1760597613149,"version":"3.37.3"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2014,11,1]],"date-time":"2014-11-01T00:00:00Z","timestamp":1414800000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61321491"],"award-info":[{"award-number":["61321491"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N000141210431","N000141410631"],"award-info":[{"award-number":["N000141210431","N000141410631"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1251031"],"award-info":[{"award-number":["IIS-1251031"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1109\/tit.2014.2359204","type":"journal-article","created":{"date-parts":[[2014,9,19]],"date-time":"2014-09-19T19:06:49Z","timestamp":1411153609000},"page":"7300-7316","source":"Crossref","is-referenced-by-count":14,"title":["Random Projections for Classification: A Recovery Approach"],"prefix":"10.1109","volume":"60","author":[{"given":"Lijun","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Mehrdad","family":"Mahdavi","sequence":"additional","affiliation":[]},{"given":"Rong","family":"Jin","sequence":"additional","affiliation":[]},{"given":"Tianbao","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Shenghuo","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1214\/009053605000000282"},{"key":"ref38","first-page":"463","article-title":"Rademacher and Gaussian complexities: Risk bounds and structural results","volume":"3","author":"bartlett","year":"2003","journal-title":"J Mach Learn Res"},{"key":"ref33","first-page":"421","article-title":"Beyond the regret minimization barrier: An optimal algorithm for stochastic strongly-convex optimization","author":"hazan","year":"2011","journal-title":"Proc 24th Annu Conf Learn Theory (COLT)"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2559902"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-008-9110-x"},{"key":"ref30","first-page":"3413","article-title":"A simpler approach to matrix completion","volume":"12","author":"recht","year":"2011","journal-title":"J Mach Learn Res"},{"journal-title":"Estimation of Dependences Based on Empirical Data","year":"1982","author":"vapnik","key":"ref37"},{"key":"ref36","first-page":"161","article-title":"The tradeoffs of large scale learning","author":"bottou","year":"2008","journal-title":"Advances in Neural Information Processing Systems 20"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0629-5"},{"journal-title":"Numerical Optimization","year":"2006","author":"nocedal","key":"ref34"},{"key":"ref10","first-page":"298","article-title":"Random projections for k-means clustering","author":"boutsidis","year":"2010","journal-title":"Advances in Neural Information Processing Systems 23"},{"key":"ref40","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-31256-9","author":"borwein","year":"2006","journal-title":"Convex Analysis and Nonlinear Optimization Theory and Examples"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374452"},{"key":"ref12","first-page":"473","article-title":"Learning the structure of manifolds using random projections","author":"freund","year":"2008","journal-title":"Advances in Neural Information Processing Systems 20"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/564740.564741"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814637"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-7550-1"},{"key":"ref16","first-page":"591","article-title":"Is margin preserved after random projection?","author":"shi","year":"2012","journal-title":"Proc 29th Int Conf Mach Learn"},{"key":"ref17","first-page":"498","article-title":"Random projections for support vector machines","author":"paul","year":"2013","journal-title":"Proc 16th Int Conf Artif Intell Statist"},{"key":"ref18","first-page":"1157","article-title":"An introduction to variable and feature selection","volume":"3","author":"guyon","year":"2003","journal-title":"J Mach Learn Res"},{"article-title":"Lectures in geometric functional analysis","year":"2009","author":"vershynin","key":"ref19"},{"article-title":"On the duality of strong convexity and strong smoothness: Learning applications and matrix regularization","year":"2009","author":"kakade","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/956804.956812"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/11776420_32"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502546"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1117\/12.605553","article-title":"Face recognition experiments with random projection","volume":"5779","author":"goel","year":"2005","journal-title":"Proc SPIE"},{"key":"ref29","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume":"87","author":"nesterov","year":"2004","journal-title":"Introductory Lectures on Convex Optimization A Basic Course"},{"journal-title":"The Random Projection Method","year":"2004","author":"vempala","key":"ref5"},{"key":"ref8","first-page":"2735","article-title":"Linear regression with random projections","volume":"13","author":"maillard","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref7","first-page":"1177","article-title":"Random features for large-scale kernel machines","author":"rahimi","year":"2008","journal-title":"Advances in Neural Information Processing Systems 20"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.1998.682302"},{"key":"ref9","first-page":"186","article-title":"Random projection for high dimensional data clustering: A cluster ensemble approach","author":"fern","year":"2003","journal-title":"Proc 20th Int Conf Mach Learn"},{"key":"ref1","first-page":"135","article-title":"Recovering the optimal solution by dual random projection","author":"zhang","year":"2013","journal-title":"Proc 26th Annu Conf Learn Theory"},{"key":"ref20","first-page":"189","article-title":"Extensions of Lipschitz mappings into a Hilbert space","volume":"26","author":"johnson","year":"1984","journal-title":"Proc Conf Modern Anal Probab"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00025-4"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10073"},{"key":"ref42","doi-asserted-by":"crossref","DOI":"10.21236\/ADA563094","article-title":"Tail bounds for all eigenvalues of a sum of random matrices","author":"gittens","year":"2011"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/3-540-45726-7_19","article-title":"Dimensionality reductions that preserve volumes and distance to affine spaces, and their algorithmic applications","volume":"2483","author":"magen","year":"2002","journal-title":"Randomization and Approximation Techniques in Computer Science"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-6265-7"},{"key":"ref44","doi-asserted-by":"crossref","first-page":"1302","DOI":"10.1214\/aos\/1015957395","article-title":"Adaptive estimation of a quadratic functional by model selection","volume":"28","author":"laurent","year":"2000","journal-title":"Ann Statist"},{"key":"ref26","first-page":"1233","article-title":"Beating SGD: Learning SVMs in sublinear time","author":"hazan","year":"2011","journal-title":"Advances in Neural Information Processing Systems 24"},{"article-title":"A short note on the tail bound of Wishart distribution","year":"2012","author":"zhu","key":"ref43"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6926896\/06905847.pdf?arnumber=6905847","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,17]],"date-time":"2022-04-17T12:44:06Z","timestamp":1650199446000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6905847\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11]]},"references-count":44,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2359204","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2014,11]]}}}