{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T05:58:47Z","timestamp":1757311127728,"version":"3.37.3"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"13","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"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"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1566281","CCF-1750920"],"award-info":[{"award-number":["CCF-1566281","CCF-1750920"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2019,7,1]]},"DOI":"10.1109\/tsp.2019.2916743","type":"journal-article","created":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T19:43:56Z","timestamp":1557863036000},"page":"3361-3371","source":"Crossref","is-referenced-by-count":4,"title":["Fast and Provable Algorithms for Learning Two-Layer Polynomial Neural Networks"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4217-9224","authenticated-orcid":false,"given":"Mohammadreza","family":"Soltani","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4574-8066","authenticated-orcid":false,"given":"Chinmay","family":"Hegde","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.75"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2457939"},{"key":"ref33","article-title":"Learning one-hidden-layer neural networks with landscape design","author":"ge","year":"0","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref32","first-page":"61","article-title":"Flavors of compressive sensing","author":"foucart","year":"0","journal-title":"Proc Conf Approx Theory"},{"key":"ref31","first-page":"685","article-title":"On iterative hard thresholding methods for high-dimensional m-estimation","author":"jain","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref30","first-page":"937","article-title":"Guaranteed rank minimization via singular value projection","author":"jain","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"article-title":"The second order linear model","year":"2017","author":"lin","key":"ref37"},{"key":"ref36","first-page":"964","article-title":"Low-rank solutions of linear matrix equations via procrustes flow","author":"tu","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0352-8"},{"article-title":"FASTA: A generalized implementation of forward-backward splitting","year":"2015","author":"goldstein","key":"ref34"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref40","first-page":"1417","article-title":"Towards provable learning of polynomial neural networks using low-rank matrix estimation","author":"soltani","year":"0","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2287673"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2208955"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2620109"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2659644"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1267"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2429594"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2201153"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2352673"},{"article-title":"Fast low-rank matrix estimation without the condition number","year":"2017","author":"soltani","key":"ref28"},{"key":"ref4","article-title":"Symmetry-breaking convergence analysis of certain two-layered neural networks with ReLU nonlinearity","author":"tian","year":"0","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref27","first-page":"4401","article-title":"Fast recovery from a union of subspaces","author":"hegde","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref3","first-page":"1633","article-title":"A non-convex one-pass framework for generalized factorization machine and rank-one matrix sensing","author":"lin","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref6","first-page":"4675","article-title":"Safetynets: Verifiable execution of deep neural networks on an untrusted cloud","author":"ghodsi","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2015.07.007"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2854560"},{"key":"ref8","first-page":"4140","article-title":"Recovery guarantees for one-hidden-layer neural networks","author":"zhong","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"article-title":"Beating the perils of non-convexity: Guaranteed training of neural networks using tensor methods","year":"2015","author":"janzamin","key":"ref7"},{"key":"ref2","first-page":"855","article-title":"On the computational efficiency of training neural networks","author":"livni","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref9","first-page":"597","article-title":"Convergence analysis of two-layer neural networks with ReLU activation","author":"li","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref1","first-page":"1328","article-title":"On the power of over-parametrization in neural networks with quadratic activation","author":"du","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"article-title":"Introduction to the non-asymptotic analysis of random matrices","year":"2010","author":"vershynin","key":"ref46"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2014.2364225"},{"key":"ref45","first-page":"974","article-title":"LazySVD: Even faster SVD decomposition yet without agonizing pain","author":"allen-zhu","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.21432"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2386294"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488620"},{"key":"ref24","first-page":"3","article-title":"Efficient matrix sensing using rank-1 Gaussian measurements","author":"zhong","year":"0","journal-title":"Proc Int Conf Algorithmic Learn Theory"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.6028\/jres.045.026"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2448516"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/080736417"},{"key":"ref26","first-page":"1396","article-title":"Randomized block Krylov methods for stronger and faster approximate singular value decomposition","author":"musco","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref43","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1073\/pnas.0803205106","article-title":"CUR matrix decompositions for improved data analysis","volume":"106","author":"mahoney","year":"0","journal-title":"Proc Nat Acad Sci"},{"key":"ref25","first-page":"329","article-title":"Large-scale convex minimization with a low-rank constraint","author":"shalev-shwartz","year":"0","journal-title":"Proc Int Conf Mach Learn"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/78\/8726053\/8713936-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/8726053\/08713936.pdf?arnumber=8713936","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:45:00Z","timestamp":1657745100000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8713936\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,1]]},"references-count":46,"journal-issue":{"issue":"13"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2019.2916743","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"type":"print","value":"1053-587X"},{"type":"electronic","value":"1941-0476"}],"subject":[],"published":{"date-parts":[[2019,7,1]]}}}