{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:52:03Z","timestamp":1773377523870,"version":"3.50.1"},"reference-count":20,"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.9517942","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"1106-1111","source":"Crossref","is-referenced-by-count":0,"title":["On maximum-likelihood estimation in the all-or-nothing regime"],"prefix":"10.1109","author":[{"given":"Luca","family":"Corinzia","sequence":"first","affiliation":[{"name":"ETH Zürichz,Department of Computer Science,Switzerland"}]},{"given":"Paolo","family":"Penna","sequence":"additional","affiliation":[{"name":"ETH Zürichz,Department of Computer Science,Switzerland"}]},{"given":"Wojciech","family":"Szpankowski","sequence":"additional","affiliation":[{"name":"Purdue University,Department of Computer Science,USA"}]},{"given":"Joachim M.","family":"Buhmann","sequence":"additional","affiliation":[{"name":"ETH Zürichz,Department of Computer Science,Switzerland"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006580"},{"key":"ref11","first-page":"956","article-title":"Tensor principal component analysis via sum-of-square proofs","author":"hopkins","year":"2015","journal-title":"Conference on Learning Theory (COLT)"},{"key":"ref12","first-page":"2052","article-title":"Algorithmic thresholds for tensor pea","volume":"48","author":"arous","year":"2020","journal-title":"Annals of Probability"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8121\/ab7b1f"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1080\/00018732.2016.1211393"},{"key":"ref15","first-page":"2652","article-title":"The all-or-nothing phenomenon in sparse linear regression","author":"reeves","year":"2019","journal-title":"Conference on Learning Theory"},{"key":"ref16","article-title":"All-or-nothing statistical and computational phase transitions in sparse spiked matrix estimation","volume":"33","author":"barbier","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849311"},{"key":"ref18","article-title":"Statistical and computational thresholds for the planted k-densest sub-hypergraph problem","author":"corinzia","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref19","article-title":"High dimensional linear regression with binary coefficients: Mean squared error and a phase transition","author":"gamarnik","year":"2017","journal-title":"Conference on Learning Theory (COLT)"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"18914","DOI":"10.1073\/pnas.0909892106","article-title":"Message-passing algorithms for compressed sensing","volume":"106","author":"donoho","year":"2009","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"ref3","volume":"50","author":"szpankowski","year":"2011","journal-title":"Average Case Analysis of Algorithms on Sequences"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875223"},{"key":"ref5","first-page":"424","article-title":"Mutual information for symmetric rank-one matrix estimation: A proof of the replica formula","author":"barbier","year":"2016","journal-title":"Advances in neural information processing systems"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2637959"},{"key":"ref7","first-page":"2897","article-title":"A statistical model for tensor pea","author":"richard","year":"2014","journal-title":"Advances in neural information processing systems"},{"key":"ref2","article-title":"The all-or-nothing phenomenon in sparse tensor pca","volume":"33","author":"niles-weed","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1214\/19-AAP1547"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1214\/19-AIHP960"},{"key":"ref20","author":"cover","year":"1999","journal-title":"Elements of Information 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\/09517942.pdf?arnumber=9517942","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:15Z","timestamp":1773347655000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517942\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517942","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}