{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T06:19:25Z","timestamp":1787725165553,"version":"build-2784847793"},"reference-count":32,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Israel Science Foundation"},{"name":"National Natural Science Foundation of China"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1109\/isit62367.2026.11653763","type":"proceedings-article","created":{"date-parts":[[2026,8,25]],"date-time":"2026-08-25T19:13:43Z","timestamp":1787685223000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Sparse Principal Component Analysis with Energy Profile Dependent Sample Complexity"],"prefix":"10.1109","author":[{"given":"Mengchu","family":"Xu","sequence":"first","affiliation":[{"name":"Weizmann Institute of Science","place":["Rehovot, Israel"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jian","family":"Wang","sequence":"additional","affiliation":[{"name":"Fudan University","place":["Shanghai, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yonina C.","family":"Eldar","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science","place":["Rehovot, Israel"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Sparse principal component analysis with energy profile dependent sample complexity","author":"Xu","year":"2025"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02288367"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/springerreference_205537"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.1991.139758"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1198\/106186006X113430"},{"key":"ref6","first-page":"185","article-title":"Sparse probabilistic principal component analysis","volume-title":"Proc. Int. Conf. Artif. Intell. Stat. (AISTATS), ser. Proceedings of Machine Learning Research","volume":"5","author":"Guan"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1111\/j.1541-0420.2010.01392.x"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s11336-021-09773-2"},{"key":"ref9","first-page":"1278","article-title":"Minimax rates of estimation for sparse PCA in high dimensions","volume-title":"Proc. Int. Conf. Artif. Intell. Stat. (AISTATS), ser. JMLR Proceedings","volume":"22","author":"Vu"},{"key":"ref10","article-title":"Nonconvex statistical optimization: Minimax-optimal sparse PCA in polynomial time","author":"Wang","year":"2014"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1198\/jasa.2009.0121"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOS1127"},{"key":"ref13","article-title":"Towards sample-optimal compressive phase retrieval with sparse and generative priors","volume":"34","author":"Liu","year":"2021","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOS1097"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/050645506"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1214\/08-AOS664"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/15-AOS1310"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(200003)16:2<195::AID-RSA5>3.0.CO;2-A"},{"key":"ref19","first-page":"1046","article-title":"Complexity theoretic lower bounds for sparse principal component detection","volume-title":"Proc. Conf. Learn. Theory (COLT)","author":"Berthet"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1214\/15-AOS1369"},{"key":"ref21","first-page":"915","article-title":"Spectral bounds for sparse PCA: exact and greedy algorithms","author":"Moghaddam","year":"2006","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref22","first-page":"1269","article-title":"Optimal solutions for sparse principal component analysis","volume":"9","author":"d\u2019Aspremont","year":"2008","journal-title":"J. Mach. Learn. Res."},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1214\/12-AOS1014"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1198\/016214508000000869"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2018.07.021"},{"key":"ref26","first-page":"982","article-title":"Hadamard wirtinger flow for sparse phase retrieval","volume-title":"Proc. Int. Conf. Artif. Intell. Statist","author":"Wu"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6420\/acd8b8"},{"key":"ref28","first-page":"55525","article-title":"Exponential spectral pursuit: An effective initialization method for sparse phase retrieval","volume-title":"Proc. Int. Conf. Mach. Learn., ser. Proceedings of Machine Learning Research","volume":"235","author":"Xu"},{"key":"ref29","first-page":"6319","article-title":"Fast and provable algorithms for sparse PCA with improved sample complexity","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","volume":"267","author":"Cai"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1017\/9781108231596"},{"key":"ref31","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":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/tsp.2026.3679045"}],"event":{"name":"2026 IEEE International Symposium on Information Theory (ISIT)","location":"Guangzhou, China","start":{"date-parts":[[2026,6,28]]},"end":{"date-parts":[[2026,7,3]]}},"container-title":["2026 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11653602\/11653603\/11653763.pdf?arnumber=11653763","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T05:28:54Z","timestamp":1787722134000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11653763\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/isit62367.2026.11653763","relation":{},"subject":[],"published":{"date-parts":[[2026,6]]}}}