{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T08:35:14Z","timestamp":1730277314568,"version":"3.28.0"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,2,2]],"date-time":"2020-02-02T00:00:00Z","timestamp":1580601600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,2,2]],"date-time":"2020-02-02T00:00:00Z","timestamp":1580601600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,2,2]],"date-time":"2020-02-02T00:00:00Z","timestamp":1580601600000},"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":[[2020,2,2]]},"DOI":"10.1109\/ita50056.2020.9244974","type":"proceedings-article","created":{"date-parts":[[2020,11,6]],"date-time":"2020-11-06T17:10:58Z","timestamp":1604682658000},"page":"1-19","source":"Crossref","is-referenced-by-count":0,"title":["Residual Based Sampling for Online Low Rank Approximation"],"prefix":"10.1109","author":[{"given":"Aditya","family":"Bhaskara","sequence":"first","affiliation":[]},{"given":"Silvio","family":"Lattanzi","sequence":"additional","affiliation":[]},{"given":"Sergei","family":"Vassilvitskii","sequence":"additional","affiliation":[]},{"given":"Morteza","family":"Zadimoghaddam","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","first-page":"156:1","article-title":"Provably correct algorithms for matrix column subset selection with selectively sampled data","volume":"18","author":"wang","year":"2017","journal-title":"Journal of Machine Learning Research"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.1991.139758"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.106"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.37"},{"key":"ref34","first-page":"1481","article-title":"Randomized PCA algorithms with regret bounds that are logarithmic in the dimension","author":"warmuth","year":"2006","journal-title":"Advances in Neural Information Processing Systems 19 Proceedings of the Twentieth Annual Conference on Neural Information Processing Systems Vancouver British Columbia Canada December 4-7 2006"},{"key":"ref10","first-page":"7:1","article-title":"Online row sampling","author":"cohen","year":"2016","journal-title":"Approximation Randomization and Combinatorial Optimization Algorithms and Techniques APPROX\/RANDOM 2016 September 7-9 2016"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.38"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109681"},{"key":"ref13","first-page":"292","article-title":"Adaptive sampling and fast low-rank matrix approximation","author":"deshpande","year":"2006","journal-title":"Approximation Randomization and Combinatorial Optimization Algorithms and Techniques 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems APPROX 2006 and 10th International Workshop on Randomization and Computation RANDOM 2006 Barcelona Spain August 28-30 2006 Proceedings"},{"key":"ref14","first-page":"223","article-title":"Pass efficient algorithms for approximating large matrices","author":"drineas","year":"2003","journal-title":"Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms January 12-14 2003"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743487"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.53"},{"journal-title":"Chernoff Bounds and Some Applications","year":"2015","author":"goemans","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.95"},{"key":"ref19","first-page":"1129","article-title":"Online with spectral bounds","author":"karnin","year":"2015","journal-title":"Proceedings of The 28th Conference on Learning Theory COLT 2015 Paris France July 3-6 2015"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1038\/nature07331"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.21"},{"key":"ref27","first-page":"173:1","article-title":"Online PCA with optimal regret","volume":"17","author":"nie","year":"2016","journal-title":"Journal of Machine Learning Research"},{"key":"ref3","first-page":"3174","article-title":"The fast convergence of incremental PCA","author":"balsubramani","year":"2013","journal-title":"Advances in Neural Information Processing Systems 26 27th Annual Conference on Neural Information Processing Systems 2013 Proceedings of a meeting held December 5-8 2013"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.105"},{"key":"ref29","first-page":"406","article-title":"Column selection via adaptive sampling","author":"paul","year":"2015","journal-title":"Advances in Neural Information Processing Systems 28 Annual Conference on Neural Information Processing Systems 2015 December 712 2015"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.61"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536445"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/140977898"},{"key":"ref2","first-page":"1027","article-title":"K-means++: The advantages of careful seeding","author":"arthur","year":"2007","journal-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms SODA ’07"},{"key":"ref9","first-page":"1758","article-title":"Input sparsity time low-rank approximation via ridge leverage score sampling","author":"cohen","year":"2017","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref1","first-page":"1815","article-title":"Stochastic optimization of PCA with capped MSG","author":"arora","year":"2013","journal-title":"Advances in Neural Information Processing Systems 26 27th Annual Conference on Neural Information Processing Systems 2013 Proceedings of a meeting held December 5-8 2013"},{"key":"ref20","first-page":"1994","article-title":"Bandit principal component analysis","author":"kotlowski","year":"2019","journal-title":"Conference on Learning Theory COLT 2019 25-28 June 2019"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487623"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.35"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0709640104"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974317.7"},{"key":"ref26","first-page":"2886","article-title":"Memory limited, streaming PCA","author":"mitliagkas","year":"2013","journal-title":"Advances in Neural Information Processing Systems 26 27th Annual Conference on Neural Information Processing Systems 2013 Proceedings of a meeting held December 5-8 2013"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959917"}],"event":{"name":"2020 Information Theory and Applications Workshop (ITA)","start":{"date-parts":[[2020,2,2]]},"location":"San Diego, CA, USA","end":{"date-parts":[[2020,2,7]]}},"container-title":["2020 Information Theory and Applications Workshop (ITA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9244865\/9244867\/09244974.pdf?arnumber=9244974","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T17:51:09Z","timestamp":1656438669000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9244974\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,2]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/ita50056.2020.9244974","relation":{},"subject":[],"published":{"date-parts":[[2020,2,2]]}}}