{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T15:34:18Z","timestamp":1774020858182,"version":"3.50.1"},"reference-count":32,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834568","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"1378-1383","source":"Crossref","is-referenced-by-count":12,"title":["Sufficient Statistic Memory Approximate Message Passing"],"prefix":"10.1109","author":[{"given":"Lei","family":"Liu","sequence":"first","affiliation":[{"name":"Japan Institute of Science and Technology (JAIST),School of Information Science,Nomi,Japan,923-1292"}]},{"given":"Shunqi","family":"Huang","sequence":"additional","affiliation":[{"name":"Japan Institute of Science and Technology (JAIST),School of Information Science,Nomi,Japan,923-1292"}]},{"given":"Brian M.","family":"Kurkoski","sequence":"additional","affiliation":[{"name":"Japan Institute of Science and Technology (JAIST),School of Information Science,Nomi,Japan,923-1292"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iay021"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989237"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9415050"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2015.7178325"},{"key":"ref11","article-title":"Approximate message passing with unitary transformation","author":"guo","year":"2015"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2653119"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2916359"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2947058"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2250578"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437522"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1209\/epl\/i2006-10380-5"},{"key":"ref18","article-title":"Capacity optimality of OAMP: Beyond IID sensing matrices and Gaussian signaling","author":"liu","year":"2021"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3077471"},{"key":"ref28","article-title":"PCA initialization for approximate message passing in rotationally invariant models","author":"mondelli","year":"0"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1073\/pnas.0909892106","article-title":"Message-passing algorithms for compressed sensing","volume":"106","author":"donoho","year":"2009","journal-title":"Proc Nat Acad Sci"},{"key":"ref27","article-title":"Asymptotic errors for teacher-student convex generalized linear models (or: How to prove Kabashima’s replica formula)","author":"gerbelot","year":"0"},{"key":"ref3","article-title":"Optimum multi-user signal detection","author":"verd\u00fa","year":"1984","journal-title":"Ph D Dissertation"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2891664"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2913109"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094817"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3083748"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2990880"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.915688"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2619373"},{"key":"ref1","article-title":"Sufficient Statistic Memory AMP","author":"liu","year":"2022"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/49\/11\/114002"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518123"},{"key":"ref21","article-title":"Approximate message passing algorithms for rotationally invariant matrices","author":"fan","year":"2020"},{"key":"ref24","article-title":"On the convergence of orthogonal\/vector AMP: Long-memory message-passing strategy","author":"takeuchi","year":"2021"},{"key":"ref23","article-title":"Memory AMP","author":"liu","year":"2020","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2018.2878720"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2016.2585481"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834568.pdf?arnumber=9834568","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:26Z","timestamp":1773347786000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834568\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834568","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}