{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T16:39:54Z","timestamp":1778258394709,"version":"3.51.4"},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"The Alan Turing Institute and Weizmann – UK Making Connections Programme","award":["129589"],"award-info":[{"award-number":["129589"]}]},{"name":"National Board for Higher Mathematics (NBHM), Govt. of India","award":["02011\/26\/2023\/NBHM(R.P)\/R&D II\/5867"],"award-info":[{"award-number":["02011\/26\/2023\/NBHM(R.P)\/R&D II\/5867"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/tsp.2024.3412981","type":"journal-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T18:50:38Z","timestamp":1718131838000},"page":"3272-3286","source":"Crossref","is-referenced-by-count":12,"title":["Optimization Guarantees of Unfolded ISTA and ADMM Networks With Smooth Soft-Thresholding"],"prefix":"10.1109","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0743-8315","authenticated-orcid":false,"given":"Shaik Basheeruddin","family":"Shah","sequence":"first","affiliation":[{"name":"Weizmann Institute of Science, Rehovot, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-6807-5195","authenticated-orcid":false,"given":"Pradyumna","family":"Pradhan","sequence":"additional","affiliation":[{"name":"Department of Humanities and Sciences, Indian Institute of Petroleum and Energy, Visakhapatnam, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3632-3082","authenticated-orcid":false,"given":"Wei","family":"Pu","sequence":"additional","affiliation":[{"name":"University of Electronic Science and Technology, Chengdu, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-4044-9782","authenticated-orcid":false,"given":"Ramunaidu","family":"Randhi","sequence":"additional","affiliation":[{"name":"Department of Humanities and Sciences, Indian Institute of Petroleum and Energy, Visakhapatnam, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8908-847X","authenticated-orcid":false,"given":"Miguel R. D.","family":"Rodrigues","sequence":"additional","affiliation":[{"name":"Department of Electronic and Electrical Engineering, University College London, London, U.K."}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4358-5304","authenticated-orcid":false,"given":"Yonina C.","family":"Eldar","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science, Rehovot, Israel"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511794308"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2023.3247480"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/DSLW51110.2021.9523403"},{"key":"ref5","first-page":"399","article-title":"Learning fast approximations of sparse coding","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gregor","year":"2010"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.3016905"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3218802"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2883941"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2022.3230662"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3033334"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/DSW.2019.8755566"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SiPS47522.2019.9020494"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCI.2020.2964202"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.50"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1364\/OE.401925"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TMI.2019.2941271"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2926023"},{"key":"ref18","first-page":"1","article-title":"Generalization and estimation error bounds for model-based neural networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Shultzman","year":"2023"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iaad023"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-09745-4_8"},{"key":"ref21","first-page":"1","article-title":"ALISTA: Analytic weights are as good as learned weights in LISTA","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Liu","year":"2019"},{"key":"ref22","first-page":"9079","article-title":"Theoretical linear convergence of unfolded ISTA and its practical weights and thresholds","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Chen","year":"2018"},{"key":"ref23","first-page":"11678","article-title":"Hyperparameter tuning is all you need for LISTA","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Chen","year":"2021"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-84858-7"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1903070116"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492921000039"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3446776"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/ac3a74"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8121\/ab4c8b"},{"key":"ref30","first-page":"541","article-title":"To understand deep learning we need to understand kernel learning","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"80","author":"Belkin","year":"2018"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2021.12.009"},{"key":"ref32","article-title":"Gradient descent provably optimizes over-parameterized neural networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Du","year":"2019"},{"key":"ref33","first-page":"1675","article-title":"Gradient descent finds global minima of deep neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"97","author":"Du","year":"2019"},{"key":"ref34","first-page":"242","article-title":"A convergence theory for deep learning via over-parameterization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Allen-Zhu","year":"2019"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-019-05839-6"},{"key":"ref36","first-page":"15954","article-title":"On the linearity of large non-linear models: When and why the tangent kernel is constant","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Liu","year":"2020"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-73074-5_5"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP43922.2022.9746860"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1561\/2400000003"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20042"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"issue":"4","key":"ref43","first-page":"643","article-title":"Gradient methods for minimizing functionals","volume":"3","author":"Polyak","year":"1963","journal-title":"Z. Vy\u010disl. Mat. Mat. Fiz."},{"issue":"87\u201389","key":"ref44","first-page":"2","article-title":"A topological property of real analytic subsets","volume":"117","author":"Lojasiewicz","year":"1963","journal-title":"Coll. du CNRS, Les \u00e9quations aux d\u00e9riv\u00e9es partielles"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2021.3129995"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2008.4518347"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/72.925559"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2001.941313"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW53098.2021.00523"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.23919\/EuRAD54643.2022.9924887"},{"key":"ref51","first-page":"1090","article-title":"Learning convolutional feature hierarchies for visual recognition","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"23","author":"Kavukcuoglu","year":"2010"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511794308.006"},{"key":"ref53","first-page":"8580","article-title":"Neural tangent kernel: Convergence and generalization in neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Jacot","year":"2018"},{"key":"ref54","first-page":"8572","article-title":"Wide neural networks of any depth evolve as linear models under gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Lee","year":"2019"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/tsp.2024.3412981"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/78\/10347386\/10553300.pdf?arnumber=10553300","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T04:32:27Z","timestamp":1721709147000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10553300\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":55,"URL":"https:\/\/doi.org\/10.1109\/tsp.2024.3412981","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}