{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:59:45Z","timestamp":1773377985466,"version":"3.50.1"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849782","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"1867-1871","source":"Crossref","is-referenced-by-count":0,"title":["Provable Subspace Tracking with Missing Entries"],"prefix":"10.1109","author":[{"given":"Praneeth","family":"Narayanamurthy","sequence":"first","affiliation":[{"name":"Iowa State University, Ames, IA"}]},{"given":"Vahid","family":"Daneshpajooh","sequence":"additional","affiliation":[{"name":"Iowa State University, Ames, IA"}]},{"given":"Namrata","family":"Vaswani","sequence":"additional","affiliation":[{"name":"Iowa State University, Ames, IA"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2018.2877405"},{"key":"ref11","article-title":"Streaming pca with many missing entries","author":"mitliagkas","year":"2014","journal-title":"Preprint"},{"key":"ref12","first-page":"1821","article-title":"Subspace learning with partial information","volume":"17","author":"gonen","year":"2016","journal-title":"The Journal of Machine Learning Research"},{"key":"ref13","article-title":"Subspace tracking from missing and outlier corrupted data","author":"narayanamurthy","year":"2018","journal-title":"arXiv preprint arXiv 1810 03051 (submitted to IEEE Trans Sig Proc )"},{"key":"ref14","article-title":"Provable memory-efficient online robust matrix completion","author":"narayanamurthy","year":"2019","journal-title":"ICASSP"},{"key":"ref15","article-title":"Online (and Offline) Robust PCA: Novel Algorithms and Performance Guarantees","author":"zhan","year":"2016","journal-title":"Int Conf Artificial Intelligence and Statistics (AISTATS)"},{"key":"ref16","first-page":"1","article-title":"Subspace learning with partial information","volume":"17","author":"gonen","year":"2016","journal-title":"Journal of Machine Learning Research"},{"key":"ref17","first-page":"717","article-title":"Exact matrix completion via convex optimization","author":"candes","year":"2008","journal-title":"Found of Comput Math"},{"key":"ref18","first-page":"1007","article-title":"Fast exact matrix completion with finite samples","author":"jain","year":"2015","journal-title":"Conference on Learning Theory"},{"key":"ref19","first-page":"4520","article-title":"Provable efficient online matrix completion via non-convex stochastic gradient descent","author":"jin","year":"2016","journal-title":"Neural Information Processing Systems"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1109\/78.365290","article-title":"Projection approximation subspace tracking","author":"yang","year":"1995","journal-title":"IEEE Trans Sig Proc"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2847041"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2282910"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0165-1684(96)00008-4"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-014-9227-7"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706976"},{"key":"ref2","first-page":"3701","article-title":"Nearly optimal robust subspace tracking","author":"narayanamurthy","year":"2018","journal-title":"International Conference on Machine Learning"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2331344"},{"key":"ref9","article-title":"Global convergence of a grassmannian gradient descent algorithm for subspace estimation","author":"zhang","year":"2016","journal-title":"AISTATS"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437331"},{"key":"ref21","article-title":"Nearly-optimal robust matrix completion","author":"cherapanamjeri","year":"2016","journal-title":"ICML"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849782.pdf?arnumber=8849782","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:46Z","timestamp":1773347746000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849782\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849782","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}