{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:52:49Z","timestamp":1773377569854,"version":"3.50.1"},"reference-count":33,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518123","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"1379-1384","source":"Crossref","is-referenced-by-count":21,"title":["Memory Approximate Message Passing"],"prefix":"10.1109","author":[{"given":"Lei","family":"Liu","sequence":"first","affiliation":[{"name":"School of Information Science, Japan Institute of Science and Technology,Japan"}]},{"given":"Shunqi","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Information Science, Japan Institute of Science and Technology,Japan"}]},{"given":"Brian M.","family":"Kurkoski","sequence":"additional","affiliation":[{"name":"School of Information Science, Japan Institute of Science and Technology,Japan"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849321"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437522"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1209\/epl\/i2006-10380-5"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2250578"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2274513"},{"key":"ref11","article-title":"Sparse estimation with the swept approximated message-passing algorithm","author":"manoel","year":"2014","journal-title":"ArXiv Preprint"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2619373"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2015.7178325"},{"key":"ref14","article-title":"Approximate message passing with unitary transformation","volume":"abs 1504 4799","author":"guo","year":"2015","journal-title":"CoRR"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSp.2020.3044847"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2653119"},{"key":"ref17","first-page":"362","article-title":"Expectation propagation for approximate bayesian inference","author":"minka","year":"0","journal-title":"Proceedings of the Seventeenth Conference on Uncertainty in Artificial Intelligence"},{"key":"ref18","first-page":"2177","article-title":"Expectation consistent approximate inference","volume":"6","author":"opper","year":"2005","journal-title":"Journal of Machine Learning Research"},{"key":"ref19","article-title":"Expectation propagation for approximate inference: Free probability framework","author":"\u00e7akmak","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3077471"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094817"},{"key":"ref27","article-title":"Approximate message passing algorithms for rotationally invariant matrices","author":"fan","year":"2020","journal-title":"ArXiv"},{"key":"ref3","author":"verd\u00fa","year":"1984","journal-title":"Optimum multi-user signal detection"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref29","article-title":"State evolution for approximate message passing with non-separable functions","author":"berthier","year":"2017","journal-title":"ArXiv Preprint"},{"key":"ref5","article-title":"Message-passing algorithms for compressed sensing","volume":"106","author":"donoho","year":"0","journal-title":"Proc Nat Acad Sci"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095072"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2400445"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.915688"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.2.021005"},{"key":"ref1","article-title":"Memory approximate message passing","author":"liu","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2947058"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/78.984761"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2916359"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2019.2938170"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2896242"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/49\/11\/114002"},{"key":"ref25","article-title":"Capacity optimality of AMP in coded systems","author":"liu","year":"2019","journal-title":"IEEE Trans Inf Theory"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09518123.pdf?arnumber=9518123","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:25Z","timestamp":1773347665000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518123\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518123","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}