{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T16:22:36Z","timestamp":1776961356848,"version":"3.51.4"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"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 through CAREER","doi-asserted-by":"publisher","award":["DMS-2239448"],"award-info":[{"award-number":["DMS-2239448"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation through CAREER","doi-asserted-by":"publisher","award":["DMS-2054808"],"award-info":[{"award-number":["DMS-2054808"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation through CAREER","doi-asserted-by":"publisher","award":["HDR TRIPODS CCF-1934924"],"award-info":[{"award-number":["HDR TRIPODS CCF-1934924"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Science Foundation","award":["DMS-2424305"],"award-info":[{"award-number":["DMS-2424305"]}]},{"name":"National Science Foundation","award":["CCF-2205004"],"award-info":[{"award-number":["CCF-2205004"]}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research Multidisciplinary University Research Initiative","doi-asserted-by":"publisher","award":["N00014-20-1-2787"],"award-info":[{"award-number":["N00014-20-1-2787"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1109\/tit.2025.3564227","type":"journal-article","created":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T17:04:58Z","timestamp":1745514298000},"page":"5556-5569","source":"Crossref","is-referenced-by-count":2,"title":["Sharp Convergence Rates for Matching Pursuit"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6484-8682","authenticated-orcid":false,"given":"Jason M.","family":"Klusowski","sequence":"first","affiliation":[{"name":"Department of Operations Research and Financial Engineering (ORFE), Princeton University, Princeton, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1493-4889","authenticated-orcid":false,"given":"Jonathan W.","family":"Siegel","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Texas A&M University, College Station, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/78.258082"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.1995.529037"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/76.554427"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1013203451"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1198\/016214503000125"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450037906X"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02124742"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511762291"},{"key":"ref9","volume-title":"Classification and Regression Trees","author":"Breiman","year":"1984"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.945285"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492900002816"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1214\/009053607000000631"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511623820"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-6886-9"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1993-1152321-6"},{"key":"ref16","first-page":"1","article-title":"A function space view of bounded norm infinite width ReLU nets: The multivariate case","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Ongie"},{"issue":"1","key":"ref17","first-page":"1960","article-title":"Banach space representer theorems for neural networks and ridge splines","volume":"22","author":"Parhi","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/21m1418642"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-022-09595-3"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-023-09626-4"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2874447"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-021-09549-y"},{"issue":"4","key":"ref23","first-page":"493","article-title":"Rate of convergence of pure greedy algorithm","volume":"5","author":"Konyagin","year":"1999","journal-title":"East J. Approx"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1023\/B:MATN.0000043488.98673.79"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1134\/S0081543813010161"},{"issue":"5","key":"ref26","first-page":"1","article-title":"Remarques sur un r\u00e9sultat non publi\u00e9 de B. Maurey","volume":"1981","author":"Pisier","journal-title":"S\u00e9minaire Analyse Fonctionnelle (dit \u2018Maurey-Schwa\u2019)"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176348546"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3147984"},{"key":"ref29","article-title":"Entropy-based convergence rates of greedy algorithms","author":"Li","year":"2023","journal-title":"arXiv:2304.13332"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-003-0533-6"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1070\/IM2009v073n06ABEH002478"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1023\/B:MATN.0000043480.05267.e7"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11045245\/10976388.pdf?arnumber=10976388","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T17:27:34Z","timestamp":1750440454000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10976388\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7]]},"references-count":32,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2025.3564227","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7]]}}}