{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T00:50:33Z","timestamp":1781916633404,"version":"3.54.5"},"reference-count":40,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2027,6,19]],"date-time":"2027-06-19T00:00:00Z","timestamp":1813363200000},"content-version":"am","delay-in-days":261,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.jco.2026.102065","type":"journal-article","created":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T16:29:11Z","timestamp":1781713751000},"page":"102065","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Fast one-pass sparse approximation of the top eigenvectors of huge approximately low-rank matrices? Yes, MAM\u204e!"],"prefix":"10.1016","volume":"96","author":[{"given":"Edem","family":"Boahen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Simone","family":"Brugiapaglia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hung-Hsu","family":"Chou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mark","family":"Iwen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Felix","family":"Krahmer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.jco.2026.102065_br0010","series-title":"Orthogonal Transforms for Digital Signal Processing","author":"Ahmed","year":"1975"},{"issue":"1","key":"10.1016\/j.jco.2026.102065_br0020","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1137\/060673096","article-title":"The fast Johnson-Lindenstrauss transform and approximate nearest neighbors","volume":"39","author":"Ailon","year":"2009","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/j.jco.2026.102065_br0030","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1007\/s00454-008-9110-x","article-title":"Fast dimension reduction using Rademacher series on dual BCH codes","volume":"42","author":"Ailon","year":"2008","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/j.jco.2026.102065_br0040","series-title":"Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"1729","article-title":"Eigenvalues of a matrix in the streaming model","author":"Andoni","year":"2013"},{"issue":"1","key":"10.1016\/j.jco.2026.102065_br0050","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1137\/110835864","article-title":"On the design of deterministic matrices for fast recovery of Fourier compressible functions","volume":"33","author":"Bailey","year":"2012","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/j.jco.2026.102065_br0060","series-title":"Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing","first-page":"499","article-title":"Toward a unified theory of sparse dimensionality reduction in Euclidean space","author":"Bourgain","year":"2015"},{"key":"10.1016\/j.jco.2026.102065_br0070","series-title":"Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing","first-page":"205","article-title":"Numerical linear algebra in the streaming model","author":"Clarkson","year":"2009"},{"key":"10.1016\/j.jco.2026.102065_br0080","series-title":"Structural Information and Communication Complexity","first-page":"280","article-title":"Combinatorial algorithms for compressed sensing","author":"Cormode","year":"2006"},{"issue":"4","key":"10.1016\/j.jco.2026.102065_br0090","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1016\/j.jco.2007.04.002","article-title":"Deterministic constructions of compressed sensing matrices","volume":"23","author":"DeVore","year":"2007","journal-title":"J. Complex."},{"key":"10.1016\/j.jco.2026.102065_br0100","series-title":"A Mathematical Introduction to Compressive Sensing. Applied and Numerical Harmonic Analysis","author":"Foucart","year":"2013"},{"key":"10.1016\/j.jco.2026.102065_br0110","series-title":"Matrix Computations","author":"Golub","year":"1996"},{"issue":"2","key":"10.1016\/j.jco.2026.102065_br0120","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1137\/090771806","article-title":"Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions","volume":"53","author":"Halko","year":"2011","journal-title":"SIAM Rev."},{"issue":"6","key":"10.1016\/j.jco.2026.102065_br0130","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1214\/aos\/1176344370","article-title":"Hadamard matrices and their applications","volume":"6","author":"Hedayat","year":"1978","journal-title":"Ann. Stat."},{"key":"10.1016\/j.jco.2026.102065_br0140","series-title":"Topics in Matrix Analysis","author":"Horn","year":"1991"},{"issue":"1","key":"10.1016\/j.jco.2026.102065_br0150","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jco.2013.08.001","article-title":"Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time","volume":"30","author":"Iwen","year":"2014","journal-title":"J. Complex."},{"key":"10.1016\/j.jco.2026.102065_br0160","author":"Iwen"},{"key":"10.1016\/j.jco.2026.102065_br0170","series-title":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 08","first-page":"20","article-title":"A deterministic sub-linear time sparse Fourier algorithm via non-adaptive compressed sensing methods","author":"Iwen","year":"2008"},{"key":"10.1016\/j.jco.2026.102065_br0180","series-title":"2009 43rd Annual Conference on Information Sciences and Systems","first-page":"870","article-title":"Simple deterministically constructible RIP matrices with sublinear Fourier sampling requirements","author":"Iwen","year":"2009"},{"issue":"1","key":"10.1016\/j.jco.2026.102065_br0190","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1137\/19M1308116","article-title":"Lower memory oblivious (tensor) subspace embeddings with fewer random bits: modewise methods for least squares","volume":"42","author":"Iwen","year":"2021","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"10.1016\/j.jco.2026.102065_br0200","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1007\/s00454-022-00420-w","article-title":"On fast Johnson-Lindenstrauss embeddings of compact submanifolds of RN with boundary","volume":"71","author":"Iwen","year":"2024","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/j.jco.2026.102065_br0210","doi-asserted-by":"crossref","first-page":"113461","DOI":"10.52202\/079017-3605","article-title":"Approximating the top eigenvector in random order streams","volume":"37","author":"Kacham","year":"2024","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"4(184)","key":"10.1016\/j.jco.2026.102065_br0220","first-page":"251","article-title":"The diameters of octahedra","volume":"30","author":"Kashin","year":"1975","journal-title":"Usp. Mat. Nauk"},{"issue":"3","key":"10.1016\/j.jco.2026.102065_br0230","doi-asserted-by":"crossref","first-page":"1269","DOI":"10.1137\/100810447","article-title":"New and improved Johnson\u2013Lindenstrauss embeddings via the restricted isometry property","volume":"43","author":"Krahmer","year":"2011","journal-title":"SIAM J. Math. Anal."},{"key":"10.1016\/j.jco.2026.102065_br0240","series-title":"2021 IEEE International Symposium on Information Theory (ISIT)","first-page":"1612","article-title":"Construction of binary matrices for near-optimal compressed sensing","author":"Lau","year":"2021"},{"key":"10.1016\/j.jco.2026.102065_br0250","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1017\/S0962492920000021","article-title":"Randomized numerical linear algebra: foundations and algorithms","volume":"29","author":"Martinsson","year":"2020","journal-title":"Acta Numer."},{"issue":"2","key":"10.1016\/j.jco.2026.102065_br0260","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1561\/0400000002","article-title":"Data streams: algorithms and applications","volume":"1","author":"Muthukrishnan","year":"2005","journal-title":"Found. Trends\u00ae Theor. Comput. Sci."},{"issue":"2","key":"10.1016\/j.jco.2026.102065_br0270","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1137\/23M1565413","article-title":"Fast and accurate randomized algorithms for linear systems and eigenvalue problems","volume":"45","author":"Nakatsukasa","year":"2024","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/j.jco.2026.102065_br0280","series-title":"2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)","first-page":"87","article-title":"Testing positive semidefiniteness using linear measurements","author":"Needell","year":"2022"},{"issue":"3","key":"10.1016\/j.jco.2026.102065_br0290","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.acha.2008.07.002","article-title":"CoSaMP: iterative signal recovery from incomplete and inaccurate samples","volume":"26","author":"Needell","year":"2009","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"10.1016\/j.jco.2026.102065_br0300","series-title":"2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)","first-page":"1768","article-title":"Spectral guarantees for adversarial streaming PCA","author":"Price","year":"2024"},{"key":"10.1016\/j.jco.2026.102065_br0310","series-title":"Numerical Methods for Large Eigenvalue Problems","author":"Saad","year":"2011"},{"issue":"5","key":"10.1016\/j.jco.2026.102065_br0320","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1109\/T-C.1969.222685","article-title":"Computation of the fast Walsh-Fourier transform","volume":"100","author":"Shanks","year":"1969","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.jco.2026.102065_br0330","series-title":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","first-page":"145","article-title":"Optimal eigenvalue approximation via sketching","author":"Swartworth","year":"2023"},{"issue":"5","key":"10.1016\/j.jco.2026.102065_br0340","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.1111\/rssb.12291","article-title":"Sparse generalized eigenvalue problem: optimal statistical rates via truncated Rayleigh flow","volume":"80","author":"Tan","year":"2018","journal-title":"J. R. Stat. Soc., Ser. B Stat. Methodol."},{"key":"10.1016\/j.jco.2026.102065_br0350","series-title":"High-Dimensional Probability: An Introduction with Applications in Data Science, vol. 47","author":"Vershynin","year":"2018"},{"key":"10.1016\/j.jco.2026.102065_br0360","series-title":"High-Dimensional Statistics: A Non-asymptotic Viewpoint, vol. 48","author":"Wainwright","year":"2019"},{"issue":"1\u20132","key":"10.1016\/j.jco.2026.102065_br0370","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/0400000060","article-title":"Sketching as a tool for numerical linear algebra","volume":"10","author":"Woodruff","year":"2014","journal-title":"Found. Trends\u00ae Theor. Comput. Sci."},{"issue":"2","key":"10.1016\/j.jco.2026.102065_br0380","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1093\/biomet\/asv008","article-title":"A useful variant of the Davis\u2013Kahan theorem for statisticians","volume":"102","author":"Yu","year":"2015","journal-title":"Biometrika"},{"issue":"4","key":"10.1016\/j.jco.2026.102065_br0390","article-title":"Truncated power method for sparse eigenvalue problems","volume":"14","author":"Yuan","year":"2013","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"10.1016\/j.jco.2026.102065_br0400","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1198\/106186006X113430","article-title":"Sparse principal component analysis","volume":"15","author":"Zou","year":"2006","journal-title":"J. Comput. Graph. Stat."}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0885064X26000506?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0885064X26000506?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T23:54:21Z","timestamp":1781913261000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0885064X26000506"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":40,"alternative-id":["S0885064X26000506"],"URL":"https:\/\/doi.org\/10.1016\/j.jco.2026.102065","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Fast one-pass sparse approximation of the top eigenvectors of huge approximately low-rank matrices? Yes, MAM\u204e!","name":"articletitle","label":"Article Title"},{"value":"Journal of Complexity","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jco.2026.102065","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"102065"}}