{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T19:23:34Z","timestamp":1740165814548,"version":"3.37.3"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-11-1-0885"],"award-info":[{"award-number":["N00014-11-1-0885"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1649423"],"award-info":[{"award-number":["1649423"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1109\/tnnls.2016.2631581","type":"journal-article","created":{"date-parts":[[2017,5,17]],"date-time":"2017-05-17T18:25:38Z","timestamp":1495045538000},"page":"2717-2730","source":"Crossref","is-referenced-by-count":0,"title":["RankMap: A Framework for Distributed Learning From Dense Data Sets"],"prefix":"10.1109","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2440-0944","authenticated-orcid":false,"given":"Azalia","family":"Mirhoseini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eva L.","family":"Dyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ebrahim M.","family":"Songhori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Baraniuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farinaz","family":"Koushanfar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Expectation Maximization and Complex Duration Distributions for Continuous Time Bayesian Networks","year":"2012","author":"nodelman","key":"ref39"},{"journal-title":"Introduction to Linear Regression Analysis","year":"2015","author":"montgomery","key":"ref38"},{"key":"ref33","first-page":"285","article-title":"An asynchronous parallel stochastic coordinate descent algorithm","volume":"16","author":"liu","year":"2015","journal-title":"J Mach Learn Res"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2007.19.10.2756"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2001.937679"},{"key":"ref30","first-page":"517","article-title":"Generalized power method for sparse principal component analysis","volume":"11","author":"journ\u00e9e","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/120866580"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2461912.2461914"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"ref34","first-page":"340","article-title":"GraphLab: A new parallel framework for machine learning","author":"low","year":"2010","journal-title":"Proc UAI"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126254"},{"journal-title":"Eigen C++ template library for linear algebra","year":"2015","author":"guennebaud","key":"ref27"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.2307\/1267351"},{"journal-title":"The Light Field Archive","year":"0","key":"ref2"},{"journal-title":"Hyperspectral Remote Sensing Scenes","year":"2014","key":"ref1"},{"key":"ref20","first-page":"243","article-title":"Efficient SVM training using low-rank kernel representations","volume":"2","author":"fine","year":"2002","journal-title":"J Mach Learn Res"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/34.927464"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1262185"},{"key":"ref24","first-page":"567","article-title":"Revisiting the Nyström method for improved large-scale machine learning","author":"gittens","year":"2013","journal-title":"Proc ICML"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767930"},{"key":"ref26","first-page":"521","article-title":"‘N-body’ problems in statistical learning","author":"gray","year":"2001","journal-title":"Proc NIPS"},{"key":"ref25","first-page":"17","article-title":"PowerGraph: Distributed graph-parallel computation on natural graphs","author":"gonzalez","year":"2012","journal-title":"Proc OSDI"},{"key":"ref50","first-page":"10","article-title":"Spark: Cluster computing with working sets","author":"zaharia","year":"2010","journal-title":"Proc HotCloud"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1198\/106186006X113430"},{"key":"ref10","first-page":"113","article-title":"On the impact of kernel approximation on learning accuracy","author":"cortes","year":"2010","journal-title":"Proc TAISTATS"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20042"},{"key":"ref40","first-page":"753","article-title":"Robust sketching for multiple square-root LASSO problems","author":"pham","year":"2015","journal-title":"Proc AISTATS"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"2183","DOI":"10.1117\/12.173207","article-title":"Adaptive time-frequency decompositions","volume":"33","author":"davis","year":"1994","journal-title":"Opt Eng"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109681"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1023\/B:MACH.0000033113.59016.96"},{"key":"ref16","first-page":"2153","article-title":"On the Nyström method for approximating a Gram matrix for improved kernel-based learning","volume":"6","author":"drineas","year":"2005","journal-title":"J Mach Learn Res"},{"journal-title":"Self-Expressive Decompositions for Matrix Approximation and Clustering","year":"2015","author":"dyer","key":"ref17"},{"key":"ref18","first-page":"2487","article-title":"Greedy feature selection for subspace clustering","volume":"14","author":"dyer","year":"2013","journal-title":"J Mach Learn Res"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.57"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2006.881199"},{"journal-title":"Rankmap APIs","year":"0","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040894"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827596304058"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9045-x"},{"key":"ref49","first-page":"2","article-title":"Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing","author":"zaharia","year":"2012","journal-title":"Proc NSDI"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827596304010"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(72)90013-4"},{"key":"ref45","first-page":"670","article-title":"The curvelet transform for image denoising","volume":"11","author":"starck","year":"2002","journal-title":"IEEE Trans Electron Packag Manuf"},{"key":"ref48","first-page":"689","article-title":"Generalized belief propagation","author":"yedidia","year":"2000","journal-title":"Proc NIPS"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2044470"},{"key":"ref42","first-page":"693","article-title":"HOGWILD: A lock-free approach to parallelizing stochastic gradient descent","author":"recht","year":"2011","journal-title":"Proc NIPS"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2002.1039204"},{"key":"ref44","first-page":"1657","article-title":"Less is more: Nyström computational regularization","author":"rudi","year":"2015","journal-title":"Proc NIPS"},{"key":"ref43","first-page":"1","article-title":"Efficient implementation of the K-SVD algorithm using batch orthogonal matching pursuit","volume":"40","author":"rubinstein","year":"2008","journal-title":"CS Technion"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/5962385\/8392548\/7930416-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/8392548\/07930416.pdf?arnumber=7930416","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:53:08Z","timestamp":1649443988000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7930416\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":51,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2016.2631581","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"type":"print","value":"2162-237X"},{"type":"electronic","value":"2162-2388"}],"subject":[],"published":{"date-parts":[[2018,7]]}}}