{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T20:41:03Z","timestamp":1772138463218,"version":"3.50.1"},"reference-count":39,"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":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271215"],"award-info":[{"award-number":["12271215"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12326378"],"award-info":[{"award-number":["12326378"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871248"],"award-info":[{"award-number":["11871248"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["82271103"],"award-info":[{"award-number":["82271103"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012151","name":"Sanming Project of Medicine in Shenzhen","doi-asserted-by":"publisher","award":["SZSM202311018"],"award-info":[{"award-number":["SZSM202311018"]}],"id":[{"id":"10.13039\/501100012151","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100021171","name":"Basic and Applied Basic Research Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2022A1515012326"],"award-info":[{"award-number":["2022A1515012326"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Signal Process. Lett."],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/lsp.2024.3426353","type":"journal-article","created":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T17:45:54Z","timestamp":1720633554000},"page":"2035-2039","source":"Crossref","is-referenced-by-count":1,"title":["Stochastic IHT With Stochastic Polyak Step-Size for Sparse Signal Recovery"],"prefix":"10.1109","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-7917-5379","authenticated-orcid":false,"given":"Changhao","family":"Li","sequence":"first","affiliation":[{"name":"Department of Information Science and Technology, Jinan University, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhixin","family":"Ma","sequence":"additional","affiliation":[{"name":"Human Resources Office, Jinan University, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-6434-7912","authenticated-orcid":false,"given":"Dazhi","family":"Sun","sequence":"additional","affiliation":[{"name":"College of Resources and Environmental Engineering, Jilin Institute of Chemical Technology, Jilin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoming","family":"Zhang","sequence":"additional","affiliation":[{"name":"Shenzhen Eye Hospital, Jinan University, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8181-0958","authenticated-orcid":false,"given":"Jinming","family":"Wen","sequence":"additional","affiliation":[{"name":"Department of Information Science and Technology, Jinan University, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.2307\/2337118"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9035-z"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2009.04.002"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2010.2042411"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/100806278"},{"key":"ref6","first-page":"127","article-title":"Gradient hard thresholding pursuit for sparsity-constrained optimization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yuan","year":"2014"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2686880"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3037996"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2022.3172868"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2023.3262184"},{"key":"ref11","first-page":"1175","article-title":"Iterative hard thresholding with adaptive regularization: Sparser solutions without sacrificing runtime","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Axiotis","year":"2022"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.382009"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20042"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2012.08.004"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/18M1219187"},{"issue":"7","key":"ref17","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1109\/TNNLS.2012.2197412","article-title":"${L}_{1\/2}$ regularization: A thresholding representation theory and a fast solver","volume":"23","author":"Xu","year":"2012","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvcir.2012.10.006"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2021.108148"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-021-00370-9"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-022-01143-1"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2749330"},{"key":"ref23","first-page":"917","article-title":"Stochastic variance reduced optimization for nonconvex sparse learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Li","year":"2016"},{"key":"ref24","first-page":"132","article-title":"Accelerated stochastic block coordinate gradient descent for sparsity constrained nonconvex optimization","volume-title":"Proc. 32nd Conf. Uncertainty Artif. Intell.","author":"Chen","year":"2016"},{"key":"ref25","first-page":"1988","article-title":"Efficient stochastic gradient hard thresholding","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhou","year":"2018"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/294"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3087805"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/tsp.2012.2203818"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2011.09.017"},{"key":"ref30","volume-title":"Introduction to Optimization","author":"Polyak","year":"1987"},{"issue":"01","key":"ref31","first-page":"1","article-title":"Subgradient methods","volume-title":"Lecture Notes of EE392o, Stanford Univ., Autumn Quarter","volume":"2004","author":"Boyd","year":"2003"},{"key":"ref32","article-title":"Revisiting the polyak step size","author":"Hazan","year":"2019"},{"key":"ref33","first-page":"1306","article-title":"Stochastic polyak step-size for SGD: An adaptive learning rate for fast convergence","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Loizou","year":"2021"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2023.3238878"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s11425-021-1987-2"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2023.3282440"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553417"},{"issue":"208","key":"ref39","first-page":"1","article-title":"A tight bound of hard thresholding","volume":"18","author":"Shen","year":"2018","journal-title":"J. Mach. Learn. Res."}],"container-title":["IEEE Signal Processing Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/97\/10380231\/10592300.pdf?arnumber=10592300","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T17:41:06Z","timestamp":1724089266000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10592300\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/lsp.2024.3426353","relation":{},"ISSN":["1070-9908","1558-2361"],"issn-type":[{"value":"1070-9908","type":"print"},{"value":"1558-2361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}