{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T06:18:31Z","timestamp":1761718711556,"version":"3.41.2"},"reference-count":35,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1109\/icassp.2018.8462250","type":"proceedings-article","created":{"date-parts":[[2018,9,21]],"date-time":"2018-09-21T22:24:48Z","timestamp":1537568688000},"page":"2226-2230","source":"Crossref","is-referenced-by-count":3,"title":["Global Optimality in Inductive Matrix Completion"],"prefix":"10.1109","author":[{"given":"Mohsen","family":"Ghassemi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anand","family":"Sarwate","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naveen","family":"Goela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"},{"key":"ref32","first-page":"1","article-title":"Rank minimization or nuclear-norm minimization: Are we solving the right problem?","author":"dai","year":"2014","journal-title":"Proc Int Conf Digit Image Comput Techn Applicat (DICTA)"},{"journal-title":"Unicity conditions for low-rank matrix recovery arxiv preprint","year":"2011","author":"eldar","key":"ref31"},{"journal-title":"Linear Algebra Theory and Applications","year":"2008","author":"cheney","key":"ref30"},{"key":"ref35","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780199563074.001.0001","author":"sutherland","year":"2009","journal-title":"Introduction to Metric and Topological Spaces"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2111771"},{"key":"ref10","first-page":"3447","article-title":"Matrix completion with noisy side information","author":"chiang","year":"2015","journal-title":"Proc Int Conf Advances in Neural Inform Process Syst (NIPS)"},{"key":"ref11","first-page":"2990","article-title":"Noisy inductive matrix completion under sparse factor models","author":"soni","year":"2017","journal-title":"IEEE Int Symp Inf Theory (ISIT)"},{"journal-title":"Weighted matrix completion and recovery with prior subspace information","year":"2016","author":"eftekhari","key":"ref12"},{"key":"ref13","first-page":"2107","article-title":"Collaborative filtering with graph information: Consistency and scalable methods","author":"rao","year":"2015","journal-title":"Proc Int Conf Advances in Neural Inform Process Syst (NIPS)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104999"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"journal-title":"Global optimality conditions for deep neural networks","year":"2017","author":"yun","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2011.2151856"},{"key":"ref27","first-page":"586","article-title":"Deep learning without poor local minima","author":"kawaguchi","year":"2016","journal-title":"Proc Int Conf Advances in Neural Inform Process Syst (NIPS)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"journal-title":"How to escape saddle points efficiently","year":"2017","author":"jin","key":"ref29"},{"key":"ref5","first-page":"3413","article-title":"A simpler approach to matrix completion","volume":"12","author":"recht","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-319-24486-0_1","article-title":"Efficient matrix sensing using rank-1 gaussian measurements","author":"zhong","year":"2015","journal-title":"Proceedings Algorithmic Learning Theory (ALT)"},{"key":"ref7","first-page":"2301","article-title":"Speedup matrix completion with side information: Application to multi-label learning","author":"xu","year":"2013","journal-title":"Proc Int Conf Advances in Neural Inform Process Syst (NIPS)"},{"key":"ref2","first-page":"2057","article-title":"Matrix completion from noisy entries","volume":"11","author":"keshavan","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref9","first-page":"4071","article-title":"A sparse interactive model for matrix completion with side information","author":"lu","year":"2016","journal-title":"Proc Int Conf Advances in Neural Inform Process Syst (NIPS)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref20","first-page":"615","article-title":"An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems","volume":"6","author":"toh","year":"2010","journal-title":"Pacific J Optimization"},{"journal-title":"No spurious local minima in nonconvex low rank problems A unified geometric analysis","year":"2017","author":"ge","key":"ref22"},{"key":"ref21","first-page":"797","article-title":"Escaping from saddle points-online stochastic gradient for tensor decomposition","author":"ge","year":"2015","journal-title":"Proc Conf Learn Theory (COLT)"},{"key":"ref24","first-page":"3873","article-title":"Global optimality of local search for low rank matrix recovery","author":"bhojanapalli","year":"2016","journal-title":"Proc Int Conf Advances in Neural Inform Process Syst (NIPS)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2598574"},{"key":"ref26","first-page":"2796","article-title":"Phase retrieval using alternating minimization","author":"netrapalli","year":"2013","journal-title":"Proc Int Conf Advances in Neural Inform Process Syst (NIPS)"},{"journal-title":"Non-square matrix sensing without spurious local minima via the Burer-Monteiro approach","year":"2016","author":"park","key":"ref25"}],"event":{"name":"ICASSP 2018 - 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2018,4,15]]},"location":"Calgary, AB","end":{"date-parts":[[2018,4,20]]}},"container-title":["2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8450881\/8461260\/08462250.pdf?arnumber=8462250","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T18:22:58Z","timestamp":1751998978000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8462250\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/icassp.2018.8462250","relation":{},"subject":[],"published":{"date-parts":[[2018,4]]}}}