{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T03:38:21Z","timestamp":1761709101792},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1109\/acssc.2014.7094452","type":"proceedings-article","created":{"date-parts":[[2015,4,27]],"date-time":"2015-04-27T20:33:41Z","timestamp":1430166821000},"page":"311-315","source":"Crossref","is-referenced-by-count":9,"title":["Subspace learning from extremely compressed measurements"],"prefix":"10.1109","author":[{"given":"Martin","family":"Azizyan","sequence":"first","affiliation":[]},{"given":"Akshay","family":"Krishnamurthy","sequence":"additional","affiliation":[]},{"given":"Aarti","family":"Singh","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0709640104"},{"key":"ref12","article-title":"User-Friendly Tail Bounds for Sums of Random Matrices","author":"tropp","year":"2011","journal-title":"Foundations of Computational Mathematics"},{"journal-title":"Matrix Computations","year":"1996","author":"golub","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/0707001"},{"key":"ref15","article-title":"Subspace Learning from Extremely Compressed Measurements","author":"krishnamurthy","year":"2014","journal-title":"arXiv 1404 0751"},{"key":"ref4","article-title":"Pass efficient algorithms for approximating large matrices","author":"drineas","year":"2003","journal-title":"ACM-SIAM Symposium on Discrete Algorithms Society for Industrial and Applied Mathematics"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487623"},{"key":"ref6","article-title":"Restricted strong convexity and weighted matrix completion: optimal bounds with noise","author":"negahban","year":"2012","journal-title":"The Journal of Machine Learning Research"},{"key":"ref5","article-title":"A Simpler Approach to Matrix Completion","author":"recht","year":"2011","journal-title":"The Journal of Machine Learning Research"},{"article-title":"The Sample Complexity of Subspace Learning with Partial Information","year":"2014","author":"gonen","key":"ref8"},{"key":"ref7","article-title":"Low-Rank Matrix and Tensor Completion via Adaptive Sampling","author":"krishnamurthy","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.21"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1219092.1219097"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.37"}],"event":{"name":"2014 48th Asilomar Conference on Signals, Systems and Computers","start":{"date-parts":[[2014,11,2]]},"location":"Pacific Grove, CA, USA","end":{"date-parts":[[2014,11,5]]}},"container-title":["2014 48th Asilomar Conference on Signals, Systems and Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7066991\/7094373\/07094452.pdf?arnumber=7094452","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T19:21:32Z","timestamp":1490383292000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7094452\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/acssc.2014.7094452","relation":{},"subject":[],"published":{"date-parts":[[2014,11]]}}}