{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T07:11:53Z","timestamp":1767165113123,"version":"3.48.0"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N000142312503"],"award-info":[{"award-number":["N000142312503"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Department of Defense Navy","award":["N00174201001"],"award-info":[{"award-number":["N00174201001"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Signal Process. Lett."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/lsp.2025.3643361","type":"journal-article","created":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T18:38:42Z","timestamp":1765564722000},"page":"321-325","source":"Crossref","is-referenced-by-count":0,"title":["Shallow Neural Network Training via Atomic Norms and Semidefinite Programming"],"prefix":"10.1109","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-9636-0126","authenticated-orcid":false,"given":"Andrew J.","family":"Christensen","sequence":"first","affiliation":[{"name":"Department of Electrical, and Computer Engineering, University of Iowa, Iowa City, IA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5255-8493","authenticated-orcid":false,"given":"Ananya Sen","family":"Gupta","sequence":"additional","affiliation":[{"name":"Department of Electrical, and Computer Engineering, University of Iowa, Iowa City, IA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"Deep Learning","volume":"1","author":"Goodfellow","year":"2016"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-024-02153-5"},{"key":"ref3","article-title":"Implicit convex regularizers of CNN architectures: Convex optimization of two-and three-layer networks in polynomial time","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Ergen","year":"2021"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2025.3545564"},{"article-title":"A library of mirrors: Deep neural nets in low dimensions are convex Lasso models with reflection features","year":"2024","author":"Zeger","key":"ref5"},{"key":"ref6","first-page":"59761","article-title":"Path regularization: A convexity and sparsity inducing regularization for parallel ReLU networks","volume":"36","author":"Ergen","year":"2023","journal-title":"in Proc. Adv. Neural Inf. Process. Syst."},{"key":"ref7","first-page":"7695","article-title":"Neural networks are convex regularizers: Exact polynomial-time convex optimization formulations for two-layer networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Pilanci","year":"2020"},{"key":"ref8","first-page":"1","article-title":"Exact and relaxed convex formulations for shallow neural autoregressive models","volume-title":"Proc. Int. Conf. Acoust., Speech, Signal Process.","author":"Gupta","year":"2021"},{"key":"ref9","article-title":"Demystifying batch normalization in ReLU networks: Equivalent convex optimization models and implicit regularization","volume-title":"Proc. 10th Int. Conf. Learn. Representations","author":"Ergen","year":"2022"},{"key":"ref10","article-title":"Vector-output ReLU neural network problems are copositive programs: Convex analysis of two layer networks and polynomial-time algorithms","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Sahiner","year":"2021"},{"issue":"1","key":"ref11","first-page":"1929","article-title":"Dropout: A simple way to prevent neural networks from overfitting","volume":"15","author":"Srivastava","year":"2014","journal-title":"J. Mach. Learn. Res."},{"key":"ref12","first-page":"950","article-title":"A simple weight decay can improve generalization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"4","author":"Krogh","year":"1991"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.914731"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2277451"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2273443"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2008.5074571"},{"issue":"12","key":"ref19","first-page":"3413","article-title":"A simpler approach to matrix completion","volume":"12","author":"Recht","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2184319.2184343"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1190\/geo2014-0369.1"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1002\/mrm.25240"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513535"},{"key":"ref26","first-page":"2287","article-title":"Spectral regularization algorithms for learning large incomplete matrices","volume":"11","author":"Mazumder","year":"2010","journal-title":"J. Mach. Learn. Res."},{"key":"ref27","first-page":"1329","article-title":"Maximum-margin matrix factorization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"17","author":"Srebro"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2294644"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2001.945730"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-012-9135-7"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6426006"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2019.2962209"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2386283"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00532.x"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/1038003"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"article-title":"Matrix rank minimization with applications","year":"2002","author":"Fazel","key":"ref37"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970777"},{"key":"ref39","first-page":"265","article-title":"On the algorithmic implementation of multiclass kernel-based vector machines","volume":"2","author":"Crammer","year":"2001","journal-title":"J. Mach. Learn. Res."},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-016-0892-3"},{"issue":"83","key":"ref41","first-page":"1","article-title":"CVXPY: A Python-embedded modeling language for convex optimization","volume":"17","author":"Diamond","year":"2016","journal-title":"J. Mach. Learn. Res."}],"container-title":["IEEE Signal Processing Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/97\/11304147\/11298504.pdf?arnumber=11298504","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T07:07:42Z","timestamp":1767164862000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11298504\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/lsp.2025.3643361","relation":{},"ISSN":["1070-9908","1558-2361"],"issn-type":[{"type":"print","value":"1070-9908"},{"type":"electronic","value":"1558-2361"}],"subject":[],"published":{"date-parts":[[2026]]}}}