{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:32:30Z","timestamp":1755999150376,"version":"3.37.3"},"reference-count":63,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001352","name":"National University of Singapore","doi-asserted-by":"publisher","award":["AcRF Tier-1","A-8000607-00-00 22-5539-A0001"],"award-info":[{"award-number":["AcRF Tier-1","A-8000607-00-00 22-5539-A0001"]}],"id":[{"id":"10.13039\/501100001352","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-2107455","DMS-2210734"],"award-info":[{"award-number":["CCF-2107455","DMS-2210734"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/tsp.2024.3421618","type":"journal-article","created":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T19:52:08Z","timestamp":1719949928000},"page":"3187-3200","source":"Crossref","is-referenced-by-count":2,"title":["Do Algorithms and Barriers for Sparse Principal Component Analysis Extend to Other Structured Settings?"],"prefix":"10.1109","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5491-732X","authenticated-orcid":false,"given":"Guanyi","family":"Wang","sequence":"first","affiliation":[{"name":"Department of Industrial Systems Engineering and Management, National University of Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-5923-2935","authenticated-orcid":false,"given":"Mengqi","family":"Lou","sequence":"additional","affiliation":[{"name":"H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0824-9815","authenticated-orcid":false,"given":"Ashwin","family":"Pananjady","sequence":"additional","affiliation":[{"name":"H. Milton Stewart School of Industrial and Systems Engineering, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.97.18.10101"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595432"},{"key":"ref3","first-page":"1728","article-title":"Stay on path: PCA along graph paths","volume-title":"Proc. Int. Conf. Mach. Learn., PMLR","author":"Asteris","year":"2015"},{"article-title":"Computational hardness of certifying bounds on constrained pca problems","year":"2019","author":"Bandeira","key":"ref4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040894"},{"key":"ref6","first-page":"1046","article-title":"Complexity theoretic lower bounds for sparse principal component detection","volume-title":"Proc. Conf. Learn. Theory, PMLR","author":"Berthet","year":"2013"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27868-9_73"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1214\/12-AOS1014"},{"key":"ref9","first-page":"469","article-title":"Optimal average-case reductions to sparse PCA: From weak assumptions to strong hardness","volume-title":"Proc. Conf. Learn. Theory, PMLR","author":"Brennan","year":"2019"},{"key":"ref10","first-page":"648","article-title":"Reducibility and statistical-computational gaps from secret leakage","volume-title":"Proc. Conf. Learn. Theory, PMLR","author":"Brennan","year":"2020"},{"key":"ref11","first-page":"48","article-title":"Reducibility and computational lower bounds for problems with planted sparse structure","volume-title":"Proc. Conf. Learn. Theory","author":"Brennan","year":"2018"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1080\/757584614"},{"issue":"46","key":"ref13","first-page":"1","article-title":"Optimal structured principal subspace estimation: Metric entropy and minimax rates","volume":"22","author":"Cai","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOS1178"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2013.2278147"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1287\/ijoo.2019.0032"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.563524"},{"issue":"1","key":"ref18","first-page":"4913","article-title":"Sparse PCA via covariance thresholding","volume":"17","author":"Deshpande","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref19","article-title":"Cone-constrained principal component analysis","volume-title":"Proc. Adv. Neural Inf. Process. Syst. 27","author":"Deshpande","year":"2014"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2021.2153"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01857-w"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2022.3169957"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0751-7"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/18M1211350"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2019.2893190"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1117\/12.2529595"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1214\/16-AOS1519"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.3758\/BF03197270"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2000-1-2-research0003"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-84858-7"},{"key":"ref31","first-page":"928","article-title":"A nearly-linear time framework for graph-structured sparsity","volume-title":"Proc. Int. Conf. Mach. Learn., PMLR","author":"Hegde","year":"2015"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1198\/jasa.2009.0121"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1198\/1061860032148"},{"issue":"2","key":"ref34","article-title":"Generalized power method for sparse principal component analysis","volume":"11","author":"Journ\u00e9e","year":"2010","journal-title":"J. Mach. Learn. Res."},{"article-title":"Convexification of permutation-invariant sets and applications","year":"2019","author":"Kim","key":"ref35"},{"article-title":"Exact and approximation algorithms for sparse PCA","year":"2020","author":"Li","key":"ref36"},{"key":"ref37","article-title":"Generative principal component analysis","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Liu","year":"2021"},{"key":"ref38","article-title":"Sum-of-squares lower bounds for sparse PCA","volume-title":"Proc. Adv. Neural Inf. Process. Syst. 28","author":"Ma","year":"2015"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOS1097"},{"key":"ref40","first-page":"1017","article-title":"Deflation methods for sparse PCA","volume-title":"Proc. Adv. Neural Inf. Process. Syst. 21","author":"Mackey","year":"2008"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/b978-0-12-374370-1.x0001-8"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897573"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2457942"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s42452-020-2999-2"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/18.335943"},{"key":"ref47","first-page":"1278","article-title":"Minimax rates of estimation for sparse PCA in high dimensions","volume-title":"Proc. Artif. Intell. Statist.","author":"Vu","year":"2012"},{"key":"ref48","article-title":"Fantope projection and selection: A near-optimal convex relaxation of sparse PCA","volume-title":"Proc. Adv. Neural Inf. Process. Syst, 26","author":"Vu","year":"2013"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOS1151"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1017\/9781108627771"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/tsp.2024.3421618"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1214\/15-AOS1369"},{"key":"ref53","article-title":"A manifold proximal linear method for sparse spectral clustering with application to single-cell RNA sequencing data analysis","author":"Wang","year":"2021","journal-title":"INFORMS J. Optim."},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1093\/biostatistics\/kxp008"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1017939142"},{"article-title":"Non-sparse PCA in high dimensions via cone projected power iteration","year":"2020","author":"Yi","key":"ref56"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1880-7_29"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00532.x"},{"issue":"28","key":"ref59","first-page":"899","article-title":"Truncated power method for sparse eigenvalue problems","volume":"14","author":"Yuan","year":"2013","journal-title":"J. Mach. Learn. Res."},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1080\/00018732.2016.1211393"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0769-0_31"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00503.x"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1198\/106186006X113430"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/78\/10347386\/10582906-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/78\/10347386\/10582906.pdf?arnumber=10582906","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T20:28:18Z","timestamp":1721766498000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10582906\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":63,"URL":"https:\/\/doi.org\/10.1109\/tsp.2024.3421618","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"type":"print","value":"1053-587X"},{"type":"electronic","value":"1941-0476"}],"subject":[],"published":{"date-parts":[[2024]]}}}