{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:24Z","timestamp":1740131664044,"version":"3.37.3"},"reference-count":71,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF","award":["DMS CAREER 2239234"],"award-info":[{"award-number":["DMS CAREER 2239234"]}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"crossref","award":["N00014-23-1-2489"],"award-info":[{"award-number":["N00014-23-1-2489"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"crossref","award":["FA9950-23-1-0429"],"award-info":[{"award-number":["FA9950-23-1-0429"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Harvard Faculty of Arts and Sciences (FAS) Dean's Competitive Fund Award"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1109\/tit.2024.3486685","type":"journal-article","created":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T17:33:54Z","timestamp":1730136834000},"page":"565-591","source":"Crossref","is-referenced-by-count":0,"title":["Bayes Optimal Learning in High-Dimensional Linear Regression With Network Side Information"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7665-3214","authenticated-orcid":false,"given":"Sagnik","family":"Nandy","sequence":"first","affiliation":[{"name":"Department of Statistics, The University of Chicago, Chicago, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3202-6016","authenticated-orcid":false,"given":"Subhabrata","family":"Sen","sequence":"additional","affiliation":[{"name":"Department of Statistics, Harvard University, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"issue":"1","key":"ref1","first-page":"6446","article-title":"Community detection and stochastic block models: Recent developments","volume":"18","author":"Abbe","year":"2017","journal-title":"J. Mach. Learn. Res."},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1016\/j.cell.2014.09.050"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1214\/14-AOS1208"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1214\/15-AOS1337"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1073\/pnas.1802705116"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1007\/s00440-018-0879-0"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/TIT.2020.2990880"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1214\/14-AAP1010"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/TIT.2010.2094817"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1214\/19-AIHP1033"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1111\/j.2517-6161.1995.tb02031.x"},{"key":"ref12","first-page":"48","article-title":"Reducibility and computational lower bounds for problems with planted sparse structure","volume-title":"Proc. Conf. Learn. Theory","author":"Brennan"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/TIT.2020.3025272"},{"key":"ref14","article-title":"A non-asymptotic analysis of generalized approximate message passing algorithms with right rotationally invariant designs","author":"Cademartori","year":"2023","journal-title":"arXiv:2302.00088"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1111\/rssb.12265"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1214\/21-AOS2100"},{"key":"ref17","first-page":"1078","article-title":"The estimation error of general first order methods","volume-title":"Proc. Conf. Learn. Theory","author":"Celentano"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1137\/S003614450037906X"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1214\/21-EJP604"},{"key":"ref20","first-page":"7089","article-title":"On double-descent in uncertainty quantification in overparametrized models","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Clart\u00e9"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1103\/PhysRevE.84.066106"},{"key":"ref22","article-title":"Light-speed inference of genetic effects via approximate message passing","author":"Depope","year":"2023","journal-title":"BioRxiv"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1093\/imaiai\/iaw017"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1109\/FOCS.2017.16"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1109\/TIT.2013.2274513"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1214\/23-aop1628"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1561\/2200000092"},{"key":"ref28","article-title":"Graph-based approximate message passing iterations","author":"Gerbelot","year":"2021","journal-title":"arXiv:2109.11905"},{"key":"ref29","article-title":"Learning with latent group sparsity via heat flow dynamics on networks","author":"Ghosh","year":"2022","journal-title":"arXiv:2201.08326"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1109\/TIT.2011.2111010"},{"key":"ref31","first-page":"899","article-title":"Computational lower bounds for community detection on random graphs","volume-title":"Proc. Conf. Learn. Theory","author":"Hajek"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1017\/jpr.2018.22"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1016\/j.cell.2014.06.049"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1214\/22-EJS2092"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1214\/11-AOS897"},{"key":"ref36","first-page":"1115","article-title":"Optimal rates for total variation denoising","volume-title":"Proc. Conf. Learn. Theory","author":"H\u00fctter"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1214\/009053604000001147"},{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.1111\/rssb.12203"},{"doi-asserted-by":"publisher","key":"ref39","DOI":"10.1007\/978-3-030-97127-4_1"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1038\/ng.3168"},{"doi-asserted-by":"publisher","key":"ref41","DOI":"10.1214\/10-AOAS332"},{"doi-asserted-by":"publisher","key":"ref42","DOI":"10.1214\/10-AOAS332"},{"key":"ref43","article-title":"A non-asymptotic framework for approximate message passing in spiked models","author":"Li","year":"2022","journal-title":"arXiv:2208.03313"},{"key":"ref44","article-title":"Minimum \u21131-norm interpolators: Precise asymptotics and multiple descent","author":"Li","year":"2021","journal-title":"arXiv:2110.09502"},{"doi-asserted-by":"publisher","key":"ref45","DOI":"10.1109\/ISIT.2019.8849735"},{"key":"ref46","first-page":"18137","article-title":"Learning curves of generic features maps for realistic datasets with a teacher\u2013student model","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Loureiro"},{"doi-asserted-by":"publisher","key":"ref47","DOI":"10.1109\/TIT.2023.3238352"},{"doi-asserted-by":"publisher","key":"ref48","DOI":"10.1109\/ISIT.2017.8006899"},{"doi-asserted-by":"publisher","key":"ref49","DOI":"10.1007\/s10955-015-1338-2"},{"doi-asserted-by":"publisher","key":"ref50","DOI":"10.1214\/20-AOS1958"},{"doi-asserted-by":"publisher","key":"ref51","DOI":"10.1007\/s00440-024-01322-z"},{"key":"ref52","article-title":"Stochastic block models and reconstruction","author":"Mossel","year":"2012","journal-title":"arXiv:1202.1499"},{"doi-asserted-by":"publisher","key":"ref53","DOI":"10.1093\/acprof:oso\/9780198570837.001.0001"},{"doi-asserted-by":"publisher","key":"ref54","DOI":"10.1038\/nature13480"},{"issue":"1","key":"ref55","first-page":"6410","article-title":"The DFS fused lasso: Linear-time denoising over general graphs","volume":"18","author":"Padilla","year":"2017","journal-title":"J. Mach. Learn. Res."},{"doi-asserted-by":"publisher","key":"ref56","DOI":"10.1198\/016214508000000337"},{"doi-asserted-by":"publisher","key":"ref57","DOI":"10.1109\/TIT.2019.2891664"},{"doi-asserted-by":"publisher","key":"ref58","DOI":"10.1007\/978-1-4612-0919-5_26"},{"doi-asserted-by":"publisher","key":"ref59","DOI":"10.1016\/0167-2789(92)90242-F"},{"doi-asserted-by":"publisher","key":"ref60","DOI":"10.1109\/TIT.2018.2816681"},{"doi-asserted-by":"publisher","key":"ref61","DOI":"10.1214\/22-AOS2179"},{"key":"ref62","first-page":"1028","article-title":"Sparsistency of the edge lasso over graphs","volume-title":"Proc. Artif. Intell. Statist.","author":"Sharpnack"},{"doi-asserted-by":"publisher","key":"ref63","DOI":"10.1007\/978-3-540-45167-9_12"},{"doi-asserted-by":"publisher","key":"ref64","DOI":"10.1214\/aos\/1176345632"},{"doi-asserted-by":"publisher","key":"ref65","DOI":"10.1201\/9781003089018"},{"doi-asserted-by":"publisher","key":"ref66","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"doi-asserted-by":"publisher","key":"ref67","DOI":"10.1111\/j.1467-9868.2005.00490.x"},{"key":"ref68","article-title":"The generalized elastic net for least squares regression with network-aligned signal and correlated design","author":"Tran","year":"2022","journal-title":"arXiv:2211.00292"},{"key":"ref69","article-title":"Universality of approximate message passing algorithms and tensor networks","author":"Wang","year":"2022","journal-title":"arXiv:2206.13037"},{"key":"ref70","first-page":"1042","article-title":"Trend filtering on graphs","volume-title":"Proc. Artif. Intell. Statist.","author":"Wang"},{"doi-asserted-by":"publisher","key":"ref71","DOI":"10.1111\/rssb.12490"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/10816277\/10736623-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/10816277\/10736623.pdf?arnumber=10736623","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,26]],"date-time":"2024-12-26T07:43:17Z","timestamp":1735198997000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10736623\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":71,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2024.3486685","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2025,1]]}}}