{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:55:50Z","timestamp":1730274950051,"version":"3.28.0"},"reference-count":40,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/isit.2015.7282774","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T22:09:52Z","timestamp":1443737392000},"page":"1841-1845","source":"Crossref","is-referenced-by-count":6,"title":["Poisson matrix completion"],"prefix":"10.1109","author":[{"given":"Yang","family":"Cao","sequence":"first","affiliation":[]},{"given":"Yao","family":"Xie","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","volume":"8","author":"pollard","year":"2002","journal-title":"A user's guide to measure theoretic probability"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20212-4"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2500192"},{"key":"ref32","article-title":"Low rank matrix completion with exponential family noise","author":"lafond","year":"2015","journal-title":"arXiv preprint arXiv 1502 06919"},{"key":"ref31","first-page":"37","article-title":"Fast global convergence rates of gradient methods for high-dimensional statistical recovery","author":"agarwal","year":"2010","journal-title":"Advances in neural information processing systems"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-statistics-022513-115643"},{"key":"ref37","article-title":"Robust computation of linear models, or how to find a needle in a haystack","author":"lerman","year":"2012","journal-title":"arXiv preprint arXiv 1202 4044"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2014.7032144"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2012.08.010"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1880-7_29"},{"key":"ref11","first-page":"3413","article-title":"A simpler approach to matrix completion","volume":"12","author":"recht","year":"2011","journal-title":"The Journal of Machine Learning Research"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref13","article-title":"Fast convex optimization algorithms for exact recovery of a corrupted low-rank matrix","volume":"61","author":"lin","year":"2009","journal-title":"Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)"},{"key":"ref14","first-page":"2287","article-title":"Spectral regularization algorithms for learning large incomplete matrices","volume":"11","author":"mazumder","year":"2010","journal-title":"The Journal of Machine Learning Research"},{"key":"ref15","first-page":"952","article-title":"Matrix completion from noisy entries","author":"keshavan","year":"2009","journal-title":"Advances in neural information processing systems"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOS850"},{"key":"ref18","first-page":"1665","article-title":"Restricted strong convexity and weighted matrix completion: Optimal bounds with noise","volume":"13","author":"negahban","year":"2012","journal-title":"The Journal of Machine Learning Research"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOS860"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-statistics-022513-115643"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6638814"},{"key":"ref27","article-title":"Composite self-concordant minimization","author":"tran-dinh","year":"2014","journal-title":"Journal of Machine Learning Research"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/9780470443736"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553434"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref2","article-title":"Netflix","author":"sigkdd","year":"2007","journal-title":"Proceedings of KDD Cup and Workshop"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2010.5495899"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iau006"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2014.7032147"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875184"},{"key":"ref21","article-title":"Noisy matrix completion under sparse factor models","author":"soni","year":"2014","journal-title":"arXiv preprint arXiv 1411 0282"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2157913"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2049997"},{"key":"ref26","article-title":"A proximal newton framework for composite minimization: Graph learning without cholesky decomposition and matrix inversions","author":"tran-dinh","year":"2013","journal-title":"Proc Int Conf Machine Learn (ICML)"},{"key":"ref25","article-title":"Minimax optimal rates for poisson inverse problems with physical constraints","author":"jiang","year":"2014","journal-title":"arXiv preprint arXiv 1403 6532"}],"event":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2015,6,14]]},"location":"Hong Kong, Hong Kong","end":{"date-parts":[[2015,6,19]]}},"container-title":["2015 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7270906\/7282397\/07282774.pdf?arnumber=7282774","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T20:54:49Z","timestamp":1490388889000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7282774\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/isit.2015.7282774","relation":{},"subject":[],"published":{"date-parts":[[2015,6]]}}}