{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:46:47Z","timestamp":1730274407279,"version":"3.28.0"},"reference-count":33,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437629","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T16:14:55Z","timestamp":1534522495000},"page":"366-370","source":"Crossref","is-referenced-by-count":3,"title":["Low Permutation-Rank Matrices: Structural Properties and Noisy Completion"],"prefix":"10.1109","author":[{"given":"Nihar B.","family":"Shah","sequence":"first","affiliation":[]},{"given":"Sivaraman","family":"Balakrishnan","sequence":"additional","affiliation":[]},{"given":"Martin J.","family":"Wainwright","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","first-page":"2445","article-title":"PU learning for matrix completion","author":"hsieh","year":"2015","journal-title":"International Conference on Machine Learning"},{"key":"ref32","article-title":"Noise-tolerant life-long matrix completion via adaptive sampling","author":"balcan","year":"2016","journal-title":"Advances in neural information processing systems"},{"key":"ref31","article-title":"Provable efficient online matrix completion via non-convex stochastic gradient descent","author":"jin","year":"2016","journal-title":"Advances in neural information processing systems"},{"journal-title":"Streaming memory limited matrix completion with noise","year":"2015","author":"yun","key":"ref30"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104999"},{"key":"ref11","article-title":"Generalization error bounds for collaborative prediction with low-rank matrices","author":"srebro","year":"2005","journal-title":"Advances in neural information processing systems"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref14","first-page":"2057","article-title":"Matrix completion from noisy entries","volume":"11","author":"keshavan","year":"2010","journal-title":"Journal of Machine Learning Research"},{"key":"ref15","first-page":"3413","article-title":"A simpler approach to matrix completion","volume":"12","author":"recht","year":"2011","journal-title":"Journal of Machine Learning Research"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1272"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2634418"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmva.2006.09.003"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1214\/009117905000000044"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","article-title":"Learning the parts of objects by nonnegative matrix factorization","volume":"401","author":"lee","year":"1999","journal-title":"Nature"},{"key":"ref27","first-page":"1665","article-title":"Restricted strong convexity and weighted matrix completion: Optimal bounds with noise","volume":"13","author":"negahban","year":"2012","journal-title":"Journal of Machine Learning Research"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref6","first-page":"249","article-title":"Application of nonnegative matrix factorization to signal-adaptive audio effects","author":"sarver","year":"2011","journal-title":"Proc DAFx"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.3150\/12-BEJ486"},{"key":"ref5","article-title":"Application of non-negative matrix factorization to fluorescence spectroscopy","author":"gobinet","year":"2004","journal-title":"European Signal Processing Conference"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2539100"},{"key":"ref7","article-title":"The why and how of nonnegative matrix factorization","volume":"12","author":"gillis","year":"2014","journal-title":"Regularization Optimization Kernels and Support Vector Machines"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-48332-7_271"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2249572"},{"journal-title":"Low permutation-rank matrices Structural properties and noisy completion","year":"2017","author":"shah","key":"ref1"},{"journal-title":"Learning from people","year":"2017","author":"shah","key":"ref20"},{"journal-title":"A permutation-based model for crowd labeling Optimal estimation and robustness","year":"2016","author":"shah","key":"ref22"},{"key":"ref21","article-title":"Simple, robust and optimal ranking from pairwise comparisons","author":"shah","year":"2018","journal-title":"Journal of Machine Learning Research"},{"journal-title":"Active ranking from pairwise comparisons and when parametric assumptions don't help","year":"2016","author":"heckel","key":"ref24"},{"journal-title":"IEEE International Symposium on Information Theory","article-title":"Feeling the Bern: Adaptive estimators for Bernoulli probabilities of pairwise comparisons","year":"2016","key":"ref23"},{"journal-title":"Optimal rates of statistical seriation","year":"2016","author":"flammarion","key":"ref26"},{"journal-title":"On estimation in tournaments and graphs under monotonicity constraints","year":"2016","author":"chatterjee","key":"ref25"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437629.pdf?arnumber=8437629","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T23:47:22Z","timestamp":1598226442000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437629\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437629","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}